./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 8393723b 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_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/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_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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-8393723 [2022-11-18 20:33:49,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:33:49,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:33:49,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:33:49,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:33:49,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:33:49,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:33:49,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:33:49,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:33:49,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:33:49,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:33:49,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:33:49,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:33:49,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:33:49,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:33:49,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:33:49,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:33:49,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:33:49,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:33:49,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:33:49,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:33:49,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:33:49,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:33:49,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:33:49,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:33:49,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:33:49,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:33:49,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:33:49,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:33:49,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:33:49,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:33:49,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:33:49,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:33:49,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:33:49,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:33:49,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:33:49,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:33:49,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:33:49,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:33:49,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:33:49,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:33:49,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:33:49,265 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:33:49,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:33:49,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:33:49,266 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:33:49,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:33:49,267 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:33:49,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:33:49,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:33:49,268 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:33:49,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:33:49,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:33:49,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:33:49,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:33:49,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:33:49,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:33:49,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:33:49,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:33:49,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:33:49,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:33:49,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:33:49,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:33:49,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:33:49,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:33:49,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:33:49,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:33:49,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:33:49,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:33:49,273 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:33:49,273 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:33:49,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:33:49,273 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_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2022-11-18 20:33:49,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:33:49,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:33:49,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:33:49,576 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:33:49,577 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:33:49,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-18 20:33:49,646 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/data/005234b73/abb772f9130c4a6d8fa91bb2cf1bd758/FLAGec3d0940d [2022-11-18 20:33:50,366 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:33:50,366 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-18 20:33:50,406 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/data/005234b73/abb772f9130c4a6d8fa91bb2cf1bd758/FLAGec3d0940d [2022-11-18 20:33:50,515 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/data/005234b73/abb772f9130c4a6d8fa91bb2cf1bd758 [2022-11-18 20:33:50,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:33:50,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:33:50,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:33:50,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:33:50,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:33:50,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:33:50" (1/1) ... [2022-11-18 20:33:50,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:50, skipping insertion in model container [2022-11-18 20:33:50,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:33:50" (1/1) ... [2022-11-18 20:33:50,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:33:50,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:33:51,647 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-18 20:33:51,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:33:51,751 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:33:51,891 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-18 20:33:51,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:33:51,963 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:33:51,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51 WrapperNode [2022-11-18 20:33:51,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:33:51,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:33:51,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:33:51,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:33:51,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,077 INFO L138 Inliner]: procedures = 77, calls = 264, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 736 [2022-11-18 20:33:52,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:33:52,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:33:52,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:33:52,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:33:52,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,135 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:33:52,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:33:52,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:33:52,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:33:52,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (1/1) ... [2022-11-18 20:33:52,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:33:52,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:52,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:33:52,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:33:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2022-11-18 20:33:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2022-11-18 20:33:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:33:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-18 20:33:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-18 20:33:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:33:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-18 20:33:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-18 20:33:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2022-11-18 20:33:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2022-11-18 20:33:52,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-18 20:33:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-18 20:33:52,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:33:52,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:33:52,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-18 20:33:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-18 20:33:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:33:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:33:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-18 20:33:52,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-18 20:33:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:33:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-11-18 20:33:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-11-18 20:33:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:33:52,267 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-18 20:33:52,267 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-18 20:33:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:33:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-18 20:33:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-18 20:33:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-18 20:33:52,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-18 20:33:52,268 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-18 20:33:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-18 20:33:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-18 20:33:52,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-18 20:33:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:33:52,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:33:52,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:33:52,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:33:52,558 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:33:52,561 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:33:52,781 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-18 20:33:52,811 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-18 20:33:53,640 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-11-18 20:33:53,640 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-11-18 20:33:53,658 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:33:53,670 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:33:53,671 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-18 20:33:53,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:33:53 BoogieIcfgContainer [2022-11-18 20:33:53,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:33:53,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:33:53,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:33:53,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:33:53,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:33:50" (1/3) ... [2022-11-18 20:33:53,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be7c83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:33:53, skipping insertion in model container [2022-11-18 20:33:53,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:33:51" (2/3) ... [2022-11-18 20:33:53,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be7c83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:33:53, skipping insertion in model container [2022-11-18 20:33:53,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:33:53" (3/3) ... [2022-11-18 20:33:53,687 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-18 20:33:53,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:33:53,714 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:33:53,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:33:53,812 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;@384bb7c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:33:53,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:33:53,818 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-18 20:33:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:33:53,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:53,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:53,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 567277314, now seen corresponding path program 1 times [2022-11-18 20:33:53,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:53,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931180181] [2022-11-18 20:33:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:54,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:33:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:54,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931180181] [2022-11-18 20:33:54,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931180181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:33:54,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:33:54,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:33:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236573781] [2022-11-18 20:33:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:33:54,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:33:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:54,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:33:54,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:33:54,603 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-18 20:33:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:54,756 INFO L93 Difference]: Finished difference Result 447 states and 604 transitions. [2022-11-18 20:33:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:33:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-18 20:33:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:54,771 INFO L225 Difference]: With dead ends: 447 [2022-11-18 20:33:54,772 INFO L226 Difference]: Without dead ends: 287 [2022-11-18 20:33:54,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:33:54,780 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-18 20:33:54,781 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-18 20:33:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-18 20:33:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2022-11-18 20:33:54,859 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-18 20:33:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 350 transitions. [2022-11-18 20:33:54,866 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 350 transitions. Word has length 17 [2022-11-18 20:33:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:54,867 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 350 transitions. [2022-11-18 20:33:54,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:33:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 350 transitions. [2022-11-18 20:33:54,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:33:54,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:54,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:33:54,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:33:54,870 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash 405605840, now seen corresponding path program 1 times [2022-11-18 20:33:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:54,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146815085] [2022-11-18 20:33:54,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:54,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:55,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:33:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:55,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146815085] [2022-11-18 20:33:55,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146815085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:33:55,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:33:55,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:33:55,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012922295] [2022-11-18 20:33:55,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:33:55,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:33:55,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:33:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:33:55,045 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-18 20:33:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:55,125 INFO L93 Difference]: Finished difference Result 820 states and 1021 transitions. [2022-11-18 20:33:55,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:33:55,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-18 20:33:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:55,130 INFO L225 Difference]: With dead ends: 820 [2022-11-18 20:33:55,131 INFO L226 Difference]: Without dead ends: 542 [2022-11-18 20:33:55,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:33:55,135 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-18 20:33:55,136 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-18 20:33:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-11-18 20:33:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 535. [2022-11-18 20:33:55,199 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-18 20:33:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 662 transitions. [2022-11-18 20:33:55,206 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 662 transitions. Word has length 18 [2022-11-18 20:33:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:55,207 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 662 transitions. [2022-11-18 20:33:55,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:33:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 662 transitions. [2022-11-18 20:33:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:33:55,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:55,209 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-18 20:33:55,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:33:55,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:55,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1497198459, now seen corresponding path program 1 times [2022-11-18 20:33:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:55,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534021310] [2022-11-18 20:33:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:33:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:55,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:33:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:55,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:55,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:33:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:55,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:55,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534021310] [2022-11-18 20:33:55,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534021310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:33:55,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:33:55,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:33:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110189024] [2022-11-18 20:33:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:33:55,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:33:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:33:55,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:33:55,691 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-18 20:33:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:56,282 INFO L93 Difference]: Finished difference Result 1114 states and 1383 transitions. [2022-11-18 20:33:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:33:56,283 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-18 20:33:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:56,290 INFO L225 Difference]: With dead ends: 1114 [2022-11-18 20:33:56,290 INFO L226 Difference]: Without dead ends: 587 [2022-11-18 20:33:56,292 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-18 20:33:56,294 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 56 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 742 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.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:56,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 742 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:33:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-18 20:33:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 535. [2022-11-18 20:33:56,348 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-18 20:33:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 661 transitions. [2022-11-18 20:33:56,353 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 661 transitions. Word has length 51 [2022-11-18 20:33:56,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:56,354 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 661 transitions. [2022-11-18 20:33:56,354 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-18 20:33:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 661 transitions. [2022-11-18 20:33:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:33:56,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:56,356 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-18 20:33:56,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:33:56,357 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash 748380995, now seen corresponding path program 1 times [2022-11-18 20:33:56,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:56,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216093642] [2022-11-18 20:33:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:56,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:33:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:33:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:56,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:33:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:56,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:33:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:56,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216093642] [2022-11-18 20:33:56,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216093642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:33:56,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:33:56,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:33:56,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826266431] [2022-11-18 20:33:56,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:33:56,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:33:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:56,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:33:56,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:33:56,643 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-18 20:33:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:57,089 INFO L93 Difference]: Finished difference Result 1233 states and 1565 transitions. [2022-11-18 20:33:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:33:57,093 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-18 20:33:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:57,100 INFO L225 Difference]: With dead ends: 1233 [2022-11-18 20:33:57,101 INFO L226 Difference]: Without dead ends: 709 [2022-11-18 20:33:57,103 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-18 20:33:57,115 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 209 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:57,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 434 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:33:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2022-11-18 20:33:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 606. [2022-11-18 20:33:57,187 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-18 20:33:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 762 transitions. [2022-11-18 20:33:57,191 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 762 transitions. Word has length 51 [2022-11-18 20:33:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:57,192 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 762 transitions. [2022-11-18 20:33:57,192 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-18 20:33:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2022-11-18 20:33:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-18 20:33:57,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:57,195 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-18 20:33:57,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:33:57,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash -38243739, now seen corresponding path program 1 times [2022-11-18 20:33:57,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:57,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432974776] [2022-11-18 20:33:57,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:57,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:33:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:33:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:33:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:33:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:33:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:33:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:33:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:33:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,401 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-18 20:33:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:33:58,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432974776] [2022-11-18 20:33:58,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432974776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:33:58,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499888403] [2022-11-18 20:33:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:58,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:58,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:33:58,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:33:58,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:33:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:33:58,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:33:58,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:33:59,029 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-18 20:33:59,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:33:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499888403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:33:59,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:33:59,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-18 20:33:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067981129] [2022-11-18 20:33:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:33:59,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:33:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:33:59,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:33:59,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:33:59,037 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-18 20:33:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:33:59,136 INFO L93 Difference]: Finished difference Result 1189 states and 1524 transitions. [2022-11-18 20:33:59,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:33:59,137 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-18 20:33:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:33:59,144 INFO L225 Difference]: With dead ends: 1189 [2022-11-18 20:33:59,144 INFO L226 Difference]: Without dead ends: 596 [2022-11-18 20:33:59,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:33:59,148 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.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:33:59,149 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.0s Time] [2022-11-18 20:33:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-18 20:33:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2022-11-18 20:33:59,197 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-18 20:33:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2022-11-18 20:33:59,200 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2022-11-18 20:33:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:33:59,201 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2022-11-18 20:33:59,201 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-18 20:33:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2022-11-18 20:33:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-18 20:33:59,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:33:59,210 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-18 20:33:59,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:33:59,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:33:59,418 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:33:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:33:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539649, now seen corresponding path program 1 times [2022-11-18 20:33:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:33:59,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992790142] [2022-11-18 20:33:59,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:33:59,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:33:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:34:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 20:34:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,374 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-18 20:34:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:00,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992790142] [2022-11-18 20:34:00,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992790142] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:00,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369569001] [2022-11-18 20:34:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:00,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:00,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:00,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:00,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:34:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:00,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:34:00,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:01,051 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-18 20:34:01,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:01,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369569001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:01,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:01,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-11-18 20:34:01,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801296682] [2022-11-18 20:34:01,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:01,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:34:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:34:01,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:34:01,054 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-18 20:34:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:01,281 INFO L93 Difference]: Finished difference Result 906 states and 1163 transitions. [2022-11-18 20:34:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:34:01,282 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-18 20:34:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:01,286 INFO L225 Difference]: With dead ends: 906 [2022-11-18 20:34:01,286 INFO L226 Difference]: Without dead ends: 596 [2022-11-18 20:34:01,287 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-18 20:34:01,288 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-18 20:34:01,289 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-18 20:34:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-18 20:34:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2022-11-18 20:34:01,332 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-18 20:34:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2022-11-18 20:34:01,335 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 83 [2022-11-18 20:34:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:01,335 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2022-11-18 20:34:01,335 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-18 20:34:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2022-11-18 20:34:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-18 20:34:01,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:01,337 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-18 20:34:01,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:01,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 20:34:01,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:01,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash 23795875, now seen corresponding path program 1 times [2022-11-18 20:34:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:01,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92049468] [2022-11-18 20:34:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,400 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-18 20:34:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92049468] [2022-11-18 20:34:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92049468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060692180] [2022-11-18 20:34:02,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:02,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:02,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:02,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:02,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:34:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:02,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:34:02,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:03,127 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-18 20:34:03,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:03,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060692180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:03,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:03,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-11-18 20:34:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797235428] [2022-11-18 20:34:03,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:03,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:03,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:34:03,133 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-18 20:34:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:03,376 INFO L93 Difference]: Finished difference Result 661 states and 817 transitions. [2022-11-18 20:34:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:03,377 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-18 20:34:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:03,383 INFO L225 Difference]: With dead ends: 661 [2022-11-18 20:34:03,383 INFO L226 Difference]: Without dead ends: 658 [2022-11-18 20:34:03,384 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-18 20:34:03,385 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-18 20:34:03,386 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-18 20:34:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-18 20:34:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 636. [2022-11-18 20:34:03,463 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-18 20:34:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 791 transitions. [2022-11-18 20:34:03,467 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 791 transitions. Word has length 86 [2022-11-18 20:34:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:03,468 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 791 transitions. [2022-11-18 20:34:03,468 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-18 20:34:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 791 transitions. [2022-11-18 20:34:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-18 20:34:03,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:03,476 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-18 20:34:03,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 20:34:03,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:03,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash -170270410, now seen corresponding path program 1 times [2022-11-18 20:34:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:03,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323382875] [2022-11-18 20:34:03,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:03,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-18 20:34:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:34:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:03,995 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-18 20:34:03,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:03,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323382875] [2022-11-18 20:34:03,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323382875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:03,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:34:03,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:34:03,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42265804] [2022-11-18 20:34:03,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:03,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:34:03,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:34:03,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:34:04,000 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-18 20:34:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:04,486 INFO L93 Difference]: Finished difference Result 1320 states and 1645 transitions. [2022-11-18 20:34:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:34:04,487 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-18 20:34:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:04,493 INFO L225 Difference]: With dead ends: 1320 [2022-11-18 20:34:04,493 INFO L226 Difference]: Without dead ends: 685 [2022-11-18 20:34:04,495 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-18 20:34:04,496 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 166 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 566 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.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:04,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 566 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:34:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-11-18 20:34:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 596. [2022-11-18 20:34:04,593 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-18 20:34:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2022-11-18 20:34:04,596 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 96 [2022-11-18 20:34:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:04,597 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2022-11-18 20:34:04,597 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-18 20:34:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2022-11-18 20:34:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-18 20:34:04,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:04,599 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-18 20:34:04,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:34:04,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:04,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash 320363955, now seen corresponding path program 1 times [2022-11-18 20:34:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:04,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541018257] [2022-11-18 20:34:04,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:04,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,404 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-18 20:34:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:05,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541018257] [2022-11-18 20:34:05,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541018257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784406424] [2022-11-18 20:34:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:05,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:05,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:05,407 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:05,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:34:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:05,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:34:05,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:08,046 WARN L859 $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-18 20:34:08,222 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-18 20:34:08,226 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-18 20:34:08,248 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-18 20:34:08,252 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-18 20:34:08,359 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-18 20:34:08,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:08,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784406424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:08,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:08,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-11-18 20:34:08,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276649137] [2022-11-18 20:34:08,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:08,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:34:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:08,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:34:08,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=241, Unknown=1, NotChecked=30, Total=306 [2022-11-18 20:34:08,362 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-18 20:34:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:09,169 INFO L93 Difference]: Finished difference Result 702 states and 868 transitions. [2022-11-18 20:34:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:34:09,170 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-18 20:34:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:09,173 INFO L225 Difference]: With dead ends: 702 [2022-11-18 20:34:09,174 INFO L226 Difference]: Without dead ends: 661 [2022-11-18 20:34:09,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=42, Invalid=303, Unknown=1, NotChecked=34, Total=380 [2022-11-18 20:34:09,175 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:09,176 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.7s Time] [2022-11-18 20:34:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-11-18 20:34:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2022-11-18 20:34:09,255 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-18 20:34:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 785 transitions. [2022-11-18 20:34:09,259 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 785 transitions. Word has length 105 [2022-11-18 20:34:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:09,260 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 785 transitions. [2022-11-18 20:34:09,261 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-18 20:34:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 785 transitions. [2022-11-18 20:34:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-18 20:34:09,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:09,264 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-18 20:34:09,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:09,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-18 20:34:09,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1953167954, now seen corresponding path program 1 times [2022-11-18 20:34:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:09,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329141149] [2022-11-18 20:34:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,418 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-18 20:34:10,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:10,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329141149] [2022-11-18 20:34:10,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329141149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:10,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669191771] [2022-11-18 20:34:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:10,422 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:10,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:34:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:10,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:34:11,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:11,165 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-18 20:34:11,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:11,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669191771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:11,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:11,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-11-18 20:34:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781040918] [2022-11-18 20:34:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:11,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:34:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:11,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:34:11,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:34:11,167 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-18 20:34:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:11,425 INFO L93 Difference]: Finished difference Result 1390 states and 1777 transitions. [2022-11-18 20:34:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:34:11,426 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-18 20:34:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:11,430 INFO L225 Difference]: With dead ends: 1390 [2022-11-18 20:34:11,430 INFO L226 Difference]: Without dead ends: 810 [2022-11-18 20:34:11,435 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-18 20:34:11,436 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-18 20:34:11,437 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-18 20:34:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-11-18 20:34:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 628. [2022-11-18 20:34:11,501 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-18 20:34:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 781 transitions. [2022-11-18 20:34:11,504 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 781 transitions. Word has length 105 [2022-11-18 20:34:11,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:11,505 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 781 transitions. [2022-11-18 20:34:11,505 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-18 20:34:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 781 transitions. [2022-11-18 20:34:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-18 20:34:11,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:11,507 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-18 20:34:11,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:11,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:11,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:11,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1044819566, now seen corresponding path program 1 times [2022-11-18 20:34:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:11,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378755652] [2022-11-18 20:34:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 20:34:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:34:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:12,568 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-18 20:34:12,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:12,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378755652] [2022-11-18 20:34:12,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378755652] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:12,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757190221] [2022-11-18 20:34:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:12,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:12,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:12,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:12,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:34:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:13,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-18 20:34:13,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:13,478 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-18 20:34:13,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:13,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757190221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:13,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:13,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2022-11-18 20:34:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427156134] [2022-11-18 20:34:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:13,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:34:13,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:13,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:34:13,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:34:13,481 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-18 20:34:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:13,701 INFO L93 Difference]: Finished difference Result 1262 states and 1579 transitions. [2022-11-18 20:34:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:34:13,702 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-18 20:34:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:13,705 INFO L225 Difference]: With dead ends: 1262 [2022-11-18 20:34:13,706 INFO L226 Difference]: Without dead ends: 677 [2022-11-18 20:34:13,707 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-18 20:34:13,708 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-18 20:34:13,708 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-18 20:34:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-11-18 20:34:13,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 648. [2022-11-18 20:34:13,777 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-18 20:34:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2022-11-18 20:34:13,780 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2022-11-18 20:34:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:13,781 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2022-11-18 20:34:13,781 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-18 20:34:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2022-11-18 20:34:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-18 20:34:13,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:13,783 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-18 20:34:13,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:13,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:13,993 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1482829069, now seen corresponding path program 1 times [2022-11-18 20:34:13,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:13,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882108060] [2022-11-18 20:34:13,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 20:34:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:34:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:14,850 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-18 20:34:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:14,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882108060] [2022-11-18 20:34:14,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882108060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:14,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665435718] [2022-11-18 20:34:14,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:14,854 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:14,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:34:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:15,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:34:15,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:15,587 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-18 20:34:15,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:15,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665435718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:15,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:15,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-11-18 20:34:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913027590] [2022-11-18 20:34:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:15,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:34:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:34:15,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:34:15,589 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-18 20:34:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:15,847 INFO L93 Difference]: Finished difference Result 856 states and 1088 transitions. [2022-11-18 20:34:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:34:15,848 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-18 20:34:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:15,852 INFO L225 Difference]: With dead ends: 856 [2022-11-18 20:34:15,852 INFO L226 Difference]: Without dead ends: 821 [2022-11-18 20:34:15,853 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-18 20:34:15,854 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-18 20:34:15,854 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-18 20:34:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-18 20:34:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 648. [2022-11-18 20:34:15,927 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-18 20:34:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2022-11-18 20:34:15,930 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2022-11-18 20:34:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:15,931 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2022-11-18 20:34:15,931 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-18 20:34:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2022-11-18 20:34:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-18 20:34:15,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:15,933 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-18 20:34:15,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:16,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:34:16,141 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash 966922471, now seen corresponding path program 1 times [2022-11-18 20:34:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:16,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25742581] [2022-11-18 20:34:16,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:16,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:16,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:16,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 20:34:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 20:34:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:34:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,102 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-18 20:34:17,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:17,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25742581] [2022-11-18 20:34:17,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25742581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:17,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735004243] [2022-11-18 20:34:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:17,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:17,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:17,105 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:17,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:34:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:17,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 20:34:17,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:17,975 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-18 20:34:17,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:34:18,243 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-18 20:34:18,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735004243] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:18,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:34:18,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 17 [2022-11-18 20:34:18,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343695181] [2022-11-18 20:34:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:18,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:34:18,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:18,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:34:18,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:34:18,246 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-18 20:34:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:18,977 INFO L93 Difference]: Finished difference Result 1874 states and 2335 transitions. [2022-11-18 20:34:18,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:34:18,978 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-18 20:34:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:18,985 INFO L225 Difference]: With dead ends: 1874 [2022-11-18 20:34:18,985 INFO L226 Difference]: Without dead ends: 1250 [2022-11-18 20:34:18,987 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-18 20:34:18,988 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-18 20:34:18,989 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-18 20:34:18,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-11-18 20:34:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1210. [2022-11-18 20:34:19,120 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-18 20:34:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1504 transitions. [2022-11-18 20:34:19,127 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1504 transitions. Word has length 108 [2022-11-18 20:34:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:19,128 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 1504 transitions. [2022-11-18 20:34:19,128 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-18 20:34:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1504 transitions. [2022-11-18 20:34:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-18 20:34:19,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:19,130 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-18 20:34:19,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:19,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:34:19,340 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1819211607, now seen corresponding path program 1 times [2022-11-18 20:34:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:19,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972669499] [2022-11-18 20:34:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:19,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:20,400 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-18 20:34:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:20,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972669499] [2022-11-18 20:34:20,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972669499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:20,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333014259] [2022-11-18 20:34:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:20,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:20,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:20,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:20,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:34:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:21,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 1806 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 20:34:21,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:21,285 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-18 20:34:21,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:21,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333014259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:21,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:21,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-18 20:34:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106527047] [2022-11-18 20:34:21,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:21,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:21,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:21,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:21,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:34:21,288 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-18 20:34:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:21,424 INFO L93 Difference]: Finished difference Result 1861 states and 2314 transitions. [2022-11-18 20:34:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:21,424 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-18 20:34:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:21,428 INFO L225 Difference]: With dead ends: 1861 [2022-11-18 20:34:21,428 INFO L226 Difference]: Without dead ends: 697 [2022-11-18 20:34:21,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 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-18 20:34:21,432 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-18 20:34:21,432 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-18 20:34:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-11-18 20:34:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 667. [2022-11-18 20:34:21,520 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-18 20:34:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 823 transitions. [2022-11-18 20:34:21,523 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 823 transitions. Word has length 116 [2022-11-18 20:34:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:21,524 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 823 transitions. [2022-11-18 20:34:21,524 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-18 20:34:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 823 transitions. [2022-11-18 20:34:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-18 20:34:21,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:21,526 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-18 20:34:21,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:21,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:34:21,736 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2067358101, now seen corresponding path program 1 times [2022-11-18 20:34:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:21,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756760179] [2022-11-18 20:34:21,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:22,781 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-18 20:34:22,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:22,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756760179] [2022-11-18 20:34:22,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756760179] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:22,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69072119] [2022-11-18 20:34:22,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:22,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:22,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:22,800 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:22,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:34:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:23,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 1805 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:34:23,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:23,802 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-18 20:34:23,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:23,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69072119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:23,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:23,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-11-18 20:34:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385819666] [2022-11-18 20:34:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:23,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:23,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:23,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:34:23,805 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-18 20:34:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:24,072 INFO L93 Difference]: Finished difference Result 1213 states and 1506 transitions. [2022-11-18 20:34:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:24,073 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-18 20:34:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:24,078 INFO L225 Difference]: With dead ends: 1213 [2022-11-18 20:34:24,078 INFO L226 Difference]: Without dead ends: 1208 [2022-11-18 20:34:24,081 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-18 20:34:24,082 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-18 20:34:24,083 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-18 20:34:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-11-18 20:34:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1176. [2022-11-18 20:34:24,252 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-18 20:34:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1466 transitions. [2022-11-18 20:34:24,256 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1466 transitions. Word has length 116 [2022-11-18 20:34:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:24,257 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1466 transitions. [2022-11-18 20:34:24,257 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-18 20:34:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2022-11-18 20:34:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-18 20:34:24,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:24,259 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-18 20:34:24,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:24,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:34:24,469 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 541721343, now seen corresponding path program 1 times [2022-11-18 20:34:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:24,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142107833] [2022-11-18 20:34:24,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:34:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-18 20:34:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:25,360 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-18 20:34:25,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:25,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142107833] [2022-11-18 20:34:25,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142107833] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:25,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078118058] [2022-11-18 20:34:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:25,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:25,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:25,363 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:25,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:34:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:26,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 1861 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:34:26,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:26,290 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-18 20:34:26,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:26,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078118058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:26,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:26,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-18 20:34:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825966389] [2022-11-18 20:34:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:26,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:26,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:34:26,293 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-18 20:34:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:26,504 INFO L93 Difference]: Finished difference Result 1368 states and 1732 transitions. [2022-11-18 20:34:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:26,505 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-18 20:34:26,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:26,512 INFO L225 Difference]: With dead ends: 1368 [2022-11-18 20:34:26,512 INFO L226 Difference]: Without dead ends: 1358 [2022-11-18 20:34:26,513 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-18 20:34:26,514 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-18 20:34:26,514 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-18 20:34:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-11-18 20:34:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1182. [2022-11-18 20:34:26,685 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-18 20:34:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1472 transitions. [2022-11-18 20:34:26,695 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1472 transitions. Word has length 129 [2022-11-18 20:34:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:26,696 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1472 transitions. [2022-11-18 20:34:26,696 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-18 20:34:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1472 transitions. [2022-11-18 20:34:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-18 20:34:26,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:26,702 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-18 20:34:26,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:26,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:34:26,912 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash -554191626, now seen corresponding path program 1 times [2022-11-18 20:34:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:26,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087013003] [2022-11-18 20:34:26,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-18 20:34:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 20:34:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:27,967 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-18 20:34:27,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:27,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087013003] [2022-11-18 20:34:27,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087013003] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:27,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380474154] [2022-11-18 20:34:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:27,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:27,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:27,970 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:27,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:34:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:28,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 1873 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:34:28,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:28,988 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-18 20:34:28,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:28,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380474154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:28,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:28,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-18 20:34:28,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115482613] [2022-11-18 20:34:28,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:28,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:34:28,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:28,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:34:28,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:34:28,992 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-18 20:34:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:29,244 INFO L93 Difference]: Finished difference Result 2302 states and 2876 transitions. [2022-11-18 20:34:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:34:29,245 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-18 20:34:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:29,251 INFO L225 Difference]: With dead ends: 2302 [2022-11-18 20:34:29,251 INFO L226 Difference]: Without dead ends: 1110 [2022-11-18 20:34:29,254 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-18 20:34:29,255 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.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:29,255 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.0s Time] [2022-11-18 20:34:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-11-18 20:34:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2022-11-18 20:34:29,406 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-18 20:34:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1336 transitions. [2022-11-18 20:34:29,410 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1336 transitions. Word has length 133 [2022-11-18 20:34:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:29,410 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1336 transitions. [2022-11-18 20:34:29,410 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-18 20:34:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1336 transitions. [2022-11-18 20:34:29,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-18 20:34:29,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:29,413 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-18 20:34:29,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:29,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:29,623 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash 78838695, now seen corresponding path program 1 times [2022-11-18 20:34:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:29,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705453287] [2022-11-18 20:34:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:34:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:34:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:34:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:34:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:30,664 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-18 20:34:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:30,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705453287] [2022-11-18 20:34:30,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705453287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:30,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505429643] [2022-11-18 20:34:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:30,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:30,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:30,667 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:30,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:34:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:31,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 1905 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-18 20:34:31,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:31,824 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-18 20:34:31,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:31,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505429643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:31,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:31,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2022-11-18 20:34:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286854129] [2022-11-18 20:34:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:31,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:34:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:31,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:34:31,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-11-18 20:34:31,827 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-18 20:34:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:32,075 INFO L93 Difference]: Finished difference Result 2194 states and 2647 transitions. [2022-11-18 20:34:32,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:34:32,076 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-18 20:34:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:32,081 INFO L225 Difference]: With dead ends: 2194 [2022-11-18 20:34:32,082 INFO L226 Difference]: Without dead ends: 1139 [2022-11-18 20:34:32,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:34:32,085 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 29 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-18 20:34:32,086 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-18 20:34:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-11-18 20:34:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1110. [2022-11-18 20:34:32,218 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-18 20:34:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1331 transitions. [2022-11-18 20:34:32,223 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1331 transitions. Word has length 144 [2022-11-18 20:34:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:32,223 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1331 transitions. [2022-11-18 20:34:32,224 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-18 20:34:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1331 transitions. [2022-11-18 20:34:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-18 20:34:32,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:32,225 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-18 20:34:32,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:32,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:34:32,436 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash 92371496, now seen corresponding path program 2 times [2022-11-18 20:34:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:32,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876417660] [2022-11-18 20:34:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:32,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:34:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:34:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-18 20:34:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:34:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:33,403 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-18 20:34:33,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:33,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876417660] [2022-11-18 20:34:33,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876417660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:33,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734891281] [2022-11-18 20:34:33,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:34:33,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:33,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:33,405 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:33,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 20:34:34,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:34:34,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:34:34,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:34:34,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:34,457 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-18 20:34:34,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:34,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734891281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:34,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:34,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-11-18 20:34:34,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022751774] [2022-11-18 20:34:34,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:34:34,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:34:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:34:34,463 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-18 20:34:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:34,530 INFO L93 Difference]: Finished difference Result 1485 states and 1777 transitions. [2022-11-18 20:34:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:34:34,531 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-18 20:34:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:34,534 INFO L225 Difference]: With dead ends: 1485 [2022-11-18 20:34:34,534 INFO L226 Difference]: Without dead ends: 437 [2022-11-18 20:34:34,536 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-18 20:34:34,537 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-18 20:34:34,538 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-18 20:34:34,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-18 20:34:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 431. [2022-11-18 20:34:34,589 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-18 20:34:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 497 transitions. [2022-11-18 20:34:34,591 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 497 transitions. Word has length 144 [2022-11-18 20:34:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:34,592 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 497 transitions. [2022-11-18 20:34:34,592 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-18 20:34:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 497 transitions. [2022-11-18 20:34:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-18 20:34:34,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:34,593 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-18 20:34:34,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:34,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:34,803 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash 987398563, now seen corresponding path program 1 times [2022-11-18 20:34:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:34,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478495228] [2022-11-18 20:34:34,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:34:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:34:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 20:34:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:34:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:35,691 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-18 20:34:35,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:35,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478495228] [2022-11-18 20:34:35,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478495228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:35,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460257678] [2022-11-18 20:34:35,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:35,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:35,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:35,698 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:35,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 20:34:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:36,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 1914 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-18 20:34:36,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:36,927 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-18 20:34:36,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:36,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460257678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:36,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:36,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 16 [2022-11-18 20:34:36,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804269320] [2022-11-18 20:34:36,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:36,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:34:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:36,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:34:36,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:34:36,930 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-18 20:34:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:37,316 INFO L93 Difference]: Finished difference Result 881 states and 1021 transitions. [2022-11-18 20:34:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:34:37,317 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-18 20:34:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:37,320 INFO L225 Difference]: With dead ends: 881 [2022-11-18 20:34:37,320 INFO L226 Difference]: Without dead ends: 482 [2022-11-18 20:34:37,322 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-18 20:34:37,322 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 29 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:37,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1737 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:34:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-18 20:34:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 454. [2022-11-18 20:34:37,415 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-18 20:34:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 524 transitions. [2022-11-18 20:34:37,417 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 524 transitions. Word has length 146 [2022-11-18 20:34:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:37,418 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 524 transitions. [2022-11-18 20:34:37,418 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-18 20:34:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 524 transitions. [2022-11-18 20:34:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-18 20:34:37,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:37,420 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-18 20:34:37,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:37,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:37,630 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash 468106276, now seen corresponding path program 2 times [2022-11-18 20:34:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:37,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032857845] [2022-11-18 20:34:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:34:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:34:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 20:34:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:34:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:38,599 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-18 20:34:38,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032857845] [2022-11-18 20:34:38,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032857845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79941465] [2022-11-18 20:34:38,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:34:38,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:38,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:38,613 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:38,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 20:34:39,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:34:39,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:34:39,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:34:39,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:39,789 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-18 20:34:39,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:39,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79941465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:39,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:39,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-11-18 20:34:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981635814] [2022-11-18 20:34:39,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:34:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:34:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:34:39,793 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-18 20:34:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:39,859 INFO L93 Difference]: Finished difference Result 698 states and 809 transitions. [2022-11-18 20:34:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:34:39,860 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-18 20:34:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:39,862 INFO L225 Difference]: With dead ends: 698 [2022-11-18 20:34:39,862 INFO L226 Difference]: Without dead ends: 311 [2022-11-18 20:34:39,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-18 20:34:39,864 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-18 20:34:39,865 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-18 20:34:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-18 20:34:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-11-18 20:34:39,903 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-18 20:34:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 350 transitions. [2022-11-18 20:34:39,904 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 350 transitions. Word has length 146 [2022-11-18 20:34:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:39,905 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 350 transitions. [2022-11-18 20:34:39,905 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-18 20:34:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 350 transitions. [2022-11-18 20:34:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-18 20:34:39,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:39,906 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-18 20:34:39,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:40,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-18 20:34:40,118 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:40,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1408588503, now seen corresponding path program 1 times [2022-11-18 20:34:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:40,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841942923] [2022-11-18 20:34:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:40,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:34:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 20:34:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-18 20:34:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-18 20:34:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:40,937 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-18 20:34:40,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:40,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841942923] [2022-11-18 20:34:40,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841942923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:40,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636260918] [2022-11-18 20:34:40,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:40,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:40,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:40,942 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:40,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 20:34:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:42,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 1923 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 20:34:42,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:42,327 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-18 20:34:42,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:42,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636260918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:42,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:42,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-11-18 20:34:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093987723] [2022-11-18 20:34:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:42,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:34:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:34:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:34:42,330 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-18 20:34:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:42,717 INFO L93 Difference]: Finished difference Result 311 states and 351 transitions. [2022-11-18 20:34:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:34:42,720 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-18 20:34:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:42,722 INFO L225 Difference]: With dead ends: 311 [2022-11-18 20:34:42,722 INFO L226 Difference]: Without dead ends: 259 [2022-11-18 20:34:42,722 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-18 20:34:42,723 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.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:34:42,723 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.3s Time] [2022-11-18 20:34:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-18 20:34:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2022-11-18 20:34:42,752 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-18 20:34:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2022-11-18 20:34:42,753 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 148 [2022-11-18 20:34:42,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:42,754 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2022-11-18 20:34:42,754 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-18 20:34:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-11-18 20:34:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-18 20:34:42,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:34:42,756 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-18 20:34:42,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:34:42,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:42,966 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:34:42,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:34:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash 301053376, now seen corresponding path program 1 times [2022-11-18 20:34:42,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:34:42,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845446475] [2022-11-18 20:34:42,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:42,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:34:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 20:34:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 20:34:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:34:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 20:34:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 20:34:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 20:34:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:34:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:34:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:34:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:34:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:34:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 20:34:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-18 20:34:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-18 20:34:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-18 20:34:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:34:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:43,833 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-18 20:34:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:34:43,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845446475] [2022-11-18 20:34:43,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845446475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:34:43,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193920529] [2022-11-18 20:34:43,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:34:43,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:34:43,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:34:43,836 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:34:43,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 20:34:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:34:44,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 2075 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 20:34:44,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:34:44,976 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-18 20:34:44,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:34:44,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193920529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:34:44,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:34:44,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-11-18 20:34:44,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10099814] [2022-11-18 20:34:44,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:34:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:34:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:34:44,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:34:44,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:34:44,979 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-18 20:34:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:34:45,059 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2022-11-18 20:34:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:34:45,060 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-18 20:34:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:34:45,060 INFO L225 Difference]: With dead ends: 251 [2022-11-18 20:34:45,060 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:34:45,061 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-18 20:34:45,061 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-18 20:34:45,062 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-18 20:34:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:34:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:34:45,062 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-18 20:34:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:34:45,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2022-11-18 20:34:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:34:45,063 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:34:45,063 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-18 20:34:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:34:45,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:34:45,066 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:34:45,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-18 20:34:45,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-18 20:34:45,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:34:50,682 WARN L233 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 157 DAG size of output: 155 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 20:35:21,594 WARN L233 SmtUtils]: Spent 30.53s 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-18 20:35:26,997 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 160 DAG size of output: 158 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 20:35:55,014 WARN L233 SmtUtils]: Spent 27.56s 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-18 20:36:08,782 WARN L233 SmtUtils]: Spent 12.15s 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-18 20:36:22,073 WARN L233 SmtUtils]: Spent 12.10s 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-18 20:36:26,352 INFO L902 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2022-11-18 20:36:26,352 INFO L899 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2022-11-18 20:36:26,352 INFO L902 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2022-11-18 20:36:26,353 INFO L902 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2022-11-18 20:36:26,353 INFO L902 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2022-11-18 20:36:26,353 INFO L899 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2022-11-18 20:36:26,353 INFO L899 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2022-11-18 20:36:26,353 INFO L899 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2022-11-18 20:36:26,353 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2022-11-18 20:36:26,354 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-18 20:36:26,354 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-18 20:36:26,354 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2022-11-18 20:36:26,354 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2022-11-18 20:36:26,354 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-18 20:36:26,354 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2022-11-18 20:36:26,355 INFO L899 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2022-11-18 20:36:26,355 INFO L902 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2022-11-18 20:36:26,355 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2022-11-18 20:36:26,355 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2022-11-18 20:36:26,355 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2022-11-18 20:36:26,355 INFO L899 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2022-11-18 20:36:26,356 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2022-11-18 20:36:26,356 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-18 20:36:26,356 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2022-11-18 20:36:26,357 INFO L902 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2022-11-18 20:36:26,357 INFO L899 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2022-11-18 20:36:26,357 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-18 20:36:26,357 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2022-11-18 20:36:26,357 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-18 20:36:26,358 INFO L899 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2022-11-18 20:36:26,358 INFO L899 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2022-11-18 20:36:26,358 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-18 20:36:26,358 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-18 20:36:26,358 INFO L899 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2022-11-18 20:36:26,359 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2022-11-18 20:36:26,359 INFO L902 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2022-11-18 20:36:26,359 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2022-11-18 20:36:26,359 INFO L899 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2022-11-18 20:36:26,359 INFO L902 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2022-11-18 20:36:26,359 INFO L902 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2022-11-18 20:36:26,360 INFO L899 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2022-11-18 20:36:26,360 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-18 20:36:26,360 INFO L899 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2022-11-18 20:36:26,360 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2022-11-18 20:36:26,360 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2022-11-18 20:36:26,361 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-18 20:36:26,361 INFO L899 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2022-11-18 20:36:26,361 INFO L902 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2022-11-18 20:36:26,361 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2022-11-18 20:36:26,361 INFO L902 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2022-11-18 20:36:26,362 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-18 20:36:26,362 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2022-11-18 20:36:26,362 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2022-11-18 20:36:26,362 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2022-11-18 20:36:26,362 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-18 20:36:26,363 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-18 20:36:26,363 INFO L899 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2022-11-18 20:36:26,363 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-18 20:36:26,363 INFO L899 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2022-11-18 20:36:26,363 INFO L902 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2022-11-18 20:36:26,364 INFO L899 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2022-11-18 20:36:26,364 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-18 20:36:26,364 INFO L899 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2022-11-18 20:36:26,364 INFO L899 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2022-11-18 20:36:26,364 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-18 20:36:26,364 INFO L899 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2022-11-18 20:36:26,365 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-18 20:36:26,365 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-18 20:36:26,365 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-18 20:36:26,365 INFO L899 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2022-11-18 20:36:26,365 INFO L899 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2022-11-18 20:36:26,366 INFO L899 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2022-11-18 20:36:26,366 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:36:26,366 INFO L899 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2022-11-18 20:36:26,366 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-18 20:36:26,366 INFO L899 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2022-11-18 20:36:26,367 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-18 20:36:26,367 INFO L899 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2022-11-18 20:36:26,367 INFO L899 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2022-11-18 20:36:26,367 INFO L899 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2022-11-18 20:36:26,367 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-18 20:36:26,368 INFO L899 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2022-11-18 20:36:26,368 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-18 20:36:26,368 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-18 20:36:26,368 INFO L899 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2022-11-18 20:36:26,368 INFO L899 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2022-11-18 20:36:26,369 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-18 20:36:26,369 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-11-18 20:36:26,369 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2022-11-18 20:36:26,369 INFO L899 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2022-11-18 20:36:26,369 INFO L899 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2022-11-18 20:36:26,370 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2022-11-18 20:36:26,370 INFO L899 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2022-11-18 20:36:26,370 INFO L899 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2022-11-18 20:36:26,370 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-18 20:36:26,370 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-18 20:36:26,371 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-18 20:36:26,371 INFO L899 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2022-11-18 20:36:26,371 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-18 20:36:26,371 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-18 20:36:26,372 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-18 20:36:26,372 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-18 20:36:26,372 INFO L899 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2022-11-18 20:36:26,372 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-18 20:36:26,373 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-18 20:36:26,373 INFO L899 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2022-11-18 20:36:26,373 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-18 20:36:26,373 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:36:26,373 INFO L899 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2022-11-18 20:36:26,374 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-18 20:36:26,374 INFO L895 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2022-11-18 20:36:26,374 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-18 20:36:26,374 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-18 20:36:26,374 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-18 20:36:26,375 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-18 20:36:26,375 INFO L899 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2022-11-18 20:36:26,375 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-18 20:36:26,375 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-18 20:36:26,376 INFO L899 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2022-11-18 20:36:26,376 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-18 20:36:26,376 INFO L899 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2022-11-18 20:36:26,376 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-18 20:36:26,376 INFO L899 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2022-11-18 20:36:26,377 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-18 20:36:26,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:36:26,377 INFO L899 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2022-11-18 20:36:26,377 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-18 20:36:26,377 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-18 20:36:26,378 INFO L899 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2022-11-18 20:36:26,378 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-18 20:36:26,378 INFO L899 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2022-11-18 20:36:26,378 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-18 20:36:26,379 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-18 20:36:26,379 INFO L895 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-18 20:36:26,379 INFO L899 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2022-11-18 20:36:26,379 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2022-11-18 20:36:26,379 INFO L899 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2022-11-18 20:36:26,379 INFO L895 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-18 20:36:26,380 INFO L895 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2022-11-18 20:36:26,380 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-18 20:36:26,380 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-18 20:36:26,380 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-18 20:36:26,381 INFO L899 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2022-11-18 20:36:26,381 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:36:26,381 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-18 20:36:26,381 INFO L899 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2022-11-18 20:36:26,381 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-18 20:36:26,382 INFO L899 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2022-11-18 20:36:26,382 INFO L899 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2022-11-18 20:36:26,382 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-18 20:36:26,383 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-18 20:36:26,383 INFO L899 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2022-11-18 20:36:26,383 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-18 20:36:26,383 INFO L899 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2022-11-18 20:36:26,383 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-18 20:36:26,384 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-18 20:36:26,384 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-18 20:36:26,384 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2022-11-18 20:36:26,384 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2022-11-18 20:36:26,384 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2022-11-18 20:36:26,385 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2022-11-18 20:36:26,385 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2022-11-18 20:36:26,385 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2022-11-18 20:36:26,385 INFO L902 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2022-11-18 20:36:26,389 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-18 20:36:26,391 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:36:26,424 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,425 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,441 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,446 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,446 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,447 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,449 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,450 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,450 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,451 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,452 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:36:26 BoogieIcfgContainer [2022-11-18 20:36:26,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:36:26,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:36:26,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:36:26,474 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:36:26,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:33:53" (3/4) ... [2022-11-18 20:36:26,483 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:36:26,490 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2022-11-18 20:36:26,490 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2022-11-18 20:36:26,490 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-11-18 20:36:26,490 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-11-18 20:36:26,490 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-11-18 20:36:26,490 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-11-18 20:36:26,491 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2022-11-18 20:36:26,491 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2022-11-18 20:36:26,491 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-18 20:36:26,491 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-11-18 20:36:26,491 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-11-18 20:36:26,491 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2022-11-18 20:36:26,492 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-11-18 20:36:26,492 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2022-11-18 20:36:26,504 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2022-11-18 20:36:26,505 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-18 20:36:26,506 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-18 20:36:26,508 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-18 20:36:26,509 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:36:26,510 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:36:26,541 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-18 20:36:26,542 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-18 20:36:26,542 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-18 20:36:26,543 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-18 20:36:26,543 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-18 20:36:26,544 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-18 20:36:26,545 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-18 20:36:26,545 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-18 20:36:26,545 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-18 20:36:26,545 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-18 20:36:26,546 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-18 20:36:26,547 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-18 20:36:26,547 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-18 20:36:26,547 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-18 20:36:26,548 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-18 20:36:26,548 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-18 20:36:26,548 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-18 20:36:26,548 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-18 20:36:26,741 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:36:26,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:36:26,746 INFO L158 Benchmark]: Toolchain (without parser) took 156223.00ms. Allocated memory was 123.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 87.5MB in the beginning and 1.0GB in the end (delta: -926.4MB). Peak memory consumption was 111.2MB. Max. memory is 16.1GB. [2022-11-18 20:36:26,747 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 92.3MB. Free memory was 50.0MB in the beginning and 49.9MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:36:26,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1442.52ms. Allocated memory is still 123.7MB. Free memory was 87.2MB in the beginning and 88.0MB in the end (delta: -778.7kB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2022-11-18 20:36:26,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.74ms. Allocated memory is still 123.7MB. Free memory was 88.0MB in the beginning and 84.8MB in the end (delta: 3.2MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-11-18 20:36:26,750 INFO L158 Benchmark]: Boogie Preprocessor took 66.59ms. Allocated memory is still 123.7MB. Free memory was 84.8MB in the beginning and 79.4MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:36:26,751 INFO L158 Benchmark]: RCFGBuilder took 1528.85ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 79.0MB in the beginning and 115.1MB in the end (delta: -36.2MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2022-11-18 20:36:26,751 INFO L158 Benchmark]: TraceAbstraction took 152796.35ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 994.1MB). Free memory was 114.0MB in the beginning and 1.0GB in the end (delta: -918.8MB). Peak memory consumption was 702.2MB. Max. memory is 16.1GB. [2022-11-18 20:36:26,753 INFO L158 Benchmark]: Witness Printer took 267.66ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-18 20:36:26,754 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.34ms. Allocated memory is still 92.3MB. Free memory was 50.0MB in the beginning and 49.9MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1442.52ms. Allocated memory is still 123.7MB. Free memory was 87.2MB in the beginning and 88.0MB in the end (delta: -778.7kB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.74ms. Allocated memory is still 123.7MB. Free memory was 88.0MB in the beginning and 84.8MB in the end (delta: 3.2MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.59ms. Allocated memory is still 123.7MB. Free memory was 84.8MB in the beginning and 79.4MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1528.85ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 79.0MB in the beginning and 115.1MB in the end (delta: -36.2MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * TraceAbstraction took 152796.35ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 994.1MB). Free memory was 114.0MB in the beginning and 1.0GB in the end (delta: -918.8MB). Peak memory consumption was 702.2MB. Max. memory is 16.1GB. * Witness Printer took 267.66ms. Allocated memory is still 1.2GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 18.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: 152.6s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 101.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2919 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2816 mSDsluCounter, 19563 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 14756 mSDsCounter, 455 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2209 IncrementalHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 455 mSolverCounterUnsat, 4807 mSDtfsCounter, 2209 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, 5.9s 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: 1.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 1391 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 3259 PreInvPairs, 3473 NumberOfFragments, 1942 HoareAnnotationTreeSize, 3259 FomulaSimplifications, 1119277 FormulaSimplificationTreeSizeReduction, 70.7s HoareSimplificationTime, 81 FomulaSimplificationsInter, 763114 FormulaSimplificationTreeSizeReductionInter, 30.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 22.5s 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-18 20:36:26,784 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,784 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,789 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,790 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-18 20:36:26,793 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,793 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,793 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,794 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-18 20:36:26,800 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,800 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,801 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 20:36:26,802 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 20:36:26,802 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-18 20:36:26,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8a43985-dcbe-42fa-8788-e5aa7b5ae033/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE