./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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/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_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:17:00,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:17:00,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:17:00,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:17:00,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:17:00,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:17:00,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:17:00,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:17:00,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:17:00,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:17:00,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:17:00,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:17:00,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:17:00,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:17:00,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:17:00,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:17:00,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:17:00,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:17:00,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:17:00,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:17:00,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:17:00,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:17:00,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:17:00,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:17:00,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:17:00,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:17:00,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:17:00,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:17:00,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:17:00,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:17:00,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:17:00,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:17:00,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:17:00,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:17:00,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:17:00,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:17:00,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:17:00,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:17:00,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:17:00,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:17:00,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:17:00,472 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:17:00,511 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:17:00,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:17:00,516 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:17:00,516 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:17:00,517 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:17:00,517 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:17:00,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:17:00,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:17:00,519 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:17:00,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:17:00,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:17:00,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:17:00,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:17:00,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:17:00,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:17:00,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:17:00,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:17:00,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:17:00,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:17:00,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:17:00,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:17:00,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:00,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:17:00,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:17:00,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:17:00,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:17:00,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:17:00,525 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:17:00,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:17:00,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:17:00,526 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_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/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_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2022-11-16 12:17:00,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:17:00,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:17:00,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:17:00,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:17:00,899 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:17:00,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-16 12:17:00,974 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/data/5c07bcd33/4820199fe96d4802b0e68258765f009f/FLAG3ab6a788a [2022-11-16 12:17:01,853 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:17:01,853 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-16 12:17:01,895 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/data/5c07bcd33/4820199fe96d4802b0e68258765f009f/FLAG3ab6a788a [2022-11-16 12:17:01,941 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/data/5c07bcd33/4820199fe96d4802b0e68258765f009f [2022-11-16 12:17:01,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:17:01,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:17:01,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:01,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:17:01,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:17:01,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:01" (1/1) ... [2022-11-16 12:17:01,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4edd957c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:01, skipping insertion in model container [2022-11-16 12:17:01,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:01" (1/1) ... [2022-11-16 12:17:01,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:17:02,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:17:03,048 WARN L229 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_5813e867-6b17-4867-b8af-73442dcfaf4f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-16 12:17:03,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:03,153 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:17:03,389 WARN L229 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_5813e867-6b17-4867-b8af-73442dcfaf4f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-16 12:17:03,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:03,489 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:17:03,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03 WrapperNode [2022-11-16 12:17:03,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:03,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:03,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:17:03,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:17:03,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,613 INFO L138 Inliner]: procedures = 77, calls = 264, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 736 [2022-11-16 12:17:03,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:03,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:17:03,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:17:03,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:17:03,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,714 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:17:03,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:17:03,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:17:03,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:17:03,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (1/1) ... [2022-11-16 12:17:03,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:03,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:17:03,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:17:03,848 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2022-11-16 12:17:03,848 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2022-11-16 12:17:03,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:17:03,849 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-16 12:17:03,849 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-16 12:17:03,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:17:03,849 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-16 12:17:03,849 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-16 12:17:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2022-11-16 12:17:03,850 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2022-11-16 12:17:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-16 12:17:03,850 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-16 12:17:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:17:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:17:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-16 12:17:03,851 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-16 12:17:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:17:03,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:17:03,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-16 12:17:03,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-16 12:17:03,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:17:03,852 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-11-16 12:17:03,853 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-11-16 12:17:03,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:17:03,853 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 12:17:03,853 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 12:17:03,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:17:03,854 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-16 12:17:03,854 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-16 12:17:03,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-16 12:17:03,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-16 12:17:03,854 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-16 12:17:03,854 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-16 12:17:03,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-16 12:17:03,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-16 12:17:03,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:17:03,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:17:03,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:17:03,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:17:04,164 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:17:04,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:17:04,425 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-16 12:17:04,449 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 12:17:05,233 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-11-16 12:17:05,233 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-11-16 12:17:05,255 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:17:05,269 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:17:05,270 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 12:17:05,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:05 BoogieIcfgContainer [2022-11-16 12:17:05,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:17:05,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:17:05,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:17:05,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:17:05,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:17:01" (1/3) ... [2022-11-16 12:17:05,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6ec95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:05, skipping insertion in model container [2022-11-16 12:17:05,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:03" (2/3) ... [2022-11-16 12:17:05,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6ec95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:05, skipping insertion in model container [2022-11-16 12:17:05,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:05" (3/3) ... [2022-11-16 12:17:05,286 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-16 12:17:05,307 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:17:05,308 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:17:05,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:17:05,402 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b1d3841, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:17:05,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:17:05,408 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) [2022-11-16 12:17:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:17:05,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:05,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:05,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:05,426 INFO L85 PathProgramCache]: Analyzing trace with hash 567277314, now seen corresponding path program 1 times [2022-11-16 12:17:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:05,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251833613] [2022-11-16 12:17:05,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:05,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:06,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:06,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251833613] [2022-11-16 12:17:06,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251833613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:06,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:06,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:17:06,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228013317] [2022-11-16 12:17:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:06,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:06,208 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) [2022-11-16 12:17:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:06,380 INFO L93 Difference]: Finished difference Result 447 states and 604 transitions. [2022-11-16 12:17:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:06,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-16 12:17:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:06,406 INFO L225 Difference]: With dead ends: 447 [2022-11-16 12:17:06,406 INFO L226 Difference]: Without dead ends: 287 [2022-11-16 12:17:06,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:06,420 INFO L413 NwaCegarLoop]: 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 [2022-11-16 12:17:06,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 408 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-16 12:17:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2022-11-16 12:17:06,514 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) [2022-11-16 12:17:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 350 transitions. [2022-11-16 12:17:06,523 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 350 transitions. Word has length 17 [2022-11-16 12:17:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:06,523 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 350 transitions. [2022-11-16 12:17:06,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:17:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 350 transitions. [2022-11-16 12:17:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:17:06,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:06,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:06,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:17:06,525 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:06,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash 405605840, now seen corresponding path program 1 times [2022-11-16 12:17:06,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:06,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733891229] [2022-11-16 12:17:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:06,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:06,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733891229] [2022-11-16 12:17:06,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733891229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:06,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:06,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:17:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990272521] [2022-11-16 12:17:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:06,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:06,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:06,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:06,775 INFO L87 Difference]: Start difference. First operand 283 states and 350 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:17:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:06,871 INFO L93 Difference]: Finished difference Result 820 states and 1021 transitions. [2022-11-16 12:17:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-16 12:17:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:06,885 INFO L225 Difference]: With dead ends: 820 [2022-11-16 12:17:06,885 INFO L226 Difference]: Without dead ends: 542 [2022-11-16 12:17:06,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:06,892 INFO L413 NwaCegarLoop]: 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 [2022-11-16 12:17:06,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 417 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-11-16 12:17:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 535. [2022-11-16 12:17:06,959 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) [2022-11-16 12:17:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 662 transitions. [2022-11-16 12:17:06,965 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 662 transitions. Word has length 18 [2022-11-16 12:17:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:06,965 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 662 transitions. [2022-11-16 12:17:06,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:17:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 662 transitions. [2022-11-16 12:17:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:17:06,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:06,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:06,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:17:06,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:06,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:06,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1497198459, now seen corresponding path program 1 times [2022-11-16 12:17:06,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:06,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381685235] [2022-11-16 12:17:06,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:06,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:07,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:07,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:07,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:17:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:07,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:07,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381685235] [2022-11-16 12:17:07,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381685235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:07,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:07,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:17:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826900007] [2022-11-16 12:17:07,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:07,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:17:07,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:07,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:17:07,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:17:07,438 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) [2022-11-16 12:17:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:07,967 INFO L93 Difference]: Finished difference Result 1114 states and 1383 transitions. [2022-11-16 12:17:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:07,968 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 [2022-11-16 12:17:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:07,976 INFO L225 Difference]: With dead ends: 1114 [2022-11-16 12:17:07,976 INFO L226 Difference]: Without dead ends: 587 [2022-11-16 12:17:07,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:17:07,985 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 56 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:07,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 748 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:17:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-16 12:17:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 535. [2022-11-16 12:17:08,073 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) [2022-11-16 12:17:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 661 transitions. [2022-11-16 12:17:08,080 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 661 transitions. Word has length 51 [2022-11-16 12:17:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:08,080 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 661 transitions. [2022-11-16 12:17:08,081 INFO L496 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) [2022-11-16 12:17:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 661 transitions. [2022-11-16 12:17:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:17:08,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:08,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:08,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:17:08,087 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:08,088 INFO L85 PathProgramCache]: Analyzing trace with hash 748380995, now seen corresponding path program 1 times [2022-11-16 12:17:08,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:08,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339676152] [2022-11-16 12:17:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:08,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:08,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:08,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:08,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:17:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:08,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339676152] [2022-11-16 12:17:08,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339676152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:08,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:08,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:17:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423566466] [2022-11-16 12:17:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:08,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:17:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:08,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:17:08,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:17:08,487 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) [2022-11-16 12:17:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:08,982 INFO L93 Difference]: Finished difference Result 1233 states and 1565 transitions. [2022-11-16 12:17:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-11-16 12:17:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:08,992 INFO L225 Difference]: With dead ends: 1233 [2022-11-16 12:17:08,992 INFO L226 Difference]: Without dead ends: 709 [2022-11-16 12:17:08,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:17:09,005 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 209 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:09,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 436 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:17:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2022-11-16 12:17:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 606. [2022-11-16 12:17:09,065 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) [2022-11-16 12:17:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 762 transitions. [2022-11-16 12:17:09,070 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 762 transitions. Word has length 51 [2022-11-16 12:17:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:09,070 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 762 transitions. [2022-11-16 12:17:09,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-16 12:17:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2022-11-16 12:17:09,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-16 12:17:09,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:09,080 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:09,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:17:09,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash -38243739, now seen corresponding path program 1 times [2022-11-16 12:17:09,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:09,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299759409] [2022-11-16 12:17:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:09,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:09,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:10,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:10,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:10,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:10,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:17:10,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:10,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299759409] [2022-11-16 12:17:10,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299759409] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:10,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439796890] [2022-11-16 12:17:10,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:10,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:10,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:10,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:10,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:17:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:10,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:17:10,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 12:17:10,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:10,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439796890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:10,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:10,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-16 12:17:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612853134] [2022-11-16 12:17:10,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:10,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:10,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:17:10,796 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) [2022-11-16 12:17:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:10,928 INFO L93 Difference]: Finished difference Result 1189 states and 1524 transitions. [2022-11-16 12:17:10,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:10,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-11-16 12:17:10,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:10,933 INFO L225 Difference]: With dead ends: 1189 [2022-11-16 12:17:10,933 INFO L226 Difference]: Without dead ends: 596 [2022-11-16 12:17:10,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:17:10,936 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 42 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:10,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 677 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-16 12:17:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2022-11-16 12:17:10,982 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) [2022-11-16 12:17:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2022-11-16 12:17:10,985 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2022-11-16 12:17:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:10,985 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2022-11-16 12:17:10,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-16 12:17:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2022-11-16 12:17:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-16 12:17:10,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:10,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:11,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:11,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:11,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539649, now seen corresponding path program 1 times [2022-11-16 12:17:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:11,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328820986] [2022-11-16 12:17:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:12,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:12,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:12,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:12,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:12,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:17:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:12,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:17:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:17:12,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328820986] [2022-11-16 12:17:12,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328820986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:12,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617169629] [2022-11-16 12:17:12,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:12,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:12,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:12,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:12,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:17:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:12,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:17:12,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:17:12,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:12,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617169629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:12,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:12,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-11-16 12:17:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959269634] [2022-11-16 12:17:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:12,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:17:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:17:12,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:17:12,890 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) [2022-11-16 12:17:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:13,142 INFO L93 Difference]: Finished difference Result 906 states and 1163 transitions. [2022-11-16 12:17:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:17:13,143 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 [2022-11-16 12:17:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:13,147 INFO L225 Difference]: With dead ends: 906 [2022-11-16 12:17:13,147 INFO L226 Difference]: Without dead ends: 596 [2022-11-16 12:17:13,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:17:13,150 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 187 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:13,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1771 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-16 12:17:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2022-11-16 12:17:13,195 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) [2022-11-16 12:17:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2022-11-16 12:17:13,198 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 83 [2022-11-16 12:17:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:13,199 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2022-11-16 12:17:13,199 INFO L496 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) [2022-11-16 12:17:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2022-11-16 12:17:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-16 12:17:13,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:13,201 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:13,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:13,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 12:17:13,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:13,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash 23795875, now seen corresponding path program 1 times [2022-11-16 12:17:13,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:13,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118512961] [2022-11-16 12:17:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:13,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:17:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:14,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118512961] [2022-11-16 12:17:14,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118512961] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:14,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189798542] [2022-11-16 12:17:14,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:14,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:14,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:14,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:14,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:17:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:14,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:17:14,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 12:17:15,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:15,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189798542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:15,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:15,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-11-16 12:17:15,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355869053] [2022-11-16 12:17:15,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:15,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:15,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:15,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:17:15,066 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) [2022-11-16 12:17:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:15,311 INFO L93 Difference]: Finished difference Result 661 states and 817 transitions. [2022-11-16 12:17:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:15,312 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 [2022-11-16 12:17:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:15,317 INFO L225 Difference]: With dead ends: 661 [2022-11-16 12:17:15,317 INFO L226 Difference]: Without dead ends: 658 [2022-11-16 12:17:15,318 INFO L412 NwaCegarLoop]: 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 [2022-11-16 12:17:15,319 INFO L413 NwaCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:15,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 375 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:17:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-16 12:17:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 636. [2022-11-16 12:17:15,412 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) [2022-11-16 12:17:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 791 transitions. [2022-11-16 12:17:15,416 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 791 transitions. Word has length 86 [2022-11-16 12:17:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:15,419 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 791 transitions. [2022-11-16 12:17:15,419 INFO L496 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) [2022-11-16 12:17:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 791 transitions. [2022-11-16 12:17:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-16 12:17:15,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:15,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:15,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:15,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 12:17:15,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:15,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:15,644 INFO L85 PathProgramCache]: Analyzing trace with hash -170270410, now seen corresponding path program 1 times [2022-11-16 12:17:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:15,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565052041] [2022-11-16 12:17:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:15,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:17:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:17:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 12:17:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:16,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565052041] [2022-11-16 12:17:16,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565052041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:16,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:16,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:17:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192855231] [2022-11-16 12:17:16,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:16,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:17:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:17:16,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:17:16,025 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) [2022-11-16 12:17:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:16,500 INFO L93 Difference]: Finished difference Result 1320 states and 1645 transitions. [2022-11-16 12:17:16,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:16,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2022-11-16 12:17:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:16,505 INFO L225 Difference]: With dead ends: 1320 [2022-11-16 12:17:16,505 INFO L226 Difference]: Without dead ends: 685 [2022-11-16 12:17:16,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:17:16,508 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 166 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:16,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 570 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:17:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-11-16 12:17:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 596. [2022-11-16 12:17:16,578 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) [2022-11-16 12:17:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2022-11-16 12:17:16,582 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 96 [2022-11-16 12:17:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:16,583 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2022-11-16 12:17:16,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 12:17:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2022-11-16 12:17:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-16 12:17:16,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:16,585 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:16,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:17:16,586 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:16,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:16,586 INFO L85 PathProgramCache]: Analyzing trace with hash 320363955, now seen corresponding path program 1 times [2022-11-16 12:17:16,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:16,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773253728] [2022-11-16 12:17:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:16,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:17:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:17:17,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:17,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773253728] [2022-11-16 12:17:17,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773253728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:17,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092869978] [2022-11-16 12:17:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:17,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:17,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:17,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:17,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:17:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:17:18,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:20,241 WARN L855 $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 [2022-11-16 12:17:20,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-16 12:17:20,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-16 12:17:20,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-16 12:17:20,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 12:17:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 12:17:20,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:20,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092869978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:20,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:20,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-11-16 12:17:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441418549] [2022-11-16 12:17:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:20,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:17:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:17:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=241, Unknown=1, NotChecked=30, Total=306 [2022-11-16 12:17:20,600 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) [2022-11-16 12:17:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:21,580 INFO L93 Difference]: Finished difference Result 702 states and 868 transitions. [2022-11-16 12:17:21,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:17:21,581 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 [2022-11-16 12:17:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:21,585 INFO L225 Difference]: With dead ends: 702 [2022-11-16 12:17:21,585 INFO L226 Difference]: Without dead ends: 661 [2022-11-16 12:17:21,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=42, Invalid=303, Unknown=1, NotChecked=34, Total=380 [2022-11-16 12:17:21,587 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:21,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1058 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 238 Unchecked, 0.8s Time] [2022-11-16 12:17:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-11-16 12:17:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2022-11-16 12:17:21,663 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) [2022-11-16 12:17:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 785 transitions. [2022-11-16 12:17:21,667 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 785 transitions. Word has length 105 [2022-11-16 12:17:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:21,667 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 785 transitions. [2022-11-16 12:17:21,668 INFO L496 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) [2022-11-16 12:17:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 785 transitions. [2022-11-16 12:17:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-16 12:17:21,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:21,670 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:21,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:21,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:21,879 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1953167954, now seen corresponding path program 1 times [2022-11-16 12:17:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:21,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282346856] [2022-11-16 12:17:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:21,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:17:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:17:22,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:22,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282346856] [2022-11-16 12:17:22,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282346856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:22,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99176021] [2022-11-16 12:17:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:22,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:22,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:22,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:22,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:17:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:23,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:17:23,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 12:17:23,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:23,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99176021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:23,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:23,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-11-16 12:17:23,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89073076] [2022-11-16 12:17:23,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:23,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:17:23,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:23,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:17:23,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:17:23,697 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) [2022-11-16 12:17:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:23,996 INFO L93 Difference]: Finished difference Result 1390 states and 1777 transitions. [2022-11-16 12:17:23,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:17:23,997 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 [2022-11-16 12:17:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:24,001 INFO L225 Difference]: With dead ends: 1390 [2022-11-16 12:17:24,001 INFO L226 Difference]: Without dead ends: 810 [2022-11-16 12:17:24,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:17:24,004 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 147 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:24,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 2158 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-11-16 12:17:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 628. [2022-11-16 12:17:24,081 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) [2022-11-16 12:17:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 781 transitions. [2022-11-16 12:17:24,085 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 781 transitions. Word has length 105 [2022-11-16 12:17:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:24,086 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 781 transitions. [2022-11-16 12:17:24,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 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) [2022-11-16 12:17:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 781 transitions. [2022-11-16 12:17:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-16 12:17:24,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:24,088 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:24,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:24,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:17:24,297 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:24,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1044819566, now seen corresponding path program 1 times [2022-11-16 12:17:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:24,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877406053] [2022-11-16 12:17:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:24,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:17:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 12:17:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:17:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:17:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:25,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877406053] [2022-11-16 12:17:25,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877406053] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:25,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966860406] [2022-11-16 12:17:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:25,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:25,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:25,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:25,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:17:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:25,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 12:17:25,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:17:26,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:26,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966860406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:26,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:26,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2022-11-16 12:17:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965011406] [2022-11-16 12:17:26,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:26,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:17:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:26,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:17:26,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:17:26,133 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) [2022-11-16 12:17:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:26,383 INFO L93 Difference]: Finished difference Result 1262 states and 1579 transitions. [2022-11-16 12:17:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:17:26,384 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 [2022-11-16 12:17:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:26,388 INFO L225 Difference]: With dead ends: 1262 [2022-11-16 12:17:26,388 INFO L226 Difference]: Without dead ends: 677 [2022-11-16 12:17:26,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:17:26,391 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 25 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:26,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1536 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:26,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-11-16 12:17:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 648. [2022-11-16 12:17:26,464 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) [2022-11-16 12:17:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2022-11-16 12:17:26,468 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2022-11-16 12:17:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:26,469 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2022-11-16 12:17:26,469 INFO L496 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) [2022-11-16 12:17:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2022-11-16 12:17:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-16 12:17:26,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:26,472 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:26,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:26,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 12:17:26,681 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:26,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1482829069, now seen corresponding path program 1 times [2022-11-16 12:17:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:26,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377624248] [2022-11-16 12:17:26,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:26,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:17:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 12:17:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:17:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:17:27,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:27,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377624248] [2022-11-16 12:17:27,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377624248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:27,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072640904] [2022-11-16 12:17:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:27,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:27,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:27,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:27,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:17:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:28,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:17:28,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 12:17:28,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:28,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072640904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:28,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:28,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-11-16 12:17:28,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729034836] [2022-11-16 12:17:28,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:28,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:17:28,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:28,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:17:28,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:17:28,532 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) [2022-11-16 12:17:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:28,774 INFO L93 Difference]: Finished difference Result 856 states and 1088 transitions. [2022-11-16 12:17:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:17:28,775 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 [2022-11-16 12:17:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:28,779 INFO L225 Difference]: With dead ends: 856 [2022-11-16 12:17:28,779 INFO L226 Difference]: Without dead ends: 821 [2022-11-16 12:17:28,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:17:28,781 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 187 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:28,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1928 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-16 12:17:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 648. [2022-11-16 12:17:28,870 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) [2022-11-16 12:17:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2022-11-16 12:17:28,875 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2022-11-16 12:17:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:28,876 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2022-11-16 12:17:28,876 INFO L496 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) [2022-11-16 12:17:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2022-11-16 12:17:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-16 12:17:28,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:28,878 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:28,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:29,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:17:29,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:29,087 INFO L85 PathProgramCache]: Analyzing trace with hash 966922471, now seen corresponding path program 1 times [2022-11-16 12:17:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:29,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339801782] [2022-11-16 12:17:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 12:17:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 12:17:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 12:17:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 12:17:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339801782] [2022-11-16 12:17:29,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339801782] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822815635] [2022-11-16 12:17:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:29,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:29,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:29,898 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:29,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:17:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:17:30,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-16 12:17:30,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-16 12:17:31,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822815635] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:31,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:17:31,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 17 [2022-11-16 12:17:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653913046] [2022-11-16 12:17:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:31,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:17:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:17:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:17:31,053 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) [2022-11-16 12:17:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:31,833 INFO L93 Difference]: Finished difference Result 1874 states and 2335 transitions. [2022-11-16 12:17:31,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:17:31,834 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 [2022-11-16 12:17:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:31,841 INFO L225 Difference]: With dead ends: 1874 [2022-11-16 12:17:31,842 INFO L226 Difference]: Without dead ends: 1250 [2022-11-16 12:17:31,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:17:31,847 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 364 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:31,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 644 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:17:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-11-16 12:17:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1210. [2022-11-16 12:17:31,989 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) [2022-11-16 12:17:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1504 transitions. [2022-11-16 12:17:32,003 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1504 transitions. Word has length 108 [2022-11-16 12:17:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:32,004 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 1504 transitions. [2022-11-16 12:17:32,004 INFO L496 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) [2022-11-16 12:17:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1504 transitions. [2022-11-16 12:17:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 12:17:32,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:32,008 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:32,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:32,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:17:32,224 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:32,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:32,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1819211607, now seen corresponding path program 1 times [2022-11-16 12:17:32,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:32,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197181082] [2022-11-16 12:17:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:17:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:33,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197181082] [2022-11-16 12:17:33,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197181082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:33,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760293932] [2022-11-16 12:17:33,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:33,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:33,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:33,357 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:33,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:17:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:34,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 1806 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:17:34,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 12:17:34,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:34,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760293932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:34,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:34,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-16 12:17:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800748383] [2022-11-16 12:17:34,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:34,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:34,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:34,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:34,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:17:34,263 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) [2022-11-16 12:17:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:34,430 INFO L93 Difference]: Finished difference Result 1861 states and 2314 transitions. [2022-11-16 12:17:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:34,430 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 [2022-11-16 12:17:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:34,438 INFO L225 Difference]: With dead ends: 1861 [2022-11-16 12:17:34,438 INFO L226 Difference]: Without dead ends: 697 [2022-11-16 12:17:34,442 INFO L412 NwaCegarLoop]: 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 [2022-11-16 12:17:34,443 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 14 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:34,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 589 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:34,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-16 12:17:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 667. [2022-11-16 12:17:34,562 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) [2022-11-16 12:17:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 823 transitions. [2022-11-16 12:17:34,567 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 823 transitions. Word has length 116 [2022-11-16 12:17:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:34,567 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 823 transitions. [2022-11-16 12:17:34,567 INFO L496 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) [2022-11-16 12:17:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 823 transitions. [2022-11-16 12:17:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 12:17:34,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:34,570 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:34,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-16 12:17:34,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 12:17:34,780 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2067358101, now seen corresponding path program 1 times [2022-11-16 12:17:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:34,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261610068] [2022-11-16 12:17:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:17:35,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:35,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261610068] [2022-11-16 12:17:35,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261610068] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:35,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355232819] [2022-11-16 12:17:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:35,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:35,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:35,845 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:35,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:17:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:36,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 1805 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:17:36,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 12:17:37,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:37,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355232819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:37,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:37,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-11-16 12:17:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029460923] [2022-11-16 12:17:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:37,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:37,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:37,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:37,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:17:37,008 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) [2022-11-16 12:17:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:37,288 INFO L93 Difference]: Finished difference Result 1213 states and 1506 transitions. [2022-11-16 12:17:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:37,289 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 [2022-11-16 12:17:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:37,295 INFO L225 Difference]: With dead ends: 1213 [2022-11-16 12:17:37,295 INFO L226 Difference]: Without dead ends: 1208 [2022-11-16 12:17:37,298 INFO L412 NwaCegarLoop]: 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 [2022-11-16 12:17:37,300 INFO L413 NwaCegarLoop]: 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 [2022-11-16 12:17:37,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 339 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-11-16 12:17:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1176. [2022-11-16 12:17:37,442 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) [2022-11-16 12:17:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1466 transitions. [2022-11-16 12:17:37,447 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1466 transitions. Word has length 116 [2022-11-16 12:17:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:37,448 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1466 transitions. [2022-11-16 12:17:37,448 INFO L496 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) [2022-11-16 12:17:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2022-11-16 12:17:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-16 12:17:37,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:37,451 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:37,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:37,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:17:37,662 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash 541721343, now seen corresponding path program 1 times [2022-11-16 12:17:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:37,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229427570] [2022-11-16 12:17:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:17:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-16 12:17:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-16 12:17:38,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:38,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229427570] [2022-11-16 12:17:38,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229427570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:38,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567523938] [2022-11-16 12:17:38,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:38,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:38,688 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:38,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:17:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:39,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 1861 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:17:39,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 12:17:39,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:39,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567523938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:39,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:39,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-16 12:17:39,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923722185] [2022-11-16 12:17:39,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:39,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:39,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:39,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:17:39,702 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) [2022-11-16 12:17:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:39,975 INFO L93 Difference]: Finished difference Result 1368 states and 1732 transitions. [2022-11-16 12:17:39,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:39,977 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 [2022-11-16 12:17:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:39,983 INFO L225 Difference]: With dead ends: 1368 [2022-11-16 12:17:39,983 INFO L226 Difference]: Without dead ends: 1358 [2022-11-16 12:17:39,984 INFO L412 NwaCegarLoop]: 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 [2022-11-16 12:17:39,985 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 214 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:39,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 446 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-11-16 12:17:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1182. [2022-11-16 12:17:40,139 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) [2022-11-16 12:17:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1472 transitions. [2022-11-16 12:17:40,145 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1472 transitions. Word has length 129 [2022-11-16 12:17:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:40,145 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1472 transitions. [2022-11-16 12:17:40,146 INFO L496 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) [2022-11-16 12:17:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1472 transitions. [2022-11-16 12:17:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-16 12:17:40,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:40,149 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:17:40,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:40,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:40,359 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:40,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash -554191626, now seen corresponding path program 1 times [2022-11-16 12:17:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:40,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113385422] [2022-11-16 12:17:40,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 12:17:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 12:17:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-16 12:17:41,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113385422] [2022-11-16 12:17:41,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113385422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173530951] [2022-11-16 12:17:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:41,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:41,397 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:41,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:17:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:42,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 1873 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:17:42,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 12:17:42,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:42,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173530951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:42,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:42,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-16 12:17:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267337422] [2022-11-16 12:17:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:42,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:42,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:42,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:42,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:17:42,447 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) [2022-11-16 12:17:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:42,655 INFO L93 Difference]: Finished difference Result 2302 states and 2876 transitions. [2022-11-16 12:17:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:42,656 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 [2022-11-16 12:17:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:42,662 INFO L225 Difference]: With dead ends: 2302 [2022-11-16 12:17:42,662 INFO L226 Difference]: Without dead ends: 1110 [2022-11-16 12:17:42,666 INFO L412 NwaCegarLoop]: 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 [2022-11-16 12:17:42,666 INFO L413 NwaCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:42,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 423 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-11-16 12:17:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2022-11-16 12:17:42,808 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) [2022-11-16 12:17:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1336 transitions. [2022-11-16 12:17:42,814 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1336 transitions. Word has length 133 [2022-11-16 12:17:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:42,814 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1336 transitions. [2022-11-16 12:17:42,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-16 12:17:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1336 transitions. [2022-11-16 12:17:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-16 12:17:42,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:42,817 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:42,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:43,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 12:17:43,028 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash 78838695, now seen corresponding path program 1 times [2022-11-16 12:17:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:43,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685874874] [2022-11-16 12:17:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:17:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:43,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 12:17:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 12:17:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:44,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-16 12:17:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:17:44,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:44,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685874874] [2022-11-16 12:17:44,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685874874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:44,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935512141] [2022-11-16 12:17:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:44,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:44,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:44,024 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:44,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:17:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:44,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 1905 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 12:17:44,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-16 12:17:45,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:45,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935512141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:45,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:45,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2022-11-16 12:17:45,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640671942] [2022-11-16 12:17:45,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:45,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:17:45,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:17:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:17:45,224 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) [2022-11-16 12:17:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:45,513 INFO L93 Difference]: Finished difference Result 2194 states and 2647 transitions. [2022-11-16 12:17:45,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:17:45,514 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 [2022-11-16 12:17:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:45,522 INFO L225 Difference]: With dead ends: 2194 [2022-11-16 12:17:45,523 INFO L226 Difference]: Without dead ends: 1139 [2022-11-16 12:17:45,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:17:45,527 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 29 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:45,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1590 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-11-16 12:17:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1110. [2022-11-16 12:17:45,714 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) [2022-11-16 12:17:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1331 transitions. [2022-11-16 12:17:45,720 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1331 transitions. Word has length 144 [2022-11-16 12:17:45,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:45,723 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1331 transitions. [2022-11-16 12:17:45,723 INFO L496 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) [2022-11-16 12:17:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1331 transitions. [2022-11-16 12:17:45,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-16 12:17:45,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:45,726 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:17:45,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:45,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:17:45,937 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash 92371496, now seen corresponding path program 2 times [2022-11-16 12:17:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:45,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645849907] [2022-11-16 12:17:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:17:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 12:17:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 12:17:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-16 12:17:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:17:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:46,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645849907] [2022-11-16 12:17:46,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645849907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:46,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382308037] [2022-11-16 12:17:46,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:17:46,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:46,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:46,908 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:46,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:17:48,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:17:48,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:17:48,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:17:48,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 12:17:48,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:48,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382308037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:48,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:48,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-11-16 12:17:48,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311222898] [2022-11-16 12:17:48,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:48,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:48,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:48,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:17:48,099 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) [2022-11-16 12:17:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:48,174 INFO L93 Difference]: Finished difference Result 1485 states and 1777 transitions. [2022-11-16 12:17:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:48,175 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 [2022-11-16 12:17:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:48,178 INFO L225 Difference]: With dead ends: 1485 [2022-11-16 12:17:48,178 INFO L226 Difference]: Without dead ends: 437 [2022-11-16 12:17:48,181 INFO L412 NwaCegarLoop]: 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 [2022-11-16 12:17:48,182 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 5 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 354 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 [2022-11-16 12:17:48,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 354 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-16 12:17:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 431. [2022-11-16 12:17:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 325 states have (on average 1.12) internal successors, (364), 331 states have internal predecessors, (364), 60 states have call successors, (60), 37 states have call predecessors, (60), 45 states have return successors, (73), 62 states have call predecessors, (73), 56 states have call successors, (73) [2022-11-16 12:17:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 497 transitions. [2022-11-16 12:17:48,242 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 497 transitions. Word has length 144 [2022-11-16 12:17:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:48,243 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 497 transitions. [2022-11-16 12:17:48,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (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) [2022-11-16 12:17:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 497 transitions. [2022-11-16 12:17:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-16 12:17:48,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:48,246 INFO L195 NwaCegarLoop]: 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] [2022-11-16 12:17:48,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:48,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:48,458 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 987398563, now seen corresponding path program 1 times [2022-11-16 12:17:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:48,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976002506] [2022-11-16 12:17:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:17:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 12:17:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 12:17:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:17:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:17:49,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:49,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976002506] [2022-11-16 12:17:49,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976002506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:49,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421147516] [2022-11-16 12:17:49,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:49,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:49,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:49,545 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:49,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 12:17:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:50,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 1914 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 12:17:50,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 12:17:50,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:50,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421147516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:50,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:50,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 16 [2022-11-16 12:17:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735311596] [2022-11-16 12:17:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:50,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:17:50,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:17:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:17:50,881 INFO L87 Difference]: Start difference. First operand 431 states and 497 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 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) [2022-11-16 12:17:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:51,212 INFO L93 Difference]: Finished difference Result 881 states and 1021 transitions. [2022-11-16 12:17:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:17:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 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 146 [2022-11-16 12:17:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:51,215 INFO L225 Difference]: With dead ends: 881 [2022-11-16 12:17:51,215 INFO L226 Difference]: Without dead ends: 482 [2022-11-16 12:17:51,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:17:51,217 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 26 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:51,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1796 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-16 12:17:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 454. [2022-11-16 12:17:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 345 states have (on average 1.1188405797101448) internal successors, (386), 349 states have internal predecessors, (386), 60 states have call successors, (60), 37 states have call predecessors, (60), 48 states have return successors, (78), 67 states have call predecessors, (78), 56 states have call successors, (78) [2022-11-16 12:17:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 524 transitions. [2022-11-16 12:17:51,282 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 524 transitions. Word has length 146 [2022-11-16 12:17:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:51,282 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 524 transitions. [2022-11-16 12:17:51,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 8 states have internal predecessors, (100), 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) [2022-11-16 12:17:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 524 transitions. [2022-11-16 12:17:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-16 12:17:51,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:51,285 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:51,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:51,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-16 12:17:51,501 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash 468106276, now seen corresponding path program 2 times [2022-11-16 12:17:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:51,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687437434] [2022-11-16 12:17:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:51,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:17:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 12:17:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 12:17:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-16 12:17:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:17:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:52,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687437434] [2022-11-16 12:17:52,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687437434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:52,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930896914] [2022-11-16 12:17:52,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:17:52,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:52,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:52,396 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:52,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 12:17:53,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:17:53,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:17:53,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:17:53,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 12:17:53,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:53,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930896914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:53,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:53,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-11-16 12:17:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973371931] [2022-11-16 12:17:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:53,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:53,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:53,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:17:53,653 INFO L87 Difference]: Start difference. First operand 454 states and 524 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2022-11-16 12:17:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:53,696 INFO L93 Difference]: Finished difference Result 698 states and 809 transitions. [2022-11-16 12:17:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:53,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 146 [2022-11-16 12:17:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:53,699 INFO L225 Difference]: With dead ends: 698 [2022-11-16 12:17:53,700 INFO L226 Difference]: Without dead ends: 311 [2022-11-16 12:17:53,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:17:53,702 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 5 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 352 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 [2022-11-16 12:17:53,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 352 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-16 12:17:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-11-16 12:17:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 235 states have (on average 1.1063829787234043) internal successors, (260), 238 states have internal predecessors, (260), 42 states have call successors, (42), 26 states have call predecessors, (42), 31 states have return successors, (48), 44 states have call predecessors, (48), 38 states have call successors, (48) [2022-11-16 12:17:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 350 transitions. [2022-11-16 12:17:53,750 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 350 transitions. Word has length 146 [2022-11-16 12:17:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:53,750 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 350 transitions. [2022-11-16 12:17:53,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2022-11-16 12:17:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 350 transitions. [2022-11-16 12:17:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-16 12:17:53,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:53,753 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:53,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-16 12:17:53,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:53,966 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:53,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1408588503, now seen corresponding path program 1 times [2022-11-16 12:17:53,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:53,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738272812] [2022-11-16 12:17:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:17:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:17:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:17:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 12:17:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-16 12:17:54,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:54,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738272812] [2022-11-16 12:17:54,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738272812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:54,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491477208] [2022-11-16 12:17:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:54,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:54,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:54,820 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:54,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 12:17:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:56,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 1923 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:17:56,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 12:17:56,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:56,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491477208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:56,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:56,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-11-16 12:17:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246814055] [2022-11-16 12:17:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:56,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:17:56,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:56,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:17:56,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:17:56,327 INFO L87 Difference]: Start difference. First operand 309 states and 350 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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) [2022-11-16 12:17:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:56,813 INFO L93 Difference]: Finished difference Result 311 states and 351 transitions. [2022-11-16 12:17:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:56,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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 148 [2022-11-16 12:17:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:56,816 INFO L225 Difference]: With dead ends: 311 [2022-11-16 12:17:56,816 INFO L226 Difference]: Without dead ends: 259 [2022-11-16 12:17:56,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:17:56,818 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 142 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:56,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 447 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:17:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-16 12:17:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2022-11-16 12:17:56,853 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) [2022-11-16 12:17:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2022-11-16 12:17:56,855 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 148 [2022-11-16 12:17:56,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:56,856 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2022-11-16 12:17:56,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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) [2022-11-16 12:17:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-11-16 12:17:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-16 12:17:56,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:56,859 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:56,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:57,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:57,073 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 301053376, now seen corresponding path program 1 times [2022-11-16 12:17:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:57,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77867108] [2022-11-16 12:17:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:17:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 12:17:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 12:17:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:17:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 12:17:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:17:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 12:17:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 12:17:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 12:17:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 12:17:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:57,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-16 12:17:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:17:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:58,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 12:17:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:58,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 12:17:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:58,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-16 12:17:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-16 12:17:58,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:58,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77867108] [2022-11-16 12:17:58,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77867108] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:58,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896008900] [2022-11-16 12:17:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:58,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:58,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:58,052 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:17:58,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 12:17:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:59,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 2075 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:17:59,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-16 12:17:59,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:59,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896008900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:59,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:17:59,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-11-16 12:17:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694682960] [2022-11-16 12:17:59,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:59,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:17:59,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:17:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:17:59,283 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) [2022-11-16 12:17:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:59,379 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2022-11-16 12:17:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:17:59,380 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 [2022-11-16 12:17:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:59,381 INFO L225 Difference]: With dead ends: 251 [2022-11-16 12:17:59,381 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 12:17:59,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:17:59,382 INFO L413 NwaCegarLoop]: 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 [2022-11-16 12:17:59,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 572 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 12:17:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 12:17:59,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 12:17:59,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2022-11-16 12:17:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:59,385 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 12:17:59,385 INFO L496 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) [2022-11-16 12:17:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 12:17:59,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 12:17:59,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:17:59,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:59,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 12:17:59,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-16 12:18:32,018 WARN L233 SmtUtils]: Spent 27.17s on a formula simplification. DAG size of input: 150 DAG size of output: 146 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-16 12:19:02,245 WARN L233 SmtUtils]: Spent 25.11s on a formula simplification. DAG size of input: 150 DAG size of output: 146 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-16 12:19:15,858 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 54 DAG size of output: 39 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-16 12:19:29,002 WARN L233 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 48 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-16 12:19:33,304 INFO L902 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2022-11-16 12:19:33,304 INFO L899 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2022-11-16 12:19:33,304 INFO L902 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2022-11-16 12:19:33,304 INFO L902 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2022-11-16 12:19:33,304 INFO L902 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2022-11-16 12:19:33,304 INFO L899 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2022-11-16 12:19:33,304 INFO L899 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2022-11-16 12:19:33,304 INFO L899 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2022-11-16 12:19:33,304 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2022-11-16 12:19:33,304 INFO L895 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))) [2022-11-16 12:19:33,305 INFO L895 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))) [2022-11-16 12:19:33,305 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2022-11-16 12:19:33,305 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2022-11-16 12:19:33,305 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 4264 4266) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |old(#valid)| |#valid|)) [2022-11-16 12:19:33,305 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2022-11-16 12:19:33,305 INFO L899 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2022-11-16 12:19:33,305 INFO L902 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2022-11-16 12:19:33,306 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2022-11-16 12:19:33,306 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2022-11-16 12:19:33,306 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2022-11-16 12:19:33,306 INFO L899 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2022-11-16 12:19:33,306 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2022-11-16 12:19:33,313 INFO L895 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 .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))) [2022-11-16 12:19:33,313 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2022-11-16 12:19:33,314 INFO L902 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2022-11-16 12:19:33,315 INFO L899 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2022-11-16 12:19:33,315 INFO L895 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))) [2022-11-16 12:19:33,316 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2022-11-16 12:19:33,316 INFO L895 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))) [2022-11-16 12:19:33,316 INFO L899 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2022-11-16 12:19:33,316 INFO L899 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2022-11-16 12:19:33,316 INFO L895 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)))) [2022-11-16 12:19:33,317 INFO L895 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))) [2022-11-16 12:19:33,317 INFO L899 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2022-11-16 12:19:33,317 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2022-11-16 12:19:33,317 INFO L902 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2022-11-16 12:19:33,317 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2022-11-16 12:19:33,317 INFO L899 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2022-11-16 12:19:33,318 INFO L902 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2022-11-16 12:19:33,318 INFO L902 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2022-11-16 12:19:33,318 INFO L899 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2022-11-16 12:19:33,318 INFO L895 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))) [2022-11-16 12:19:33,318 INFO L899 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2022-11-16 12:19:33,319 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2022-11-16 12:19:33,319 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2022-11-16 12:19:33,319 INFO L895 garLoopResultBuilder]: At program point L4207(line 4207) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-11-16 12:19:33,319 INFO L899 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2022-11-16 12:19:33,319 INFO L902 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2022-11-16 12:19:33,319 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2022-11-16 12:19:33,320 INFO L902 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2022-11-16 12:19:33,320 INFO L895 garLoopResultBuilder]: At program point kzallocENTRY(lines 3405 3413) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-11-16 12:19:33,320 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2022-11-16 12:19:33,320 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2022-11-16 12:19:33,320 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2022-11-16 12:19:33,321 INFO L895 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))) [2022-11-16 12:19:33,321 INFO L895 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))) [2022-11-16 12:19:33,321 INFO L899 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2022-11-16 12:19:33,321 INFO L895 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))) [2022-11-16 12:19:33,321 INFO L899 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2022-11-16 12:19:33,321 INFO L902 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2022-11-16 12:19:33,322 INFO L899 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2022-11-16 12:19:33,322 INFO L895 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))) [2022-11-16 12:19:33,322 INFO L899 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2022-11-16 12:19:33,322 INFO L899 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2022-11-16 12:19:33,322 INFO L895 garLoopResultBuilder]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-16 12:19:33,322 INFO L899 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2022-11-16 12:19:33,323 INFO L895 garLoopResultBuilder]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .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))) [2022-11-16 12:19:33,323 INFO L895 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)) [2022-11-16 12:19:33,323 INFO L895 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)) [2022-11-16 12:19:33,323 INFO L899 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2022-11-16 12:19:33,323 INFO L899 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2022-11-16 12:19:33,324 INFO L899 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2022-11-16 12:19:33,324 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-16 12:19:33,324 INFO L899 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2022-11-16 12:19:33,324 INFO L895 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))) [2022-11-16 12:19:33,324 INFO L899 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2022-11-16 12:19:33,325 INFO L895 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)) [2022-11-16 12:19:33,325 INFO L899 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2022-11-16 12:19:33,325 INFO L899 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2022-11-16 12:19:33,325 INFO L899 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2022-11-16 12:19:33,325 INFO L895 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)) [2022-11-16 12:19:33,325 INFO L899 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2022-11-16 12:19:33,326 INFO L895 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)) [2022-11-16 12:19:33,326 INFO L895 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)))) [2022-11-16 12:19:33,326 INFO L899 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2022-11-16 12:19:33,326 INFO L899 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2022-11-16 12:19:33,326 INFO L895 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .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))) [2022-11-16 12:19:33,327 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-11-16 12:19:33,327 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2022-11-16 12:19:33,327 INFO L899 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2022-11-16 12:19:33,327 INFO L899 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2022-11-16 12:19:33,327 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2022-11-16 12:19:33,327 INFO L899 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2022-11-16 12:19:33,327 INFO L899 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2022-11-16 12:19:33,328 INFO L895 garLoopResultBuilder]: At program point L4037(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-16 12:19:33,328 INFO L895 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)) [2022-11-16 12:19:33,328 INFO L895 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))) [2022-11-16 12:19:33,328 INFO L899 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2022-11-16 12:19:33,328 INFO L895 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)) [2022-11-16 12:19:33,329 INFO L895 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)) [2022-11-16 12:19:33,329 INFO L895 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)) [2022-11-16 12:19:33,329 INFO L895 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))) [2022-11-16 12:19:33,329 INFO L899 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2022-11-16 12:19:33,329 INFO L895 garLoopResultBuilder]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-11-16 12:19:33,330 INFO L895 garLoopResultBuilder]: At program point L3972(line 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-11-16 12:19:33,330 INFO L899 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2022-11-16 12:19:33,330 INFO L895 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)) [2022-11-16 12:19:33,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-16 12:19:33,330 INFO L899 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2022-11-16 12:19:33,330 INFO L895 garLoopResultBuilder]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .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))) [2022-11-16 12:19:33,331 INFO L895 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2022-11-16 12:19:33,331 INFO L895 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)) [2022-11-16 12:19:33,331 INFO L895 garLoopResultBuilder]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-16 12:19:33,331 INFO L895 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)) [2022-11-16 12:19:33,331 INFO L895 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)) [2022-11-16 12:19:33,332 INFO L899 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2022-11-16 12:19:33,332 INFO L895 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))) [2022-11-16 12:19:33,332 INFO L895 garLoopResultBuilder]: At program point L4073(line 4073) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-16 12:19:33,332 INFO L899 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2022-11-16 12:19:33,332 INFO L895 garLoopResultBuilder]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2022-11-16 12:19:33,332 INFO L899 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2022-11-16 12:19:33,333 INFO L895 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)) [2022-11-16 12:19:33,333 INFO L899 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2022-11-16 12:19:33,333 INFO L895 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)) [2022-11-16 12:19:33,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-16 12:19:33,333 INFO L899 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2022-11-16 12:19:33,334 INFO L895 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)) [2022-11-16 12:19:33,334 INFO L895 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)) [2022-11-16 12:19:33,334 INFO L899 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2022-11-16 12:19:33,334 INFO L895 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)) [2022-11-16 12:19:33,334 INFO L899 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2022-11-16 12:19:33,334 INFO L895 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))) [2022-11-16 12:19:33,335 INFO L895 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)) [2022-11-16 12:19:33,335 INFO L895 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-16 12:19:33,335 INFO L899 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2022-11-16 12:19:33,335 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2022-11-16 12:19:33,335 INFO L899 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2022-11-16 12:19:33,335 INFO L895 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-16 12:19:33,336 INFO L895 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2022-11-16 12:19:33,336 INFO L895 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)))) [2022-11-16 12:19:33,336 INFO L895 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)))) [2022-11-16 12:19:33,336 INFO L895 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)))) [2022-11-16 12:19:33,336 INFO L899 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2022-11-16 12:19:33,337 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-16 12:19:33,337 INFO L895 garLoopResultBuilder]: At program point L3798(line 3798) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-16 12:19:33,337 INFO L899 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2022-11-16 12:19:33,337 INFO L895 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)) [2022-11-16 12:19:33,337 INFO L899 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2022-11-16 12:19:33,337 INFO L899 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2022-11-16 12:19:33,338 INFO L895 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)))) [2022-11-16 12:19:33,338 INFO L895 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|)))) [2022-11-16 12:19:33,338 INFO L899 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2022-11-16 12:19:33,338 INFO L895 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)) [2022-11-16 12:19:33,339 INFO L899 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2022-11-16 12:19:33,339 INFO L895 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)) [2022-11-16 12:19:33,339 INFO L895 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)))) [2022-11-16 12:19:33,339 INFO L895 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)) [2022-11-16 12:19:33,339 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2022-11-16 12:19:33,340 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2022-11-16 12:19:33,340 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2022-11-16 12:19:33,340 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2022-11-16 12:19:33,340 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2022-11-16 12:19:33,340 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2022-11-16 12:19:33,340 INFO L902 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2022-11-16 12:19:33,344 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:33,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:19:33,369 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,385 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,385 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,386 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:19:33 BoogieIcfgContainer [2022-11-16 12:19:33,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:19:33,395 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:19:33,395 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:19:33,395 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:19:33,396 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:05" (3/4) ... [2022-11-16 12:19:33,399 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 12:19:33,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2022-11-16 12:19:33,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2022-11-16 12:19:33,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-11-16 12:19:33,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-11-16 12:19:33,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-11-16 12:19:33,406 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-11-16 12:19:33,406 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2022-11-16 12:19:33,406 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2022-11-16 12:19:33,406 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-16 12:19:33,406 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-11-16 12:19:33,406 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-11-16 12:19:33,406 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2022-11-16 12:19:33,407 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-11-16 12:19:33,407 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2022-11-16 12:19:33,420 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2022-11-16 12:19:33,422 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-16 12:19:33,423 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-16 12:19:33,424 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-16 12:19:33,425 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 12:19:33,426 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 12:19:33,453 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)) [2022-11-16 12:19:33,453 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)) [2022-11-16 12:19:33,454 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) [2022-11-16 12:19:33,454 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) [2022-11-16 12:19:33,455 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) [2022-11-16 12:19:33,456 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)) [2022-11-16 12:19:33,457 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) [2022-11-16 12:19:33,457 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) [2022-11-16 12:19:33,457 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 [2022-11-16 12:19:33,458 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) [2022-11-16 12:19:33,459 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 [2022-11-16 12:19:33,459 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 [2022-11-16 12:19:33,460 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 [2022-11-16 12:19:33,460 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 [2022-11-16 12:19:33,461 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 [2022-11-16 12:19:33,461 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 [2022-11-16 12:19:33,461 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 [2022-11-16 12:19:33,462 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) [2022-11-16 12:19:33,589 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:19:33,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:19:33,594 INFO L158 Benchmark]: Toolchain (without parser) took 151641.91ms. Allocated memory was 130.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 87.2MB in the beginning and 464.0MB in the end (delta: -376.8MB). Peak memory consumption was 698.0MB. Max. memory is 16.1GB. [2022-11-16 12:19:33,595 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 130.0MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:19:33,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1537.31ms. Allocated memory is still 130.0MB. Free memory was 87.1MB in the beginning and 90.4MB in the end (delta: -3.3MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2022-11-16 12:19:33,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.33ms. Allocated memory is still 130.0MB. Free memory was 90.4MB in the beginning and 85.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:19:33,596 INFO L158 Benchmark]: Boogie Preprocessor took 125.70ms. Allocated memory is still 130.0MB. Free memory was 85.0MB in the beginning and 89.7MB in the end (delta: -4.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-11-16 12:19:33,598 INFO L158 Benchmark]: RCFGBuilder took 1532.80ms. Allocated memory was 130.0MB in the beginning and 201.3MB in the end (delta: 71.3MB). Free memory was 89.7MB in the beginning and 111.8MB in the end (delta: -22.1MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2022-11-16 12:19:33,598 INFO L158 Benchmark]: TraceAbstraction took 148117.82ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 110.7MB in the beginning and 484.0MB in the end (delta: -373.3MB). Peak memory consumption was 696.3MB. Max. memory is 16.1GB. [2022-11-16 12:19:33,600 INFO L158 Benchmark]: Witness Printer took 194.78ms. Allocated memory is still 1.2GB. Free memory was 484.0MB in the beginning and 464.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-16 12:19:33,601 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.30ms. Allocated memory is still 130.0MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1537.31ms. Allocated memory is still 130.0MB. Free memory was 87.1MB in the beginning and 90.4MB in the end (delta: -3.3MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.33ms. Allocated memory is still 130.0MB. Free memory was 90.4MB in the beginning and 85.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.70ms. Allocated memory is still 130.0MB. Free memory was 85.0MB in the beginning and 89.7MB in the end (delta: -4.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1532.80ms. Allocated memory was 130.0MB in the beginning and 201.3MB in the end (delta: 71.3MB). Free memory was 89.7MB in the beginning and 111.8MB in the end (delta: -22.1MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * TraceAbstraction took 148117.82ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 110.7MB in the beginning and 484.0MB in the end (delta: -373.3MB). Peak memory consumption was 696.3MB. Max. memory is 16.1GB. * Witness Printer took 194.78ms. Allocated memory is still 1.2GB. Free memory was 484.0MB in the beginning and 464.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.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: 148.0s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 93.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2915 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2813 mSDsluCounter, 19634 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 14816 mSDsCounter, 454 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2218 IncrementalHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 454 mSolverCounterUnsat, 4818 mSDtfsCounter, 2218 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3038 GetRequests, 2746 SyntacticMatches, 4 SemanticMatches, 288 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 6.3s 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: 2.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 1391 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 3259 PreInvPairs, 3473 NumberOfFragments, 1942 HoareAnnotationTreeSize, 3259 FomulaSimplifications, 1119277 FormulaSimplificationTreeSizeReduction, 63.6s HoareSimplificationTime, 81 FomulaSimplificationsInter, 763114 FormulaSimplificationTreeSizeReductionInter, 30.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 4605 NumberOfCodeBlocks, 4503 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4671 ConstructedInterpolants, 8 QuantifiedInterpolants, 9658 SizeOfPredicates, 85 NumberOfNonLiveVariables, 28355 ConjunctsInSsa, 324 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 [2022-11-16 12:19:33,641 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,641 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,642 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,642 WARN L421 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 [2022-11-16 12:19:33,645 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,646 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,646 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,646 WARN L421 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 [2022-11-16 12:19:33,648 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,648 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,648 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,648 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,649 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,649 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-16 12:19:33,650 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-16 12:19:33,650 WARN L421 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! [2022-11-16 12:19:33,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5813e867-6b17-4867-b8af-73442dcfaf4f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE