./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:35:01,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:35:01,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:35:01,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:35:01,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:35:01,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:35:01,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:35:01,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:35:01,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:35:01,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:35:01,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:35:01,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:35:01,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:35:01,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:35:01,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:35:01,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:35:01,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:35:01,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:35:01,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:35:01,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:35:01,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:35:01,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:35:01,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:35:01,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:35:01,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:35:01,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:35:01,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:35:01,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:35:01,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:35:01,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:35:01,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:35:01,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:35:01,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:35:01,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:35:01,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:35:01,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:35:01,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:35:01,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:35:01,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:35:01,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:35:01,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:35:01,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-07 01:35:01,154 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:35:01,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:35:01,154 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:35:01,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:35:01,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:35:01,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:35:01,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:35:01,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:35:01,156 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:35:01,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:35:01,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:35:01,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:35:01,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:35:01,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:35:01,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:35:01,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:35:01,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:35:01,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:35:01,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:35:01,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:35:01,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:35:01,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:35:01,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:35:01,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:35:01,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:35:01,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:35:01,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:35:01,158 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:35:01,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:35:01,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:35:01,158 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:35:01,158 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_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 [2021-12-07 01:35:01,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:35:01,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:35:01,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:35:01,366 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:35:01,366 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:35:01,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-12-07 01:35:01,409 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/data/67d6aa11d/8d76253ca23a4f4f9481a5c9a99a3411/FLAG3d664b03b [2021-12-07 01:35:01,965 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:35:01,965 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-12-07 01:35:01,985 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/data/67d6aa11d/8d76253ca23a4f4f9481a5c9a99a3411/FLAG3d664b03b [2021-12-07 01:35:02,445 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/data/67d6aa11d/8d76253ca23a4f4f9481a5c9a99a3411 [2021-12-07 01:35:02,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:35:02,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:35:02,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:35:02,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:35:02,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:35:02,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:35:02" (1/1) ... [2021-12-07 01:35:02,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bdb1c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:02, skipping insertion in model container [2021-12-07 01:35:02,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:35:02" (1/1) ... [2021-12-07 01:35:02,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:35:02,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:35:03,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2021-12-07 01:35:03,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:35:03,064 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:35:03,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2021-12-07 01:35:03,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:35:03,235 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:35:03,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03 WrapperNode [2021-12-07 01:35:03,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:35:03,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:35:03,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:35:03,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:35:03,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,342 INFO L137 Inliner]: procedures = 81, calls = 494, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 1672 [2021-12-07 01:35:03,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:35:03,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:35:03,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:35:03,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:35:03,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:35:03,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:35:03,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:35:03,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:35:03,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (1/1) ... [2021-12-07 01:35:03,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:35:03,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:35:03,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:35:03,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:35:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:35:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure ir_init [2021-12-07 01:35:03,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_init [2021-12-07 01:35:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-07 01:35:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure ir_exit [2021-12-07 01:35:03,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_exit [2021-12-07 01:35:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-07 01:35:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-07 01:35:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-12-07 01:35:03,507 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-12-07 01:35:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-07 01:35:03,507 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-07 01:35:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-07 01:35:03,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-07 01:35:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-07 01:35:03,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-07 01:35:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 01:35:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-07 01:35:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-07 01:35:03,507 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-07 01:35:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-07 01:35:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2021-12-07 01:35:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2021-12-07 01:35:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-12-07 01:35:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-12-07 01:35:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-07 01:35:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-07 01:35:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure ir_xbof_change [2021-12-07 01:35:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_xbof_change [2021-12-07 01:35:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-12-07 01:35:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-12-07 01:35:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2021-12-07 01:35:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2021-12-07 01:35:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:35:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-07 01:35:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:35:03,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:35:03,722 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:35:03,723 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:35:03,727 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-07 01:35:03,767 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2021-12-07 01:35:03,767 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2021-12-07 01:35:03,840 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-12-07 01:35:03,849 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-07 01:35:03,852 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-07 01:35:03,864 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-07 01:35:04,502 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume !false; [2021-12-07 01:35:04,502 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##73: assume false; [2021-12-07 01:35:04,502 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2021-12-07 01:35:04,502 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2021-12-07 01:35:04,502 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2021-12-07 01:35:04,502 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2021-12-07 01:35:04,508 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:35:04,518 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:35:04,518 INFO L301 CfgBuilder]: Removed 23 assume(true) statements. [2021-12-07 01:35:04,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:35:04 BoogieIcfgContainer [2021-12-07 01:35:04,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:35:04,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:35:04,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:35:04,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:35:04,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:35:02" (1/3) ... [2021-12-07 01:35:04,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1421e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:35:04, skipping insertion in model container [2021-12-07 01:35:04,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:03" (2/3) ... [2021-12-07 01:35:04,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1421e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:35:04, skipping insertion in model container [2021-12-07 01:35:04,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:35:04" (3/3) ... [2021-12-07 01:35:04,528 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2021-12-07 01:35:04,534 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:35:04,534 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:35:04,580 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:35:04,585 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 01:35:04,585 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:35:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 272 states have internal predecessors, (395), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2021-12-07 01:35:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-07 01:35:04,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:04,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:35:04,615 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:04,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -248243768, now seen corresponding path program 1 times [2021-12-07 01:35:04,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252267397] [2021-12-07 01:35:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:04,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:05,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:35:05,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:05,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252267397] [2021-12-07 01:35:05,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252267397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:05,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:05,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:35:05,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219907009] [2021-12-07 01:35:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:05,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:35:05,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:35:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:35:05,133 INFO L87 Difference]: Start difference. First operand has 301 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 272 states have internal predecessors, (395), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:35:05,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:05,853 INFO L93 Difference]: Finished difference Result 845 states and 1261 transitions. [2021-12-07 01:35:05,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:35:05,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-12-07 01:35:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:05,866 INFO L225 Difference]: With dead ends: 845 [2021-12-07 01:35:05,866 INFO L226 Difference]: Without dead ends: 538 [2021-12-07 01:35:05,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:05,872 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 460 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:05,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 1291 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-07 01:35:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-12-07 01:35:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 528. [2021-12-07 01:35:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 469 states have (on average 1.3411513859275053) internal successors, (629), 478 states have internal predecessors, (629), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2021-12-07 01:35:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 702 transitions. [2021-12-07 01:35:05,935 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 702 transitions. Word has length 18 [2021-12-07 01:35:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:05,935 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 702 transitions. [2021-12-07 01:35:05,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:35:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 702 transitions. [2021-12-07 01:35:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-07 01:35:05,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:05,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:35:05,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:35:05,937 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash -835049782, now seen corresponding path program 1 times [2021-12-07 01:35:05,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:05,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401112058] [2021-12-07 01:35:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:05,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:06,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:35:06,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:06,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401112058] [2021-12-07 01:35:06,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401112058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:06,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:06,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:35:06,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984693468] [2021-12-07 01:35:06,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:06,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:35:06,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:06,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:35:06,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:35:06,068 INFO L87 Difference]: Start difference. First operand 528 states and 702 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:35:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:06,433 INFO L93 Difference]: Finished difference Result 1543 states and 2060 transitions. [2021-12-07 01:35:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:35:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-12-07 01:35:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:06,439 INFO L225 Difference]: With dead ends: 1543 [2021-12-07 01:35:06,439 INFO L226 Difference]: Without dead ends: 1033 [2021-12-07 01:35:06,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:35:06,442 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 470 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:06,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 928 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:35:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2021-12-07 01:35:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1020. [2021-12-07 01:35:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 913 states have (on average 1.343921139101862) internal successors, (1227), 926 states have internal predecessors, (1227), 69 states have call successors, (69), 38 states have call predecessors, (69), 37 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2021-12-07 01:35:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1362 transitions. [2021-12-07 01:35:06,489 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1362 transitions. Word has length 18 [2021-12-07 01:35:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:06,489 INFO L470 AbstractCegarLoop]: Abstraction has 1020 states and 1362 transitions. [2021-12-07 01:35:06,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:35:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1362 transitions. [2021-12-07 01:35:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:35:06,490 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:06,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:35:06,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:35:06,491 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:06,491 INFO L85 PathProgramCache]: Analyzing trace with hash -116851219, now seen corresponding path program 1 times [2021-12-07 01:35:06,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:06,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643686459] [2021-12-07 01:35:06,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:06,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:06,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:35:06,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:06,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643686459] [2021-12-07 01:35:06,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643686459] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:06,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:06,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:35:06,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159077872] [2021-12-07 01:35:06,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:06,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:35:06,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:35:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:35:06,604 INFO L87 Difference]: Start difference. First operand 1020 states and 1362 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:35:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:06,845 INFO L93 Difference]: Finished difference Result 1022 states and 1363 transitions. [2021-12-07 01:35:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:35:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2021-12-07 01:35:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:06,851 INFO L225 Difference]: With dead ends: 1022 [2021-12-07 01:35:06,851 INFO L226 Difference]: Without dead ends: 1001 [2021-12-07 01:35:06,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:35:06,852 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 421 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:06,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 595 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:35:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-12-07 01:35:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2021-12-07 01:35:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 902 states have (on average 1.3414634146341464) internal successors, (1210), 912 states have internal predecessors, (1210), 64 states have call successors, (64), 35 states have call predecessors, (64), 34 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2021-12-07 01:35:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1336 transitions. [2021-12-07 01:35:06,891 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1336 transitions. Word has length 19 [2021-12-07 01:35:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:06,892 INFO L470 AbstractCegarLoop]: Abstraction has 1001 states and 1336 transitions. [2021-12-07 01:35:06,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:35:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1336 transitions. [2021-12-07 01:35:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-07 01:35:06,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:06,897 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:06,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:35:06,897 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:06,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:06,898 INFO L85 PathProgramCache]: Analyzing trace with hash -470649452, now seen corresponding path program 1 times [2021-12-07 01:35:06,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:06,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624685348] [2021-12-07 01:35:06,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:06,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:07,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-07 01:35:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:07,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:07,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-07 01:35:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:07,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:07,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:07,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624685348] [2021-12-07 01:35:07,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624685348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:07,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:07,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:35:07,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307202985] [2021-12-07 01:35:07,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:07,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:35:07,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:07,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:35:07,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:35:07,078 INFO L87 Difference]: Start difference. First operand 1001 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:35:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:07,844 INFO L93 Difference]: Finished difference Result 2037 states and 2716 transitions. [2021-12-07 01:35:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:35:07,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2021-12-07 01:35:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:07,851 INFO L225 Difference]: With dead ends: 2037 [2021-12-07 01:35:07,851 INFO L226 Difference]: Without dead ends: 1057 [2021-12-07 01:35:07,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:35:07,854 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 573 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:07,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 1473 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-07 01:35:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-12-07 01:35:07,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1001. [2021-12-07 01:35:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 902 states have (on average 1.3392461197339247) internal successors, (1208), 912 states have internal predecessors, (1208), 64 states have call successors, (64), 35 states have call predecessors, (64), 34 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2021-12-07 01:35:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1334 transitions. [2021-12-07 01:35:07,901 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1334 transitions. Word has length 76 [2021-12-07 01:35:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:07,901 INFO L470 AbstractCegarLoop]: Abstraction has 1001 states and 1334 transitions. [2021-12-07 01:35:07,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:35:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1334 transitions. [2021-12-07 01:35:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-07 01:35:07,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:07,905 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:07,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 01:35:07,906 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash -26748778, now seen corresponding path program 1 times [2021-12-07 01:35:07,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:07,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638479220] [2021-12-07 01:35:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:07,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-07 01:35:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-07 01:35:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:08,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:08,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638479220] [2021-12-07 01:35:08,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638479220] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:08,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:08,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:35:08,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490421232] [2021-12-07 01:35:08,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:08,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:35:08,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:08,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:35:08,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:35:08,114 INFO L87 Difference]: Start difference. First operand 1001 states and 1334 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:35:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:08,799 INFO L93 Difference]: Finished difference Result 2033 states and 2706 transitions. [2021-12-07 01:35:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:35:08,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2021-12-07 01:35:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:08,804 INFO L225 Difference]: With dead ends: 2033 [2021-12-07 01:35:08,804 INFO L226 Difference]: Without dead ends: 1053 [2021-12-07 01:35:08,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:35:08,807 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 564 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:08,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 1473 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-07 01:35:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-12-07 01:35:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 997. [2021-12-07 01:35:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 900 states have (on average 1.3377777777777777) internal successors, (1204), 910 states have internal predecessors, (1204), 62 states have call successors, (62), 35 states have call predecessors, (62), 34 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2021-12-07 01:35:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1326 transitions. [2021-12-07 01:35:08,845 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1326 transitions. Word has length 76 [2021-12-07 01:35:08,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:08,845 INFO L470 AbstractCegarLoop]: Abstraction has 997 states and 1326 transitions. [2021-12-07 01:35:08,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:35:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1326 transitions. [2021-12-07 01:35:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-07 01:35:08,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:08,847 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:08,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 01:35:08,847 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash -481270382, now seen corresponding path program 1 times [2021-12-07 01:35:08,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:08,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880858406] [2021-12-07 01:35:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:08,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-07 01:35:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:08,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-07 01:35:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:09,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:09,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:09,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880858406] [2021-12-07 01:35:09,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880858406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:09,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:09,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:35:09,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669297070] [2021-12-07 01:35:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:09,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:35:09,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:09,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:35:09,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:35:09,008 INFO L87 Difference]: Start difference. First operand 997 states and 1326 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:35:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:09,516 INFO L93 Difference]: Finished difference Result 2989 states and 4048 transitions. [2021-12-07 01:35:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:35:09,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 76 [2021-12-07 01:35:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:09,529 INFO L225 Difference]: With dead ends: 2989 [2021-12-07 01:35:09,529 INFO L226 Difference]: Without dead ends: 2013 [2021-12-07 01:35:09,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:09,533 INFO L933 BasicCegarLoop]: 782 mSDtfsCounter, 654 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:09,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [666 Valid, 2821 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2021-12-07 01:35:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 973. [2021-12-07 01:35:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 885 states have (on average 1.335593220338983) internal successors, (1182), 891 states have internal predecessors, (1182), 55 states have call successors, (55), 33 states have call predecessors, (55), 32 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2021-12-07 01:35:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1290 transitions. [2021-12-07 01:35:09,595 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1290 transitions. Word has length 76 [2021-12-07 01:35:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:09,596 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 1290 transitions. [2021-12-07 01:35:09,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:35:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1290 transitions. [2021-12-07 01:35:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-07 01:35:09,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:09,598 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:09,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 01:35:09,598 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:09,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1149604904, now seen corresponding path program 1 times [2021-12-07 01:35:09,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:09,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435135601] [2021-12-07 01:35:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:09,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:09,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-07 01:35:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:09,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:09,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-07 01:35:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:09,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:35:09,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:09,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435135601] [2021-12-07 01:35:09,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435135601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:09,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:09,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:35:09,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384492839] [2021-12-07 01:35:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:09,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:35:09,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:35:09,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:35:09,822 INFO L87 Difference]: Start difference. First operand 973 states and 1290 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:35:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:10,365 INFO L93 Difference]: Finished difference Result 2228 states and 3006 transitions. [2021-12-07 01:35:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:35:10,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2021-12-07 01:35:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:10,373 INFO L225 Difference]: With dead ends: 2228 [2021-12-07 01:35:10,373 INFO L226 Difference]: Without dead ends: 1727 [2021-12-07 01:35:10,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:35:10,375 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 389 mSDsluCounter, 3495 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:10,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 4129 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2021-12-07 01:35:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1001. [2021-12-07 01:35:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 905 states have (on average 1.3281767955801105) internal successors, (1202), 911 states have internal predecessors, (1202), 55 states have call successors, (55), 33 states have call predecessors, (55), 40 states have return successors, (69), 60 states have call predecessors, (69), 53 states have call successors, (69) [2021-12-07 01:35:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1326 transitions. [2021-12-07 01:35:10,448 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1326 transitions. Word has length 73 [2021-12-07 01:35:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:10,448 INFO L470 AbstractCegarLoop]: Abstraction has 1001 states and 1326 transitions. [2021-12-07 01:35:10,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:35:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1326 transitions. [2021-12-07 01:35:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-07 01:35:10,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:10,451 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:10,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 01:35:10,451 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1404341449, now seen corresponding path program 1 times [2021-12-07 01:35:10,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:10,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405062109] [2021-12-07 01:35:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:10,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:10,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-07 01:35:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:10,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-07 01:35:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:35:10,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:10,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405062109] [2021-12-07 01:35:10,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405062109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:10,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:10,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 01:35:10,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738078812] [2021-12-07 01:35:10,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:10,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:35:10,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:10,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:35:10,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:35:10,668 INFO L87 Difference]: Start difference. First operand 1001 states and 1326 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:35:11,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:11,548 INFO L93 Difference]: Finished difference Result 2242 states and 3020 transitions. [2021-12-07 01:35:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 01:35:11,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2021-12-07 01:35:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:11,562 INFO L225 Difference]: With dead ends: 2242 [2021-12-07 01:35:11,562 INFO L226 Difference]: Without dead ends: 1727 [2021-12-07 01:35:11,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-12-07 01:35:11,564 INFO L933 BasicCegarLoop]: 739 mSDtfsCounter, 1004 mSDsluCounter, 5205 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 5944 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:11,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1015 Valid, 5944 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-07 01:35:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2021-12-07 01:35:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1001. [2021-12-07 01:35:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 905 states have (on average 1.3259668508287292) internal successors, (1200), 911 states have internal predecessors, (1200), 55 states have call successors, (55), 33 states have call predecessors, (55), 40 states have return successors, (69), 60 states have call predecessors, (69), 53 states have call successors, (69) [2021-12-07 01:35:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1324 transitions. [2021-12-07 01:35:11,608 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1324 transitions. Word has length 73 [2021-12-07 01:35:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:11,609 INFO L470 AbstractCegarLoop]: Abstraction has 1001 states and 1324 transitions. [2021-12-07 01:35:11,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-07 01:35:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1324 transitions. [2021-12-07 01:35:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-07 01:35:11,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:11,611 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:35:11,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 01:35:11,611 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:11,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash -264483951, now seen corresponding path program 1 times [2021-12-07 01:35:11,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:11,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899256724] [2021-12-07 01:35:11,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:11,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:11,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:11,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-07 01:35:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:11,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-07 01:35:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:11,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:11,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:11,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899256724] [2021-12-07 01:35:11,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899256724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:11,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:11,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:35:11,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185626151] [2021-12-07 01:35:11,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:11,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:35:11,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:11,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:35:11,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:35:11,771 INFO L87 Difference]: Start difference. First operand 1001 states and 1324 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:35:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:12,313 INFO L93 Difference]: Finished difference Result 1540 states and 2037 transitions. [2021-12-07 01:35:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:35:12,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2021-12-07 01:35:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:12,319 INFO L225 Difference]: With dead ends: 1540 [2021-12-07 01:35:12,320 INFO L226 Difference]: Without dead ends: 1537 [2021-12-07 01:35:12,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:35:12,320 INFO L933 BasicCegarLoop]: 697 mSDtfsCounter, 980 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 2319 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:12,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1006 Valid, 2319 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2021-12-07 01:35:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1499. [2021-12-07 01:35:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1356 states have (on average 1.3281710914454277) internal successors, (1801), 1366 states have internal predecessors, (1801), 83 states have call successors, (83), 48 states have call predecessors, (83), 59 states have return successors, (108), 91 states have call predecessors, (108), 81 states have call successors, (108) [2021-12-07 01:35:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1992 transitions. [2021-12-07 01:35:12,378 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1992 transitions. Word has length 76 [2021-12-07 01:35:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:12,378 INFO L470 AbstractCegarLoop]: Abstraction has 1499 states and 1992 transitions. [2021-12-07 01:35:12,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:35:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1992 transitions. [2021-12-07 01:35:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-07 01:35:12,380 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:12,380 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:12,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 01:35:12,381 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash 299119202, now seen corresponding path program 1 times [2021-12-07 01:35:12,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:12,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832456472] [2021-12-07 01:35:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:12,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-07 01:35:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-07 01:35:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-07 01:35:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-07 01:35:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:12,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:12,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832456472] [2021-12-07 01:35:12,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832456472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:12,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:12,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:35:12,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273556693] [2021-12-07 01:35:12,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:12,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:35:12,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:35:12,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:12,558 INFO L87 Difference]: Start difference. First operand 1499 states and 1992 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:13,133 INFO L93 Difference]: Finished difference Result 4547 states and 6038 transitions. [2021-12-07 01:35:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:35:13,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2021-12-07 01:35:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:13,146 INFO L225 Difference]: With dead ends: 4547 [2021-12-07 01:35:13,146 INFO L226 Difference]: Without dead ends: 3057 [2021-12-07 01:35:13,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:35:13,149 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 805 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:13,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [828 Valid, 2034 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2021-12-07 01:35:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2928. [2021-12-07 01:35:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2646 states have (on average 1.3344671201814058) internal successors, (3531), 2671 states have internal predecessors, (3531), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2021-12-07 01:35:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3912 transitions. [2021-12-07 01:35:13,279 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3912 transitions. Word has length 93 [2021-12-07 01:35:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:13,279 INFO L470 AbstractCegarLoop]: Abstraction has 2928 states and 3912 transitions. [2021-12-07 01:35:13,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3912 transitions. [2021-12-07 01:35:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-07 01:35:13,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:13,282 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:35:13,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 01:35:13,283 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:13,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1102442664, now seen corresponding path program 1 times [2021-12-07 01:35:13,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:13,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794022438] [2021-12-07 01:35:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:13,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:35:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-07 01:35:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-07 01:35:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-07 01:35:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:13,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:13,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794022438] [2021-12-07 01:35:13,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794022438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:13,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:13,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:35:13,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895029785] [2021-12-07 01:35:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:13,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:35:13,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:35:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:13,443 INFO L87 Difference]: Start difference. First operand 2928 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:14,096 INFO L93 Difference]: Finished difference Result 5994 states and 7973 transitions. [2021-12-07 01:35:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:35:14,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 94 [2021-12-07 01:35:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:14,108 INFO L225 Difference]: With dead ends: 5994 [2021-12-07 01:35:14,108 INFO L226 Difference]: Without dead ends: 3075 [2021-12-07 01:35:14,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:35:14,113 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 804 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:14,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [826 Valid, 2034 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:35:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2021-12-07 01:35:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2931. [2021-12-07 01:35:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2649 states have (on average 1.332955832389581) internal successors, (3531), 2674 states have internal predecessors, (3531), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2021-12-07 01:35:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 3912 transitions. [2021-12-07 01:35:14,238 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 3912 transitions. Word has length 94 [2021-12-07 01:35:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:14,238 INFO L470 AbstractCegarLoop]: Abstraction has 2931 states and 3912 transitions. [2021-12-07 01:35:14,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 3912 transitions. [2021-12-07 01:35:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-07 01:35:14,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:14,242 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:14,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 01:35:14,242 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:14,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1030544549, now seen corresponding path program 1 times [2021-12-07 01:35:14,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:14,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200551988] [2021-12-07 01:35:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:14,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-07 01:35:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-07 01:35:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-07 01:35:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-07 01:35:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:14,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:14,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200551988] [2021-12-07 01:35:14,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200551988] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:14,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:14,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:35:14,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071136431] [2021-12-07 01:35:14,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:14,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:35:14,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:14,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:35:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:14,411 INFO L87 Difference]: Start difference. First operand 2931 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:15,083 INFO L93 Difference]: Finished difference Result 5994 states and 7967 transitions. [2021-12-07 01:35:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:35:15,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 95 [2021-12-07 01:35:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:15,095 INFO L225 Difference]: With dead ends: 5994 [2021-12-07 01:35:15,096 INFO L226 Difference]: Without dead ends: 3072 [2021-12-07 01:35:15,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:35:15,100 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 798 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:15,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [820 Valid, 2034 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2021-12-07 01:35:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2925. [2021-12-07 01:35:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2643 states have (on average 1.3325766174801361) internal successors, (3522), 2668 states have internal predecessors, (3522), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2021-12-07 01:35:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3903 transitions. [2021-12-07 01:35:15,215 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3903 transitions. Word has length 95 [2021-12-07 01:35:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:15,215 INFO L470 AbstractCegarLoop]: Abstraction has 2925 states and 3903 transitions. [2021-12-07 01:35:15,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3903 transitions. [2021-12-07 01:35:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-07 01:35:15,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:15,217 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:15,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 01:35:15,218 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1961803849, now seen corresponding path program 1 times [2021-12-07 01:35:15,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:15,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908561091] [2021-12-07 01:35:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:15,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-07 01:35:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-07 01:35:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-07 01:35:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-07 01:35:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:15,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:15,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908561091] [2021-12-07 01:35:15,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908561091] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:15,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:15,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:35:15,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100742778] [2021-12-07 01:35:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:15,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:35:15,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:15,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:35:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:15,398 INFO L87 Difference]: Start difference. First operand 2925 states and 3903 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:16,016 INFO L93 Difference]: Finished difference Result 5988 states and 7955 transitions. [2021-12-07 01:35:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:35:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 96 [2021-12-07 01:35:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:16,035 INFO L225 Difference]: With dead ends: 5988 [2021-12-07 01:35:16,035 INFO L226 Difference]: Without dead ends: 3072 [2021-12-07 01:35:16,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:35:16,039 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 800 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:16,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [822 Valid, 2034 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2021-12-07 01:35:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2928. [2021-12-07 01:35:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2646 states have (on average 1.3310657596371882) internal successors, (3522), 2671 states have internal predecessors, (3522), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2021-12-07 01:35:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3903 transitions. [2021-12-07 01:35:16,152 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3903 transitions. Word has length 96 [2021-12-07 01:35:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:16,152 INFO L470 AbstractCegarLoop]: Abstraction has 2928 states and 3903 transitions. [2021-12-07 01:35:16,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3903 transitions. [2021-12-07 01:35:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-07 01:35:16,155 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:16,155 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:16,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 01:35:16,155 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:16,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash -400625242, now seen corresponding path program 1 times [2021-12-07 01:35:16,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:16,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463557445] [2021-12-07 01:35:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:16,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-07 01:35:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 01:35:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-07 01:35:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-07 01:35:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:16,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:16,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463557445] [2021-12-07 01:35:16,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463557445] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:16,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:16,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:35:16,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347145663] [2021-12-07 01:35:16,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:16,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:35:16,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:16,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:35:16,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:16,305 INFO L87 Difference]: Start difference. First operand 2928 states and 3903 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:16,913 INFO L93 Difference]: Finished difference Result 5988 states and 7949 transitions. [2021-12-07 01:35:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:35:16,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 97 [2021-12-07 01:35:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:16,925 INFO L225 Difference]: With dead ends: 5988 [2021-12-07 01:35:16,925 INFO L226 Difference]: Without dead ends: 3069 [2021-12-07 01:35:16,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:35:16,930 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 794 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:16,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [816 Valid, 2034 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2021-12-07 01:35:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2922. [2021-12-07 01:35:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2640 states have (on average 1.330681818181818) internal successors, (3513), 2665 states have internal predecessors, (3513), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2021-12-07 01:35:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3894 transitions. [2021-12-07 01:35:17,046 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3894 transitions. Word has length 97 [2021-12-07 01:35:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:17,047 INFO L470 AbstractCegarLoop]: Abstraction has 2922 states and 3894 transitions. [2021-12-07 01:35:17,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3894 transitions. [2021-12-07 01:35:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-07 01:35:17,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:17,050 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:17,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 01:35:17,050 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1958173396, now seen corresponding path program 1 times [2021-12-07 01:35:17,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:17,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773290495] [2021-12-07 01:35:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:17,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 01:35:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-07 01:35:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-07 01:35:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-07 01:35:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:17,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:17,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773290495] [2021-12-07 01:35:17,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773290495] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:17,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:17,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:35:17,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571429485] [2021-12-07 01:35:17,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:17,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:35:17,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:17,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:35:17,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:17,212 INFO L87 Difference]: Start difference. First operand 2922 states and 3894 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:17,790 INFO L93 Difference]: Finished difference Result 5970 states and 7925 transitions. [2021-12-07 01:35:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:35:17,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 98 [2021-12-07 01:35:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:17,799 INFO L225 Difference]: With dead ends: 5970 [2021-12-07 01:35:17,799 INFO L226 Difference]: Without dead ends: 3057 [2021-12-07 01:35:17,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:35:17,803 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 787 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:17,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [809 Valid, 2034 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2021-12-07 01:35:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2919. [2021-12-07 01:35:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2637 states have (on average 1.329920364050057) internal successors, (3507), 2662 states have internal predecessors, (3507), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2021-12-07 01:35:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3888 transitions. [2021-12-07 01:35:17,907 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3888 transitions. Word has length 98 [2021-12-07 01:35:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:17,907 INFO L470 AbstractCegarLoop]: Abstraction has 2919 states and 3888 transitions. [2021-12-07 01:35:17,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3888 transitions. [2021-12-07 01:35:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-07 01:35:17,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:17,909 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:17,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-07 01:35:17,910 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2000823641, now seen corresponding path program 1 times [2021-12-07 01:35:17,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:17,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185714175] [2021-12-07 01:35:17,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:17,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-07 01:35:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-07 01:35:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-07 01:35:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-07 01:35:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:18,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:18,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185714175] [2021-12-07 01:35:18,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185714175] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:18,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:18,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:35:18,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103137936] [2021-12-07 01:35:18,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:18,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:35:18,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:18,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:35:18,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:18,073 INFO L87 Difference]: Start difference. First operand 2919 states and 3888 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:18,749 INFO L93 Difference]: Finished difference Result 5964 states and 7913 transitions. [2021-12-07 01:35:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:35:18,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 99 [2021-12-07 01:35:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:18,757 INFO L225 Difference]: With dead ends: 5964 [2021-12-07 01:35:18,757 INFO L226 Difference]: Without dead ends: 3054 [2021-12-07 01:35:18,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:35:18,762 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 785 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:18,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [807 Valid, 2034 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:35:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2021-12-07 01:35:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2916. [2021-12-07 01:35:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2634 states have (on average 1.3291571753986333) internal successors, (3501), 2659 states have internal predecessors, (3501), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2021-12-07 01:35:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3882 transitions. [2021-12-07 01:35:18,885 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3882 transitions. Word has length 99 [2021-12-07 01:35:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:18,885 INFO L470 AbstractCegarLoop]: Abstraction has 2916 states and 3882 transitions. [2021-12-07 01:35:18,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3882 transitions. [2021-12-07 01:35:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-07 01:35:18,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:18,889 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:18,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-07 01:35:18,889 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1968688333, now seen corresponding path program 1 times [2021-12-07 01:35:18,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:18,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240914107] [2021-12-07 01:35:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:18,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-07 01:35:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-07 01:35:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-07 01:35:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-07 01:35:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:35:19,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:19,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240914107] [2021-12-07 01:35:19,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240914107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:19,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:19,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:35:19,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301724458] [2021-12-07 01:35:19,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:19,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:35:19,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:19,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:35:19,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:35:19,040 INFO L87 Difference]: Start difference. First operand 2916 states and 3882 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:19,684 INFO L93 Difference]: Finished difference Result 5958 states and 7901 transitions. [2021-12-07 01:35:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:35:19,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 100 [2021-12-07 01:35:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:19,689 INFO L225 Difference]: With dead ends: 5958 [2021-12-07 01:35:19,689 INFO L226 Difference]: Without dead ends: 3051 [2021-12-07 01:35:19,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:35:19,692 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 783 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:19,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 2034 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2021-12-07 01:35:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2913. [2021-12-07 01:35:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2913 states, 2631 states have (on average 1.3283922462941846) internal successors, (3495), 2656 states have internal predecessors, (3495), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2021-12-07 01:35:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 3876 transitions. [2021-12-07 01:35:19,807 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 3876 transitions. Word has length 100 [2021-12-07 01:35:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:19,807 INFO L470 AbstractCegarLoop]: Abstraction has 2913 states and 3876 transitions. [2021-12-07 01:35:19,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3876 transitions. [2021-12-07 01:35:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-07 01:35:19,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:19,809 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:19,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-07 01:35:19,810 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:19,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1466210216, now seen corresponding path program 1 times [2021-12-07 01:35:19,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:19,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023617959] [2021-12-07 01:35:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:19,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:35:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-07 01:35:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-07 01:35:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:19,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-07 01:35:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:20,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-07 01:35:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 01:35:20,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:20,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023617959] [2021-12-07 01:35:20,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023617959] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:35:20,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675424605] [2021-12-07 01:35:20,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:20,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:35:20,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:35:20,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:35:20,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:35:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:20,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 2108 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-07 01:35:20,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:35:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-07 01:35:20,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:35:20,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675424605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:20,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:35:20,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2021-12-07 01:35:20,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133721485] [2021-12-07 01:35:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:20,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:35:20,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:35:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:35:20,566 INFO L87 Difference]: Start difference. First operand 2913 states and 3876 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-07 01:35:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:20,746 INFO L93 Difference]: Finished difference Result 5809 states and 7733 transitions. [2021-12-07 01:35:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:35:20,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2021-12-07 01:35:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:20,755 INFO L225 Difference]: With dead ends: 5809 [2021-12-07 01:35:20,755 INFO L226 Difference]: Without dead ends: 2908 [2021-12-07 01:35:20,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:35:20,761 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 2 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:20,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1878 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:35:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2021-12-07 01:35:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2021-12-07 01:35:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2628 states have (on average 1.3280060882800608) internal successors, (3490), 2652 states have internal predecessors, (3490), 159 states have call successors, (159), 90 states have call predecessors, (159), 120 states have return successors, (220), 177 states have call predecessors, (220), 157 states have call successors, (220) [2021-12-07 01:35:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 3869 transitions. [2021-12-07 01:35:20,868 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 3869 transitions. Word has length 101 [2021-12-07 01:35:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:20,868 INFO L470 AbstractCegarLoop]: Abstraction has 2908 states and 3869 transitions. [2021-12-07 01:35:20,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-07 01:35:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3869 transitions. [2021-12-07 01:35:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-07 01:35:20,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:20,870 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:20,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:35:21,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-07 01:35:21,071 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:21,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1414387121, now seen corresponding path program 1 times [2021-12-07 01:35:21,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094209088] [2021-12-07 01:35:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:21,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-07 01:35:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-07 01:35:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:35:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-07 01:35:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:35:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 01:35:21,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:21,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094209088] [2021-12-07 01:35:21,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094209088] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:35:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278144764] [2021-12-07 01:35:21,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:21,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:35:21,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:35:21,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:35:21,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:35:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:21,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 2155 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-07 01:35:21,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:35:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 01:35:21,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:35:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 01:35:21,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278144764] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:35:21,989 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:35:21,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2021-12-07 01:35:21,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973166767] [2021-12-07 01:35:21,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:35:21,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-07 01:35:21,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:21,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-07 01:35:21,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2021-12-07 01:35:21,990 INFO L87 Difference]: Start difference. First operand 2908 states and 3869 transitions. Second operand has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-07 01:35:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:23,544 INFO L93 Difference]: Finished difference Result 6365 states and 8552 transitions. [2021-12-07 01:35:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-07 01:35:23,545 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) Word has length 103 [2021-12-07 01:35:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:23,550 INFO L225 Difference]: With dead ends: 6365 [2021-12-07 01:35:23,550 INFO L226 Difference]: Without dead ends: 3473 [2021-12-07 01:35:23,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2021-12-07 01:35:23,555 INFO L933 BasicCegarLoop]: 731 mSDtfsCounter, 2069 mSDsluCounter, 11696 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 12427 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:23,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2069 Valid, 12427 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-07 01:35:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2021-12-07 01:35:23,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 2033. [2021-12-07 01:35:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 1822 states have (on average 1.3117453347969266) internal successors, (2390), 1837 states have internal predecessors, (2390), 121 states have call successors, (121), 76 states have call predecessors, (121), 89 states have return successors, (153), 127 states have call predecessors, (153), 119 states have call successors, (153) [2021-12-07 01:35:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2664 transitions. [2021-12-07 01:35:23,643 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2664 transitions. Word has length 103 [2021-12-07 01:35:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:23,644 INFO L470 AbstractCegarLoop]: Abstraction has 2033 states and 2664 transitions. [2021-12-07 01:35:23,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2021-12-07 01:35:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2664 transitions. [2021-12-07 01:35:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-07 01:35:23,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:35:23,646 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-07 01:35:23,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 01:35:23,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:35:23,847 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:35:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:35:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1722415670, now seen corresponding path program 1 times [2021-12-07 01:35:23,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:35:23,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525717981] [2021-12-07 01:35:23,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:35:23,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:35:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:23,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:35:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-07 01:35:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:23,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-07 01:35:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-07 01:35:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:35:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:23,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:35:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:24,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-07 01:35:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-07 01:35:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:35:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:35:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-07 01:35:24,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:35:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525717981] [2021-12-07 01:35:24,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525717981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:35:24,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:35:24,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:35:24,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117114209] [2021-12-07 01:35:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:35:24,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:35:24,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:35:24,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:35:24,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:35:24,044 INFO L87 Difference]: Start difference. First operand 2033 states and 2664 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:35:24,558 INFO L93 Difference]: Finished difference Result 2165 states and 2792 transitions. [2021-12-07 01:35:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:35:24,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 105 [2021-12-07 01:35:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:35:24,559 INFO L225 Difference]: With dead ends: 2165 [2021-12-07 01:35:24,559 INFO L226 Difference]: Without dead ends: 0 [2021-12-07 01:35:24,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:35:24,561 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 594 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:35:24,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 1630 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:35:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-07 01:35:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-07 01:35:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:35:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-07 01:35:24,562 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2021-12-07 01:35:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:35:24,562 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-07 01:35:24,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:35:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-07 01:35:24,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-07 01:35:24,564 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 01:35:24,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-07 01:35:24,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-07 01:35:58,826 WARN L227 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:36:06,742 WARN L227 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:36:11,912 WARN L227 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:36:19,110 WARN L227 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:36:26,241 WARN L227 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:36:33,434 WARN L227 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:36:39,389 WARN L227 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:36:45,284 WARN L227 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:36:50,479 WARN L227 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:36:57,635 WARN L227 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:37:04,760 WARN L227 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:37:09,939 WARN L227 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:37:15,131 WARN L227 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:37:22,312 WARN L227 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:37:30,181 WARN L227 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:37:35,325 WARN L227 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 01:38:05,072 INFO L854 garLoopResultBuilder]: At program point L4090(lines 4089 4124) the Hoare annotation is: (or (and (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0) (or (<= 1 |ir_xbof_change_#in~xbof___0|) (<= (+ |ir_xbof_change_#in~xbof___0| 255) 0))) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0))) [2021-12-07 01:38:05,072 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2021-12-07 01:38:05,072 INFO L858 garLoopResultBuilder]: For program point ir_xbof_changeEXIT(lines 4065 4127) no Hoare annotation was computed. [2021-12-07 01:38:05,072 INFO L858 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2021-12-07 01:38:05,072 INFO L854 garLoopResultBuilder]: At program point L4095(lines 4094 4124) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) [2021-12-07 01:38:05,072 INFO L854 garLoopResultBuilder]: At program point L4087(lines 4086 4124) the Hoare annotation is: (or (and (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0) (or (<= (+ |ir_xbof_change_#in~xbof___0| 254) 0) (<= 2 |ir_xbof_change_#in~xbof___0|))) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0))) [2021-12-07 01:38:05,072 INFO L858 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2021-12-07 01:38:05,072 INFO L854 garLoopResultBuilder]: At program point L4075(lines 4071 4124) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (not (= ~ldv_urb_state~0 0)))) (and (or .cse0 .cse1 (<= 24 |ir_xbof_change_#in~xbof___0|) (<= (+ 228 |ir_xbof_change_#in~xbof___0|) 0) (not (= ~ir_add_bof~0 0))) (or .cse0 .cse1 (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)))) [2021-12-07 01:38:05,072 INFO L858 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2021-12-07 01:38:05,072 INFO L858 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2021-12-07 01:38:05,072 INFO L854 garLoopResultBuilder]: At program point L4084(lines 4083 4124) the Hoare annotation is: (or (and (or (<= (+ |ir_xbof_change_#in~xbof___0| 253) 0) (<= 3 |ir_xbof_change_#in~xbof___0|)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0))) [2021-12-07 01:38:05,072 INFO L858 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2021-12-07 01:38:05,073 INFO L858 garLoopResultBuilder]: For program point ir_xbof_changeFINAL(lines 4065 4127) no Hoare annotation was computed. [2021-12-07 01:38:05,073 INFO L858 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2021-12-07 01:38:05,073 INFO L854 garLoopResultBuilder]: At program point L4093(lines 4092 4124) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) [2021-12-07 01:38:05,073 INFO L854 garLoopResultBuilder]: At program point L4122(lines 4096 4123) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) [2021-12-07 01:38:05,073 INFO L861 garLoopResultBuilder]: At program point ir_xbof_changeENTRY(lines 4065 4127) the Hoare annotation is: true [2021-12-07 01:38:05,073 INFO L858 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2021-12-07 01:38:05,073 INFO L854 garLoopResultBuilder]: At program point L4081(lines 4077 4124) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (not (= ~ldv_urb_state~0 0)))) (and (or .cse0 .cse1 (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) (or .cse0 .cse1 (<= 5 |ir_xbof_change_#in~xbof___0|) (not (= ~ir_add_bof~0 0)) (<= (+ |ir_xbof_change_#in~xbof___0| 250) 0)))) [2021-12-07 01:38:05,073 INFO L858 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2021-12-07 01:38:05,073 INFO L854 garLoopResultBuilder]: At program point L4069(lines 4068 4124) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (and (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0) (or (<= 48 |ir_xbof_change_#in~xbof___0|) (<= (+ |ir_xbof_change_#in~xbof___0| 208) 0))) (not (= ~ldv_urb_state~0 0))) [2021-12-07 01:38:05,073 INFO L854 garLoopResultBuilder]: At program point L5147(lines 5146 5148) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2021-12-07 01:38:05,074 INFO L854 garLoopResultBuilder]: At program point ir_initENTRY(lines 4614 4647) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2021-12-07 01:38:05,074 INFO L858 garLoopResultBuilder]: For program point ir_initFINAL(lines 4614 4647) no Hoare annotation was computed. [2021-12-07 01:38:05,074 INFO L854 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (or (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (and (= |#memory_int| |old(#memory_int)|) (not (= |ir_init_~retval~0#1| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2021-12-07 01:38:05,074 INFO L858 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2021-12-07 01:38:05,074 INFO L858 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2021-12-07 01:38:05,074 INFO L858 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2021-12-07 01:38:05,074 INFO L854 garLoopResultBuilder]: At program point L4642(lines 4616 4646) the Hoare annotation is: (or (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (and (= |#memory_int| |old(#memory_int)|) (not (= |ir_init_~retval~0#1| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2021-12-07 01:38:05,074 INFO L858 garLoopResultBuilder]: For program point ir_initEXIT(lines 4614 4647) no Hoare annotation was computed. [2021-12-07 01:38:05,074 INFO L858 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2021-12-07 01:38:05,074 INFO L854 garLoopResultBuilder]: At program point L5136(lines 5135 5137) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2021-12-07 01:38:05,074 INFO L854 garLoopResultBuilder]: At program point L3695(lines 3689 3697) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (not (= (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1) 0))) [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 5154 5156) no Hoare annotation was computed. [2021-12-07 01:38:05,075 INFO L854 garLoopResultBuilder]: At program point kfreeENTRY(lines 5154 5156) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (= |old(#valid)| |#valid|))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 5154 5156) no Hoare annotation was computed. [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 5097 5099) no Hoare annotation was computed. [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point L5098(line 5098) no Hoare annotation was computed. [2021-12-07 01:38:05,075 INFO L854 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 5097 5099) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 5097 5099) no Hoare annotation was computed. [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point __kfifo_uint_must_check_helperEXIT(lines 3729 3734) no Hoare annotation was computed. [2021-12-07 01:38:05,075 INFO L861 garLoopResultBuilder]: At program point __kfifo_uint_must_check_helperENTRY(lines 3729 3734) the Hoare annotation is: true [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point __kfifo_uint_must_check_helperFINAL(lines 3729 3734) no Hoare annotation was computed. [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2021-12-07 01:38:05,075 INFO L861 garLoopResultBuilder]: At program point L5021(line 5021) the Hoare annotation is: true [2021-12-07 01:38:05,075 INFO L854 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |usb_free_urb_#in~urb.base| usb_free_urb_~urb.base))) [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 5013 5042) no Hoare annotation was computed. [2021-12-07 01:38:05,075 INFO L858 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2021-12-07 01:38:05,076 INFO L854 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 5013 5042) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2021-12-07 01:38:05,076 INFO L858 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2021-12-07 01:38:05,076 INFO L854 garLoopResultBuilder]: At program point L5037(lines 5013 5042) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|)) (and (let ((.cse1 (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* 18446744073709551616 .cse0) .cse1) (<= (+ .cse0 1) 0)))) (= ~ldv_urb_state~0 0) (= |usb_free_urb_#in~urb.base| usb_free_urb_~urb.base))) [2021-12-07 01:38:05,076 INFO L854 garLoopResultBuilder]: At program point L5029(line 5029) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2021-12-07 01:38:05,076 INFO L858 garLoopResultBuilder]: For program point L5029-1(lines 5026 5031) no Hoare annotation was computed. [2021-12-07 01:38:05,076 INFO L861 garLoopResultBuilder]: At program point __create_pipeENTRY(lines 3723 3728) the Hoare annotation is: true [2021-12-07 01:38:05,076 INFO L858 garLoopResultBuilder]: For program point __create_pipeFINAL(lines 3723 3728) no Hoare annotation was computed. [2021-12-07 01:38:05,076 INFO L858 garLoopResultBuilder]: For program point __create_pipeEXIT(lines 3723 3728) no Hoare annotation was computed. [2021-12-07 01:38:05,076 INFO L854 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 5072 5076) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2021-12-07 01:38:05,076 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5072 5076) no Hoare annotation was computed. [2021-12-07 01:38:05,076 INFO L858 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2021-12-07 01:38:05,076 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5072 5076) no Hoare annotation was computed. [2021-12-07 01:38:05,076 INFO L861 garLoopResultBuilder]: At program point L4655(line 4655) the Hoare annotation is: true [2021-12-07 01:38:05,076 INFO L858 garLoopResultBuilder]: For program point ir_exitFINAL(lines 4650 4659) no Hoare annotation was computed. [2021-12-07 01:38:05,076 INFO L861 garLoopResultBuilder]: At program point L5132(lines 5131 5133) the Hoare annotation is: true [2021-12-07 01:38:05,077 INFO L861 garLoopResultBuilder]: At program point ir_exitENTRY(lines 4650 4659) the Hoare annotation is: true [2021-12-07 01:38:05,077 INFO L858 garLoopResultBuilder]: For program point ir_exitEXIT(lines 4650 4659) no Hoare annotation was computed. [2021-12-07 01:38:05,077 INFO L858 garLoopResultBuilder]: For program point usb_serial_deregisterEXIT(lines 5138 5140) no Hoare annotation was computed. [2021-12-07 01:38:05,077 INFO L861 garLoopResultBuilder]: At program point usb_serial_deregisterENTRY(lines 5138 5140) the Hoare annotation is: true [2021-12-07 01:38:05,077 INFO L858 garLoopResultBuilder]: For program point usb_serial_deregisterFINAL(lines 5138 5140) no Hoare annotation was computed. [2021-12-07 01:38:05,077 INFO L861 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4918 4924) the Hoare annotation is: true [2021-12-07 01:38:05,077 INFO L858 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4918 4924) no Hoare annotation was computed. [2021-12-07 01:38:05,077 INFO L854 garLoopResultBuilder]: At program point kmallocENTRY(lines 3644 3653) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2021-12-07 01:38:05,077 INFO L858 garLoopResultBuilder]: For program point kmallocFINAL(lines 3644 3653) no Hoare annotation was computed. [2021-12-07 01:38:05,077 INFO L854 garLoopResultBuilder]: At program point L5078(line 5078) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2021-12-07 01:38:05,077 INFO L858 garLoopResultBuilder]: For program point kmallocEXIT(lines 3644 3653) no Hoare annotation was computed. [2021-12-07 01:38:05,077 INFO L858 garLoopResultBuilder]: For program point L5078-1(line 5078) no Hoare annotation was computed. [2021-12-07 01:38:05,077 INFO L861 garLoopResultBuilder]: At program point L5078-2(lines 5077 5079) the Hoare annotation is: true [2021-12-07 01:38:05,077 INFO L861 garLoopResultBuilder]: At program point L5056-1(lines 5044 5061) the Hoare annotation is: true [2021-12-07 01:38:05,077 INFO L858 garLoopResultBuilder]: For program point L5122-1(line 5122) no Hoare annotation was computed. [2021-12-07 01:38:05,078 INFO L858 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2021-12-07 01:38:05,078 INFO L854 garLoopResultBuilder]: At program point L5122-2(lines 5121 5123) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,078 INFO L854 garLoopResultBuilder]: At program point L5056(line 5056) the Hoare annotation is: false [2021-12-07 01:38:05,078 INFO L854 garLoopResultBuilder]: At program point L4891(lines 4823 4894) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,078 INFO L854 garLoopResultBuilder]: At program point L3636(lines 3625 3641) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,078 INFO L854 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-12-07 01:38:05,078 INFO L858 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2021-12-07 01:38:05,078 INFO L854 garLoopResultBuilder]: At program point L4264(lines 4234 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,078 INFO L858 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2021-12-07 01:38:05,078 INFO L854 garLoopResultBuilder]: At program point L4496(lines 4495 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,078 INFO L858 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2021-12-07 01:38:05,078 INFO L854 garLoopResultBuilder]: At program point L3968(lines 3818 3973) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,078 INFO L854 garLoopResultBuilder]: At program point L4992loopEntry(lines 4992 5005) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,078 INFO L858 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2021-12-07 01:38:05,078 INFO L858 garLoopResultBuilder]: For program point L4860(lines 4860 4863) no Hoare annotation was computed. [2021-12-07 01:38:05,079 INFO L858 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2021-12-07 01:38:05,079 INFO L854 garLoopResultBuilder]: At program point L4233(lines 4232 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,079 INFO L854 garLoopResultBuilder]: At program point L5125(lines 5124 5126) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,079 INFO L854 garLoopResultBuilder]: At program point L5092(lines 5091 5093) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,079 INFO L858 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2021-12-07 01:38:05,079 INFO L854 garLoopResultBuilder]: At program point L4993(line 4993) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,079 INFO L858 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2021-12-07 01:38:05,079 INFO L858 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2021-12-07 01:38:05,079 INFO L854 garLoopResultBuilder]: At program point L4333loopEntry(lines 4333 4348) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,079 INFO L854 garLoopResultBuilder]: At program point L4895(lines 4822 4896) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,079 INFO L858 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2021-12-07 01:38:05,079 INFO L854 garLoopResultBuilder]: At program point L4598(line 4598) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-12-07 01:38:05,079 INFO L854 garLoopResultBuilder]: At program point L4499(lines 4498 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,079 INFO L858 garLoopResultBuilder]: For program point L4334(lines 4333 4348) no Hoare annotation was computed. [2021-12-07 01:38:05,079 INFO L858 garLoopResultBuilder]: For program point L4268(line 4268) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L4995(line 4995) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L854 garLoopResultBuilder]: At program point L4037loopEntry(lines 4037 4047) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,080 INFO L854 garLoopResultBuilder]: At program point L3938(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L854 garLoopResultBuilder]: At program point L5095(lines 5094 5096) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L854 garLoopResultBuilder]: At program point L4303(lines 4293 4304) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,080 INFO L854 garLoopResultBuilder]: At program point L4270(lines 4128 4272) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,080 INFO L858 garLoopResultBuilder]: For program point L4369(line 4369) no Hoare annotation was computed. [2021-12-07 01:38:05,080 INFO L854 garLoopResultBuilder]: At program point L5129(lines 5128 5130) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,081 INFO L858 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2021-12-07 01:38:05,081 INFO L854 garLoopResultBuilder]: At program point L4502(lines 4501 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,081 INFO L854 garLoopResultBuilder]: At program point L4469loopEntry(lines 4469 4479) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,081 INFO L858 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2021-12-07 01:38:05,081 INFO L858 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2021-12-07 01:38:05,081 INFO L854 garLoopResultBuilder]: At program point L5064(lines 5063 5065) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,081 INFO L854 garLoopResultBuilder]: At program point L3908(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,081 INFO L858 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2021-12-07 01:38:05,081 INFO L854 garLoopResultBuilder]: At program point L4008(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,081 INFO L854 garLoopResultBuilder]: At program point L4900(lines 4811 4907) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,081 INFO L854 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-12-07 01:38:05,081 INFO L854 garLoopResultBuilder]: At program point L4603(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-12-07 01:38:05,081 INFO L858 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2021-12-07 01:38:05,081 INFO L858 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L858 garLoopResultBuilder]: For program point L4372-1(line 4372) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L854 garLoopResultBuilder]: At program point L4372(line 4372) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,082 INFO L858 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L858 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L858 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L854 garLoopResultBuilder]: At program point L4571(line 4571) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-12-07 01:38:05,082 INFO L858 garLoopResultBuilder]: For program point L4571-1(line 4571) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L854 garLoopResultBuilder]: At program point L4505(lines 4504 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,082 INFO L854 garLoopResultBuilder]: At program point L4208(lines 4150 4209) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,082 INFO L858 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L854 garLoopResultBuilder]: At program point L3878(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,082 INFO L858 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L854 garLoopResultBuilder]: At program point L5068(lines 5067 5069) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,082 INFO L858 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L858 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2021-12-07 01:38:05,082 INFO L854 garLoopResultBuilder]: At program point L4309(lines 4273 4311) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,083 INFO L854 garLoopResultBuilder]: At program point L4838(lines 4837 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,083 INFO L858 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2021-12-07 01:38:05,083 INFO L854 garLoopResultBuilder]: At program point L4607(lines 4458 4611) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-12-07 01:38:05,083 INFO L858 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2021-12-07 01:38:05,083 INFO L854 garLoopResultBuilder]: At program point L4508(lines 4507 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,083 INFO L854 garLoopResultBuilder]: At program point L4376(lines 4312 4378) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,083 INFO L858 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2021-12-07 01:38:05,083 INFO L854 garLoopResultBuilder]: At program point L4013loopEntry(lines 4013 4028) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,083 INFO L858 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2021-12-07 01:38:05,083 INFO L854 garLoopResultBuilder]: At program point L3848(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,083 INFO L854 garLoopResultBuilder]: At program point L4410(lines 4379 4412) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,083 INFO L854 garLoopResultBuilder]: At program point L4278loopEntry(lines 4278 4288) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,083 INFO L858 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2021-12-07 01:38:05,083 INFO L854 garLoopResultBuilder]: At program point L4212(lines 4211 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,083 INFO L858 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L861 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L854 garLoopResultBuilder]: At program point L4048(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L854 garLoopResultBuilder]: At program point L5105(lines 5104 5106) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L854 garLoopResultBuilder]: At program point L4841(lines 4840 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,084 INFO L854 garLoopResultBuilder]: At program point L3685(lines 3678 3687) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,084 INFO L854 garLoopResultBuilder]: At program point L4511(lines 4510 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2021-12-07 01:38:05,084 INFO L858 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2021-12-07 01:38:05,085 INFO L858 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2021-12-07 01:38:05,085 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-07 01:38:05,085 INFO L854 garLoopResultBuilder]: At program point L4215(lines 4214 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,085 INFO L858 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2021-12-07 01:38:05,085 INFO L854 garLoopResultBuilder]: At program point L4546(lines 4514 4547) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,085 INFO L854 garLoopResultBuilder]: At program point L4513(lines 4512 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,085 INFO L854 garLoopResultBuilder]: At program point L4480(lines 4468 4481) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,085 INFO L854 garLoopResultBuilder]: At program point L5108(lines 5107 5109) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,085 INFO L854 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse4 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|))) (or (and .cse0 (<= 1 ~ldv_urb_state~0) .cse1 (not .cse2) (<= ~ldv_urb_state~0 1) (not .cse3) .cse4) (and .cse0 .cse2 .cse1 .cse3 (= ~ldv_urb_state~0 0) .cse4))) [2021-12-07 01:38:05,085 INFO L858 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2021-12-07 01:38:05,085 INFO L854 garLoopResultBuilder]: At program point L4844(lines 4843 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,085 INFO L854 garLoopResultBuilder]: At program point L3622(lines 3619 3624) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,085 INFO L854 garLoopResultBuilder]: At program point L4349(lines 4332 4350) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,085 INFO L858 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2021-12-07 01:38:05,085 INFO L858 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2021-12-07 01:38:05,085 INFO L858 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2021-12-07 01:38:05,086 INFO L854 garLoopResultBuilder]: At program point L4151loopEntry(lines 4151 4207) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,086 INFO L858 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2021-12-07 01:38:05,086 INFO L854 garLoopResultBuilder]: At program point L3953(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,086 INFO L858 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2021-12-07 01:38:05,086 INFO L854 garLoopResultBuilder]: At program point L4218(lines 4217 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,086 INFO L854 garLoopResultBuilder]: At program point L5143(lines 5142 5144) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,086 INFO L858 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2021-12-07 01:38:05,086 INFO L858 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2021-12-07 01:38:05,086 INFO L854 garLoopResultBuilder]: At program point L3822loopEntry(lines 3822 3832) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,086 INFO L858 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2021-12-07 01:38:05,086 INFO L858 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2021-12-07 01:38:05,086 INFO L858 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2021-12-07 01:38:05,086 INFO L854 garLoopResultBuilder]: At program point L4847(lines 4846 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,086 INFO L858 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2021-12-07 01:38:05,086 INFO L854 garLoopResultBuilder]: At program point L4583(line 4583) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-12-07 01:38:05,086 INFO L858 garLoopResultBuilder]: For program point L4583-1(line 4583) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L854 garLoopResultBuilder]: At program point L5112(lines 5111 5113) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,087 INFO L854 garLoopResultBuilder]: At program point L3923(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,087 INFO L854 garLoopResultBuilder]: At program point L4815(line 4815) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0)) [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point L4815-1(line 4815) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point L3659-1(line 3659) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L854 garLoopResultBuilder]: At program point L3659(line 3659) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,087 INFO L854 garLoopResultBuilder]: At program point L4551(line 4551) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point L4551-1(line 4551) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2021-12-07 01:38:05,087 INFO L854 garLoopResultBuilder]: At program point L4221(lines 4220 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,087 INFO L858 garLoopResultBuilder]: For program point L5047(lines 5047 5052) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point L3991-1(line 3991) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L854 garLoopResultBuilder]: At program point L3991(line 3991) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,088 INFO L854 garLoopResultBuilder]: At program point L4850(lines 4849 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L854 garLoopResultBuilder]: At program point L3661(lines 3655 3663) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,088 INFO L854 garLoopResultBuilder]: At program point L4487(lines 4486 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L854 garLoopResultBuilder]: At program point L4289(lines 4277 4290) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L854 garLoopResultBuilder]: At program point L5082(lines 5081 5083) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,088 INFO L858 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2021-12-07 01:38:05,088 INFO L854 garLoopResultBuilder]: At program point L3893(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,089 INFO L854 garLoopResultBuilder]: At program point L3629loopEntry(lines 3629 3635) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,089 INFO L854 garLoopResultBuilder]: At program point L4224(lines 4223 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,089 INFO L854 garLoopResultBuilder]: At program point L5050(line 5050) the Hoare annotation is: false [2021-12-07 01:38:05,089 INFO L854 garLoopResultBuilder]: At program point L5116(lines 5115 5117) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L5050-1(lines 5046 5060) no Hoare annotation was computed. [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2021-12-07 01:38:05,089 INFO L854 garLoopResultBuilder]: At program point L4555(line 4555) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L4555-1(line 4555) no Hoare annotation was computed. [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2021-12-07 01:38:05,089 INFO L854 garLoopResultBuilder]: At program point L4357-2(lines 4357 4367) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L4060(line 4060) no Hoare annotation was computed. [2021-12-07 01:38:05,089 INFO L858 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2021-12-07 01:38:05,090 INFO L858 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2021-12-07 01:38:05,090 INFO L854 garLoopResultBuilder]: At program point L4490(lines 4489 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,090 INFO L858 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2021-12-07 01:38:05,090 INFO L858 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2021-12-07 01:38:05,090 INFO L854 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2021-12-07 01:38:05,090 INFO L854 garLoopResultBuilder]: At program point L5085(lines 5084 5086) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,090 INFO L858 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2021-12-07 01:38:05,090 INFO L854 garLoopResultBuilder]: At program point L3863(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,090 INFO L854 garLoopResultBuilder]: At program point L4227(lines 4226 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,090 INFO L858 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2021-12-07 01:38:05,090 INFO L858 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2021-12-07 01:38:05,090 INFO L854 garLoopResultBuilder]: At program point L5119(lines 5118 5120) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,090 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-07 01:38:05,090 INFO L854 garLoopResultBuilder]: At program point L4062(lines 3974 4064) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,090 INFO L858 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L854 garLoopResultBuilder]: At program point L4294-2(lines 4294 4302) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,091 INFO L854 garLoopResultBuilder]: At program point L3997loopEntry(lines 3997 4007) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L854 garLoopResultBuilder]: At program point L4493(lines 4492 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L854 garLoopResultBuilder]: At program point L3833(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L854 garLoopResultBuilder]: At program point L4230(lines 4229 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L854 garLoopResultBuilder]: At program point L5122(line 5122) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-12-07 01:38:05,091 INFO L858 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2021-12-07 01:38:05,091 INFO L861 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4909 4914) the Hoare annotation is: true [2021-12-07 01:38:05,092 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4909 4914) no Hoare annotation was computed. [2021-12-07 01:38:05,092 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4909 4914) no Hoare annotation was computed. [2021-12-07 01:38:05,092 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2021-12-07 01:38:05,094 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:38:05,095 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:38:05,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,112 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,126 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,129 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:38:05 BoogieIcfgContainer [2021-12-07 01:38:05,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:38:05,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:38:05,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:38:05,132 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:38:05,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:35:04" (3/4) ... [2021-12-07 01:38:05,135 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-07 01:38:05,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ir_xbof_change [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ir_init [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __kfifo_uint_must_check_helper [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ir_exit [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_serial_deregister [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2021-12-07 01:38:05,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2021-12-07 01:38:05,160 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 159 nodes and edges [2021-12-07 01:38:05,162 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2021-12-07 01:38:05,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-12-07 01:38:05,167 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-07 01:38:05,169 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-07 01:38:05,171 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-07 01:38:05,174 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-07 01:38:05,176 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-07 01:38:05,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(ldv_urb_state) <= 1) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state))) || (((18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0) && ldv_urb_state == 0) && urb == urb) [2021-12-07 01:38:05,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2021-12-07 01:38:05,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && urb == 0) && 0 == \result [2021-12-07 01:38:05,200 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(unknown-#memory_int-unknown)[debug][debug] == 0) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2021-12-07 01:38:05,201 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2021-12-07 01:38:05,202 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2021-12-07 01:38:05,202 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(unknown-#memory_int-unknown)[debug][debug] == 0) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) [2021-12-07 01:38:05,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || (\old(xbof___0) == xbof___0 && (48 <= \old(xbof___0) || \old(xbof___0) + 208 <= 0))) || !(ldv_urb_state == 0) [2021-12-07 01:38:05,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 [2021-12-07 01:38:05,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 24 <= \old(xbof___0)) || 228 + \old(xbof___0) <= 0) || !(ir_add_bof == 0)) && ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) [2021-12-07 01:38:05,203 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) && ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 5 <= \old(xbof___0)) || !(ir_add_bof == 0)) || \old(xbof___0) + 250 <= 0) [2021-12-07 01:38:05,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(xbof___0) + 253 <= 0 || 3 <= \old(xbof___0)) && \old(xbof___0) == xbof___0) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) [2021-12-07 01:38:05,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(xbof___0) == xbof___0 && (\old(xbof___0) + 254 <= 0 || 2 <= \old(xbof___0))) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) [2021-12-07 01:38:05,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(xbof___0) == xbof___0 && (1 <= \old(xbof___0) || \old(xbof___0) + 255 <= 0)) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) [2021-12-07 01:38:05,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 [2021-12-07 01:38:05,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 [2021-12-07 01:38:05,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && 0 == \result) || (((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && 0 == \result) [2021-12-07 01:38:05,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2021-12-07 01:38:05,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(ldv_urb_state) <= 1) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state))) || (ldv_urb_state == \old(ldv_urb_state) && urb == urb) [2021-12-07 01:38:05,206 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2021-12-07 01:38:05,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2021-12-07 01:38:05,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2021-12-07 01:38:05,377 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 01:38:05,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:38:05,377 INFO L158 Benchmark]: Toolchain (without parser) took 182928.85ms. Allocated memory was 113.2MB in the beginning and 673.2MB in the end (delta: 559.9MB). Free memory was 70.1MB in the beginning and 402.2MB in the end (delta: -332.1MB). Peak memory consumption was 227.3MB. Max. memory is 16.1GB. [2021-12-07 01:38:05,377 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:38:05,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.02ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 69.9MB in the beginning and 106.1MB in the end (delta: -36.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2021-12-07 01:38:05,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.50ms. Allocated memory is still 153.1MB. Free memory was 106.1MB in the beginning and 97.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 01:38:05,378 INFO L158 Benchmark]: Boogie Preprocessor took 99.18ms. Allocated memory is still 153.1MB. Free memory was 97.0MB in the beginning and 88.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 01:38:05,378 INFO L158 Benchmark]: RCFGBuilder took 1077.31ms. Allocated memory is still 153.1MB. Free memory was 88.6MB in the beginning and 76.7MB in the end (delta: 11.9MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2021-12-07 01:38:05,379 INFO L158 Benchmark]: TraceAbstraction took 180609.57ms. Allocated memory was 153.1MB in the beginning and 673.2MB in the end (delta: 520.1MB). Free memory was 76.7MB in the beginning and 552.2MB in the end (delta: -475.5MB). Peak memory consumption was 405.3MB. Max. memory is 16.1GB. [2021-12-07 01:38:05,379 INFO L158 Benchmark]: Witness Printer took 244.65ms. Allocated memory is still 673.2MB. Free memory was 552.2MB in the beginning and 402.2MB in the end (delta: 149.9MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. [2021-12-07 01:38:05,380 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 786.02ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 69.9MB in the beginning and 106.1MB in the end (delta: -36.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.50ms. Allocated memory is still 153.1MB. Free memory was 106.1MB in the beginning and 97.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.18ms. Allocated memory is still 153.1MB. Free memory was 97.0MB in the beginning and 88.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1077.31ms. Allocated memory is still 153.1MB. Free memory was 88.6MB in the beginning and 76.7MB in the end (delta: 11.9MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * TraceAbstraction took 180609.57ms. Allocated memory was 153.1MB in the beginning and 673.2MB in the end (delta: 520.1MB). Free memory was 76.7MB in the beginning and 552.2MB in the end (delta: -475.5MB). Peak memory consumption was 405.3MB. Max. memory is 16.1GB. * Witness Printer took 244.65ms. Allocated memory is still 673.2MB. Free memory was 552.2MB in the beginning and 402.2MB in the end (delta: 149.9MB). Peak memory consumption was 148.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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: 4912]: 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 14 procedures, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 180.5s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 160.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14863 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14536 mSDsluCounter, 53180 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44137 mSDsCounter, 2541 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9701 IncrementalHoareTripleChecker+Invalid, 12242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2541 mSolverCounterUnsat, 9043 mSDtfsCounter, 9701 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 880 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2931occurred in iteration=11, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 5230 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 137 LocationsWithAnnotation, 5155 PreInvPairs, 6439 NumberOfFragments, 1707 HoareAnnotationTreeSize, 5155 FomulaSimplifications, 1723616 FormulaSimplificationTreeSizeReduction, 151.1s HoareSimplificationTime, 137 FomulaSimplificationsInter, 46951826 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1790 NumberOfCodeBlocks, 1790 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1870 ConstructedInterpolants, 0 QuantifiedInterpolants, 4074 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4263 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 112/120 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: 4918]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: ((\old(xbof___0) == xbof___0 && (1 <= \old(xbof___0) || \old(xbof___0) + 255 <= 0)) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || (\old(xbof___0) == xbof___0 && (48 <= \old(xbof___0) || \old(xbof___0) + 208 <= 0))) || !(ldv_urb_state == 0) - InvariantResult [Line: 5131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4128]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4837]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5111]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5142]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3619]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4468]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4333]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4332]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5150]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4294]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4469]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5121]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5124]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4278]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4273]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4514]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4489]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4811]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5128]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4616]: Loop Invariant [2021-12-07 01:38:05,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((!(\old(unknown-#memory_int-unknown)[debug][debug] == 0) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4151]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4379]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5115]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3974]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5013]: Loop Invariant Derived loop invariant: ((!(\old(ldv_urb_state) <= 1) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state))) || (((18446744073709551616 * ((urb + urb) / 18446744073709551616) < urb + urb || (urb + urb) / 18446744073709551616 + 1 <= 0) && ldv_urb_state == 0) && urb == urb) - InvariantResult [Line: 4495]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4486]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: (((\old(xbof___0) + 253 <= 0 || 3 <= \old(xbof___0)) && \old(xbof___0) == xbof___0) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5104]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4849]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5044]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5118]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4293]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5067]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 24 <= \old(xbof___0)) || 228 + \old(xbof___0) <= 0) || !(ir_add_bof == 0)) && ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) - InvariantResult [Line: 4823]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4498]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3818]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5084]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4616]: Loop Invariant [2021-12-07 01:38:05,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((!(\old(unknown-#memory_int-unknown)[debug][debug] == 0) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 5017]: Loop Invariant Derived loop invariant: ((!(\old(ldv_urb_state) <= 1) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state))) || (ldv_urb_state == \old(ldv_urb_state) && urb == urb) - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) && ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 5 <= \old(xbof___0)) || !(ir_add_bof == 0)) || \old(xbof___0) + 250 <= 0) - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 - InvariantResult [Line: 5081]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3678]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4013]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4512]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4799]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 - InvariantResult [Line: 4234]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3629]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4501]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4214]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4510]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 - InvariantResult [Line: 5091]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4840]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5107]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: ((\old(xbof___0) == xbof___0 && (\old(xbof___0) + 254 <= 0 || 2 <= \old(xbof___0))) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) - InvariantResult [Line: 3625]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4277]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4843]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4492]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4987]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && 0 == \result) || (((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && 0 == \result) - InvariantResult [Line: 3655]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4037]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4312]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4458]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && urb == 0) && 0 == \result - InvariantResult [Line: 4507]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4822]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4992]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5063]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4504]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5135]: Loop Invariant [2021-12-07 01:38:05,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 3699]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 3689]: Loop Invariant [2021-12-07 01:38:05,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 3822]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5146]: Loop Invariant [2021-12-07 01:38:05,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,406 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:38:05,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:38:05,407 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || !(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 == 0) - InvariantResult [Line: 5094]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0 - InvariantResult [Line: 4846]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 RESULT: Ultimate proved your program to be correct! [2021-12-07 01:38:05,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6245d30-094f-4cd4-ae35-e443245aeb61/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE