./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:50:23,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:50:23,424 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:50:23,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:50:23,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:50:23,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:50:23,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:50:23,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:50:23,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:50:23,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:50:23,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:50:23,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:50:23,464 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:50:23,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:50:23,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:50:23,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:50:23,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:50:23,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:50:23,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:50:23,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:50:23,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:50:23,470 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:50:23,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:50:23,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:50:23,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:50:23,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:50:23,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:50:23,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:50:23,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:50:23,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:50:23,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:50:23,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:50:23,475 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:50:23,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:50:23,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:50:23,477 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:50:23,477 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/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_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2023-11-06 22:50:23,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:50:23,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:50:23,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:50:23,780 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:50:23,781 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:50:23,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2023-11-06 22:50:26,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:50:27,505 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:50:27,509 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2023-11-06 22:50:27,553 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/data/85726ab0a/e359e41487e4400cb57d900a42547bbb/FLAGccaad4cc6 [2023-11-06 22:50:27,571 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/data/85726ab0a/e359e41487e4400cb57d900a42547bbb [2023-11-06 22:50:27,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:50:27,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:50:27,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:50:27,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:50:27,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:50:27,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:27" (1/1) ... [2023-11-06 22:50:27,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203e715a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:27, skipping insertion in model container [2023-11-06 22:50:27,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:27" (1/1) ... [2023-11-06 22:50:27,688 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:50:28,449 WARN L240 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_080a8831-73f2-44d5-a16d-3a031e3f8906/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2023-11-06 22:50:28,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:50:28,522 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:50:28,787 WARN L240 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_080a8831-73f2-44d5-a16d-3a031e3f8906/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2023-11-06 22:50:28,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:50:28,871 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:50:28,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28 WrapperNode [2023-11-06 22:50:28,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:50:28,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:50:28,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:50:28,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:50:28,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:28,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,021 INFO L138 Inliner]: procedures = 77, calls = 266, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 821 [2023-11-06 22:50:29,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:50:29,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:50:29,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:50:29,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:50:29,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:50:29,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:50:29,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:50:29,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:50:29,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (1/1) ... [2023-11-06 22:50:29,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:50:29,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:29,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:50:29,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:50:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2023-11-06 22:50:29,271 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2023-11-06 22:50:29,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:50:29,272 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2023-11-06 22:50:29,273 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2023-11-06 22:50:29,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:50:29,273 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2023-11-06 22:50:29,274 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2023-11-06 22:50:29,274 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2023-11-06 22:50:29,274 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2023-11-06 22:50:29,274 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2023-11-06 22:50:29,274 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2023-11-06 22:50:29,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:50:29,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:50:29,275 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2023-11-06 22:50:29,275 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2023-11-06 22:50:29,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-06 22:50:29,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-06 22:50:29,278 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2023-11-06 22:50:29,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2023-11-06 22:50:29,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:50:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2023-11-06 22:50:29,279 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2023-11-06 22:50:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:50:29,279 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-06 22:50:29,279 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-06 22:50:29,280 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-06 22:50:29,280 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-06 22:50:29,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:50:29,281 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-06 22:50:29,281 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-06 22:50:29,281 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2023-11-06 22:50:29,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2023-11-06 22:50:29,283 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2023-11-06 22:50:29,283 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2023-11-06 22:50:29,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2023-11-06 22:50:29,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2023-11-06 22:50:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:50:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:50:29,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:50:29,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:50:29,673 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:50:29,676 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:50:29,882 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2023-11-06 22:50:29,936 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-06 22:50:31,104 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2023-11-06 22:50:31,104 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2023-11-06 22:50:31,129 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:50:31,147 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:50:31,147 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 22:50:31,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:31 BoogieIcfgContainer [2023-11-06 22:50:31,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:50:31,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:50:31,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:50:31,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:50:31,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:50:27" (1/3) ... [2023-11-06 22:50:31,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3526561b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:31, skipping insertion in model container [2023-11-06 22:50:31,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:28" (2/3) ... [2023-11-06 22:50:31,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3526561b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:31, skipping insertion in model container [2023-11-06 22:50:31,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:31" (3/3) ... [2023-11-06 22:50:31,165 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2023-11-06 22:50:31,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:50:31,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:50:31,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:50:31,274 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b380ba5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:50:31,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:50:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 196 states, 150 states have (on average 1.3866666666666667) internal successors, (208), 158 states have internal predecessors, (208), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:50:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 22:50:31,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:31,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:31,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:31,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1164261712, now seen corresponding path program 1 times [2023-11-06 22:50:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:31,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866155304] [2023-11-06 22:50:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:33,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:33,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866155304] [2023-11-06 22:50:33,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866155304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:33,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:50:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344530188] [2023-11-06 22:50:33,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:33,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:50:33,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:33,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:50:33,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:50:33,097 INFO L87 Difference]: Start difference. First operand has 196 states, 150 states have (on average 1.3866666666666667) internal successors, (208), 158 states have internal predecessors, (208), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:50:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:33,233 INFO L93 Difference]: Finished difference Result 536 states and 754 transitions. [2023-11-06 22:50:33,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:50:33,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-06 22:50:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:33,262 INFO L225 Difference]: With dead ends: 536 [2023-11-06 22:50:33,263 INFO L226 Difference]: Without dead ends: 348 [2023-11-06 22:50:33,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:50:33,279 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 230 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:33,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 515 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:50:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-06 22:50:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2023-11-06 22:50:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 269 states have (on average 1.2676579925650557) internal successors, (341), 273 states have internal predecessors, (341), 50 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-06 22:50:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 437 transitions. [2023-11-06 22:50:33,431 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 437 transitions. Word has length 17 [2023-11-06 22:50:33,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:33,436 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 437 transitions. [2023-11-06 22:50:33,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:50:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 437 transitions. [2023-11-06 22:50:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:50:33,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:33,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:33,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:50:33,440 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:33,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1732498155, now seen corresponding path program 1 times [2023-11-06 22:50:33,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:33,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198389077] [2023-11-06 22:50:33,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:34,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198389077] [2023-11-06 22:50:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198389077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:34,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:50:34,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559367496] [2023-11-06 22:50:34,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:34,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:50:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:50:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:50:34,519 INFO L87 Difference]: Start difference. First operand 344 states and 437 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:50:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:34,597 INFO L93 Difference]: Finished difference Result 993 states and 1272 transitions. [2023-11-06 22:50:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:50:34,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-11-06 22:50:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:34,604 INFO L225 Difference]: With dead ends: 993 [2023-11-06 22:50:34,605 INFO L226 Difference]: Without dead ends: 659 [2023-11-06 22:50:34,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:50:34,608 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 220 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:34,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 527 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:50:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2023-11-06 22:50:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 652. [2023-11-06 22:50:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 513 states have (on average 1.2651072124756335) internal successors, (649), 516 states have internal predecessors, (649), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2023-11-06 22:50:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 831 transitions. [2023-11-06 22:50:34,669 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 831 transitions. Word has length 18 [2023-11-06 22:50:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:34,670 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 831 transitions. [2023-11-06 22:50:34,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:50:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 831 transitions. [2023-11-06 22:50:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 22:50:34,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:34,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:34,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:50:34,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:34,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash -477461344, now seen corresponding path program 1 times [2023-11-06 22:50:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:34,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108734506] [2023-11-06 22:50:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:35,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:50:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:50:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:35,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:50:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:35,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:50:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:35,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108734506] [2023-11-06 22:50:35,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108734506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:35,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:35,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:50:35,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568917022] [2023-11-06 22:50:35,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:35,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:50:35,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:35,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:50:35,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:50:35,915 INFO L87 Difference]: Start difference. First operand 652 states and 831 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:50:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:36,419 INFO L93 Difference]: Finished difference Result 1343 states and 1716 transitions. [2023-11-06 22:50:36,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:50:36,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-11-06 22:50:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:36,427 INFO L225 Difference]: With dead ends: 1343 [2023-11-06 22:50:36,427 INFO L226 Difference]: Without dead ends: 704 [2023-11-06 22:50:36,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:50:36,431 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 64 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:36,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 984 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:50:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2023-11-06 22:50:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 652. [2023-11-06 22:50:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 513 states have (on average 1.263157894736842) internal successors, (648), 516 states have internal predecessors, (648), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2023-11-06 22:50:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 830 transitions. [2023-11-06 22:50:36,481 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 830 transitions. Word has length 51 [2023-11-06 22:50:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:36,482 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 830 transitions. [2023-11-06 22:50:36,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 22:50:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 830 transitions. [2023-11-06 22:50:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 22:50:36,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:36,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:36,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:50:36,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:36,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1431322569, now seen corresponding path program 1 times [2023-11-06 22:50:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454759407] [2023-11-06 22:50:36,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:37,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:50:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:50:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:37,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:50:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-06 22:50:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:37,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:50:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:37,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:37,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454759407] [2023-11-06 22:50:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454759407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:37,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:37,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:50:37,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582590728] [2023-11-06 22:50:37,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:37,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:50:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:37,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:50:37,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:50:37,272 INFO L87 Difference]: Start difference. First operand 652 states and 830 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:50:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:37,571 INFO L93 Difference]: Finished difference Result 1374 states and 1769 transitions. [2023-11-06 22:50:37,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:50:37,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2023-11-06 22:50:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:37,577 INFO L225 Difference]: With dead ends: 1374 [2023-11-06 22:50:37,578 INFO L226 Difference]: Without dead ends: 739 [2023-11-06 22:50:37,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:50:37,581 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 157 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:37,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 371 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:50:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2023-11-06 22:50:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 687. [2023-11-06 22:50:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 548 states have (on average 1.2664233576642336) internal successors, (694), 551 states have internal predecessors, (694), 93 states have call successors, (93), 46 states have call predecessors, (93), 45 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2023-11-06 22:50:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 876 transitions. [2023-11-06 22:50:37,630 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 876 transitions. Word has length 56 [2023-11-06 22:50:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:37,631 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 876 transitions. [2023-11-06 22:50:37,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:50:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 876 transitions. [2023-11-06 22:50:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-06 22:50:37,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:37,634 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:37,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:50:37,635 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:37,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2126656103, now seen corresponding path program 1 times [2023-11-06 22:50:37,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:37,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507441626] [2023-11-06 22:50:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:37,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:50:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:50:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:50:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:50:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:50:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:50:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507441626] [2023-11-06 22:50:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507441626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:39,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763156157] [2023-11-06 22:50:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:39,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:39,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:39,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:39,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:50:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:40,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:50:40,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:50:40,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:50:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763156157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:50:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-11-06 22:50:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974874090] [2023-11-06 22:50:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:40,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:50:40,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:40,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:50:40,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:50:40,522 INFO L87 Difference]: Start difference. First operand 687 states and 876 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:50:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:40,614 INFO L93 Difference]: Finished difference Result 1275 states and 1642 transitions. [2023-11-06 22:50:40,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:50:40,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2023-11-06 22:50:40,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:40,619 INFO L225 Difference]: With dead ends: 1275 [2023-11-06 22:50:40,619 INFO L226 Difference]: Without dead ends: 606 [2023-11-06 22:50:40,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:50:40,623 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 42 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:40,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 813 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:50:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-11-06 22:50:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 463. [2023-11-06 22:50:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 366 states have (on average 1.2459016393442623) internal successors, (456), 369 states have internal predecessors, (456), 63 states have call successors, (63), 34 states have call predecessors, (63), 33 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2023-11-06 22:50:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 578 transitions. [2023-11-06 22:50:40,669 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 578 transitions. Word has length 95 [2023-11-06 22:50:40,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:40,669 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 578 transitions. [2023-11-06 22:50:40,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:50:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 578 transitions. [2023-11-06 22:50:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-06 22:50:40,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:40,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:40,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:50:40,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:40,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:40,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1026043877, now seen corresponding path program 1 times [2023-11-06 22:50:40,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:40,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940494432] [2023-11-06 22:50:40,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:40,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:50:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:50:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:50:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:50:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:50:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:50:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:50:42,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940494432] [2023-11-06 22:50:42,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940494432] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:42,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439966069] [2023-11-06 22:50:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:42,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:42,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:42,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:42,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:50:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:43,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:50:43,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:50:43,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:50:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439966069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:43,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:50:43,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2023-11-06 22:50:43,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014275756] [2023-11-06 22:50:43,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:43,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:50:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:50:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:50:43,669 INFO L87 Difference]: Start difference. First operand 463 states and 578 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:50:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:43,829 INFO L93 Difference]: Finished difference Result 1051 states and 1373 transitions. [2023-11-06 22:50:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:50:43,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2023-11-06 22:50:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:43,835 INFO L225 Difference]: With dead ends: 1051 [2023-11-06 22:50:43,835 INFO L226 Difference]: Without dead ends: 703 [2023-11-06 22:50:43,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:50:43,838 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 112 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:43,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 2158 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:50:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2023-11-06 22:50:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 488. [2023-11-06 22:50:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 385 states have (on average 1.2415584415584415) internal successors, (478), 388 states have internal predecessors, (478), 63 states have call successors, (63), 34 states have call predecessors, (63), 39 states have return successors, (73), 65 states have call predecessors, (73), 59 states have call successors, (73) [2023-11-06 22:50:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 614 transitions. [2023-11-06 22:50:43,901 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 614 transitions. Word has length 92 [2023-11-06 22:50:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:43,904 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 614 transitions. [2023-11-06 22:50:43,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:50:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 614 transitions. [2023-11-06 22:50:43,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-06 22:50:43,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:43,910 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:43,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:44,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:44,118 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:44,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1014727750, now seen corresponding path program 1 times [2023-11-06 22:50:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:44,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640287528] [2023-11-06 22:50:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:50:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:50:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:50:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:50:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:50:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:50:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 22:50:45,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640287528] [2023-11-06 22:50:45,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640287528] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893244955] [2023-11-06 22:50:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:45,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:45,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:45,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:45,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:50:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:46,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:50:46,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:50:46,989 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:50:46,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893244955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:46,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:50:46,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2023-11-06 22:50:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381210060] [2023-11-06 22:50:46,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:46,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:50:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:46,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:50:46,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:50:46,992 INFO L87 Difference]: Start difference. First operand 488 states and 614 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:50:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:47,137 INFO L93 Difference]: Finished difference Result 1173 states and 1522 transitions. [2023-11-06 22:50:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:50:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2023-11-06 22:50:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:47,143 INFO L225 Difference]: With dead ends: 1173 [2023-11-06 22:50:47,144 INFO L226 Difference]: Without dead ends: 703 [2023-11-06 22:50:47,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:50:47,147 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 111 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:47,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 2909 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:50:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2023-11-06 22:50:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 482. [2023-11-06 22:50:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 379 states have (on average 1.2321899736147757) internal successors, (467), 383 states have internal predecessors, (467), 63 states have call successors, (63), 34 states have call predecessors, (63), 39 states have return successors, (73), 64 states have call predecessors, (73), 59 states have call successors, (73) [2023-11-06 22:50:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 603 transitions. [2023-11-06 22:50:47,192 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 603 transitions. Word has length 92 [2023-11-06 22:50:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:47,193 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 603 transitions. [2023-11-06 22:50:47,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:50:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 603 transitions. [2023-11-06 22:50:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-06 22:50:47,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:47,195 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:47,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:47,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:50:47,403 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:47,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2106271579, now seen corresponding path program 1 times [2023-11-06 22:50:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156566423] [2023-11-06 22:50:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:50:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:50:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:50:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:50:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:50:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:50:48,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156566423] [2023-11-06 22:50:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156566423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127805355] [2023-11-06 22:50:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:48,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:48,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:48,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:48,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:50:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:49,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:50:49,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:50:50,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:50:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127805355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:50,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:50:50,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-06 22:50:50,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123652539] [2023-11-06 22:50:50,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:50,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:50:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:50:50,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:50:50,077 INFO L87 Difference]: Start difference. First operand 482 states and 603 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:50:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:50,251 INFO L93 Difference]: Finished difference Result 719 states and 892 transitions. [2023-11-06 22:50:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:50:50,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2023-11-06 22:50:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:50,258 INFO L225 Difference]: With dead ends: 719 [2023-11-06 22:50:50,258 INFO L226 Difference]: Without dead ends: 716 [2023-11-06 22:50:50,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:50:50,261 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 274 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:50,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 431 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:50:50,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2023-11-06 22:50:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 690. [2023-11-06 22:50:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 539 states have (on average 1.228200371057514) internal successors, (662), 543 states have internal predecessors, (662), 89 states have call successors, (89), 52 states have call predecessors, (89), 61 states have return successors, (111), 94 states have call predecessors, (111), 85 states have call successors, (111) [2023-11-06 22:50:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 862 transitions. [2023-11-06 22:50:50,393 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 862 transitions. Word has length 95 [2023-11-06 22:50:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:50,394 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 862 transitions. [2023-11-06 22:50:50,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:50:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 862 transitions. [2023-11-06 22:50:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-06 22:50:50,396 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:50,396 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:50,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:50,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:50,605 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:50,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1560635542, now seen corresponding path program 1 times [2023-11-06 22:50:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980814677] [2023-11-06 22:50:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:50:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:50:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:50:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:50:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:50:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:50:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:50:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:50:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:50:51,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:51,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980814677] [2023-11-06 22:50:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980814677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:51,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:51,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:50:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323268730] [2023-11-06 22:50:51,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:51,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:50:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:50:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:50:51,580 INFO L87 Difference]: Start difference. First operand 690 states and 862 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:50:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:52,063 INFO L93 Difference]: Finished difference Result 1407 states and 1758 transitions. [2023-11-06 22:50:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:50:52,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 105 [2023-11-06 22:50:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:52,070 INFO L225 Difference]: With dead ends: 1407 [2023-11-06 22:50:52,071 INFO L226 Difference]: Without dead ends: 723 [2023-11-06 22:50:52,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:50:52,079 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 152 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:52,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 855 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:50:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2023-11-06 22:50:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 652. [2023-11-06 22:50:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 511 states have (on average 1.2211350293542074) internal successors, (624), 515 states have internal predecessors, (624), 87 states have call successors, (87), 46 states have call predecessors, (87), 53 states have return successors, (107), 90 states have call predecessors, (107), 83 states have call successors, (107) [2023-11-06 22:50:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 818 transitions. [2023-11-06 22:50:52,172 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 818 transitions. Word has length 105 [2023-11-06 22:50:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:52,173 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 818 transitions. [2023-11-06 22:50:52,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:50:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 818 transitions. [2023-11-06 22:50:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-06 22:50:52,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:52,175 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:52,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:50:52,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:52,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1871151856, now seen corresponding path program 1 times [2023-11-06 22:50:52,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:52,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467727117] [2023-11-06 22:50:52,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:50:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:50:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:50:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:50:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:50:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:50:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 22:50:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 22:50:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:50:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467727117] [2023-11-06 22:50:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467727117] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929942369] [2023-11-06 22:50:53,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:53,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:53,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:53,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:53,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:50:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:54,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:50:54,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:50:56,735 WARN L861 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2023-11-06 22:50:56,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2023-11-06 22:50:56,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2023-11-06 22:50:56,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-06 22:50:56,952 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-06 22:50:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:50:57,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:50:57,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929942369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:57,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:50:57,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-11-06 22:50:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040808214] [2023-11-06 22:50:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:57,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:50:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:57,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:50:57,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=157, Unknown=1, NotChecked=24, Total=210 [2023-11-06 22:50:57,030 INFO L87 Difference]: Start difference. First operand 652 states and 818 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-06 22:50:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:57,897 INFO L93 Difference]: Finished difference Result 731 states and 905 transitions. [2023-11-06 22:50:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:50:57,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 114 [2023-11-06 22:50:57,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:57,903 INFO L225 Difference]: With dead ends: 731 [2023-11-06 22:50:57,903 INFO L226 Difference]: Without dead ends: 690 [2023-11-06 22:50:57,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=36, Invalid=207, Unknown=1, NotChecked=28, Total=272 [2023-11-06 22:50:57,905 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 18 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:57,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1242 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 294 Unchecked, 0.7s Time] [2023-11-06 22:50:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2023-11-06 22:50:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 670. [2023-11-06 22:50:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 521 states have (on average 1.220729366602687) internal successors, (636), 529 states have internal predecessors, (636), 89 states have call successors, (89), 50 states have call predecessors, (89), 59 states have return successors, (111), 90 states have call predecessors, (111), 85 states have call successors, (111) [2023-11-06 22:50:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 836 transitions. [2023-11-06 22:50:57,980 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 836 transitions. Word has length 114 [2023-11-06 22:50:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:57,981 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 836 transitions. [2023-11-06 22:50:57,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-06 22:50:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 836 transitions. [2023-11-06 22:50:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:50:57,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:57,983 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:57,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:50:58,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:58,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:58,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 921527531, now seen corresponding path program 1 times [2023-11-06 22:50:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083003290] [2023-11-06 22:50:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:50:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:50:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:50:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:50:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:50:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:50:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:50:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:50:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:50:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:50:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:50:59,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:59,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083003290] [2023-11-06 22:50:59,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083003290] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:50:59,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539060093] [2023-11-06 22:50:59,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:59,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:50:59,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:59,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:50:59,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:51:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:00,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-06 22:51:00,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 22:51:00,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539060093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:00,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:00,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2023-11-06 22:51:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783656275] [2023-11-06 22:51:00,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:00,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:51:00,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:00,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:51:00,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:51:00,786 INFO L87 Difference]: Start difference. First operand 670 states and 836 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:51:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:00,973 INFO L93 Difference]: Finished difference Result 1322 states and 1656 transitions. [2023-11-06 22:51:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:51:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-11-06 22:51:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:00,980 INFO L225 Difference]: With dead ends: 1322 [2023-11-06 22:51:00,980 INFO L226 Difference]: Without dead ends: 701 [2023-11-06 22:51:00,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:51:00,983 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 13 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:00,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1917 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:51:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-11-06 22:51:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 672. [2023-11-06 22:51:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 522 states have (on average 1.2126436781609196) internal successors, (633), 531 states have internal predecessors, (633), 89 states have call successors, (89), 50 states have call predecessors, (89), 60 states have return successors, (112), 90 states have call predecessors, (112), 85 states have call successors, (112) [2023-11-06 22:51:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 834 transitions. [2023-11-06 22:51:01,062 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 834 transitions. Word has length 116 [2023-11-06 22:51:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:01,063 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 834 transitions. [2023-11-06 22:51:01,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:51:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 834 transitions. [2023-11-06 22:51:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:51:01,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:01,067 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:01,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:01,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:01,277 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:01,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1359537034, now seen corresponding path program 1 times [2023-11-06 22:51:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:01,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959314809] [2023-11-06 22:51:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:51:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:51:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:51:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:51:02,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:02,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959314809] [2023-11-06 22:51:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959314809] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005751130] [2023-11-06 22:51:02,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:02,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:02,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:02,561 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:02,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:51:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:03,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:51:03,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:51:03,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:03,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005751130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:03,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:03,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-06 22:51:03,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395891513] [2023-11-06 22:51:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:03,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:51:03,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:03,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:51:03,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:51:03,713 INFO L87 Difference]: Start difference. First operand 672 states and 834 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:51:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:03,836 INFO L93 Difference]: Finished difference Result 883 states and 1120 transitions. [2023-11-06 22:51:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:51:03,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2023-11-06 22:51:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:03,843 INFO L225 Difference]: With dead ends: 883 [2023-11-06 22:51:03,843 INFO L226 Difference]: Without dead ends: 848 [2023-11-06 22:51:03,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:51:03,845 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 110 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:03,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 927 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2023-11-06 22:51:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 674. [2023-11-06 22:51:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 524 states have (on average 1.2118320610687023) internal successors, (635), 533 states have internal predecessors, (635), 89 states have call successors, (89), 50 states have call predecessors, (89), 60 states have return successors, (112), 90 states have call predecessors, (112), 85 states have call successors, (112) [2023-11-06 22:51:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 836 transitions. [2023-11-06 22:51:03,920 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 836 transitions. Word has length 116 [2023-11-06 22:51:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:03,921 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 836 transitions. [2023-11-06 22:51:03,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:51:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 836 transitions. [2023-11-06 22:51:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-06 22:51:03,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:03,923 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:03,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:04,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:04,132 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:04,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1439834941, now seen corresponding path program 1 times [2023-11-06 22:51:04,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:04,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902851963] [2023-11-06 22:51:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:04,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:51:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-06 22:51:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:51:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 22:51:05,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:05,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902851963] [2023-11-06 22:51:05,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902851963] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:05,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539912955] [2023-11-06 22:51:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:05,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:05,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:05,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:05,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:51:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:06,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:51:06,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:51:06,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:51:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:51:07,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539912955] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:07,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:51:07,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 5] total 14 [2023-11-06 22:51:07,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222655573] [2023-11-06 22:51:07,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:07,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:51:07,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:07,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:51:07,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:51:07,007 INFO L87 Difference]: Start difference. First operand 674 states and 836 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-06 22:51:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:07,642 INFO L93 Difference]: Finished difference Result 1944 states and 2418 transitions. [2023-11-06 22:51:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:51:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 117 [2023-11-06 22:51:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:07,654 INFO L225 Difference]: With dead ends: 1944 [2023-11-06 22:51:07,654 INFO L226 Difference]: Without dead ends: 1300 [2023-11-06 22:51:07,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:51:07,657 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 388 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:07,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 817 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:51:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2023-11-06 22:51:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1258. [2023-11-06 22:51:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 981 states have (on average 1.2130479102956166) internal successors, (1190), 995 states have internal predecessors, (1190), 164 states have call successors, (164), 93 states have call predecessors, (164), 112 states have return successors, (209), 169 states have call predecessors, (209), 160 states have call successors, (209) [2023-11-06 22:51:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1563 transitions. [2023-11-06 22:51:07,800 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1563 transitions. Word has length 117 [2023-11-06 22:51:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:07,800 INFO L495 AbstractCegarLoop]: Abstraction has 1258 states and 1563 transitions. [2023-11-06 22:51:07,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-06 22:51:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1563 transitions. [2023-11-06 22:51:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:51:07,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:07,804 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:07,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:08,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:08,013 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:08,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1040828235, now seen corresponding path program 1 times [2023-11-06 22:51:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181828762] [2023-11-06 22:51:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:08,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:51:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:51:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:51:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-06 22:51:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181828762] [2023-11-06 22:51:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181828762] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847930760] [2023-11-06 22:51:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:09,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:09,537 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:09,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:51:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:10,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 1838 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:51:10,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-06 22:51:11,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847930760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:11,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:11,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-11-06 22:51:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001205406] [2023-11-06 22:51:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:11,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:51:11,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:11,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:51:11,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:11,022 INFO L87 Difference]: Start difference. First operand 1258 states and 1563 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:51:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:11,139 INFO L93 Difference]: Finished difference Result 1927 states and 2395 transitions. [2023-11-06 22:51:11,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:51:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 140 [2023-11-06 22:51:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:11,145 INFO L225 Difference]: With dead ends: 1927 [2023-11-06 22:51:11,145 INFO L226 Difference]: Without dead ends: 723 [2023-11-06 22:51:11,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:51:11,152 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 14 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:11,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 725 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2023-11-06 22:51:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 695. [2023-11-06 22:51:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 541 states have (on average 1.2051756007393715) internal successors, (652), 549 states have internal predecessors, (652), 91 states have call successors, (91), 52 states have call predecessors, (91), 62 states have return successors, (113), 93 states have call predecessors, (113), 87 states have call successors, (113) [2023-11-06 22:51:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 856 transitions. [2023-11-06 22:51:11,238 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 856 transitions. Word has length 140 [2023-11-06 22:51:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:11,239 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 856 transitions. [2023-11-06 22:51:11,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:51:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 856 transitions. [2023-11-06 22:51:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:51:11,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:11,241 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:11,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:11,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:51:11,458 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:11,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1993221811, now seen corresponding path program 1 times [2023-11-06 22:51:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:11,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78893684] [2023-11-06 22:51:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:12,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:12,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:51:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:51:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:51:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-06 22:51:13,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:13,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78893684] [2023-11-06 22:51:13,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78893684] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:13,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905038434] [2023-11-06 22:51:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:13,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:13,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:13,092 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:13,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:51:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:14,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:51:14,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-06 22:51:14,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:14,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905038434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:14,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:14,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-06 22:51:14,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49648426] [2023-11-06 22:51:14,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:14,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:51:14,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:14,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:51:14,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:14,708 INFO L87 Difference]: Start difference. First operand 695 states and 856 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:51:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:14,953 INFO L93 Difference]: Finished difference Result 1209 states and 1487 transitions. [2023-11-06 22:51:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:51:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 140 [2023-11-06 22:51:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:14,962 INFO L225 Difference]: With dead ends: 1209 [2023-11-06 22:51:14,962 INFO L226 Difference]: Without dead ends: 1204 [2023-11-06 22:51:14,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:14,964 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 329 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:14,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 393 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:51:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2023-11-06 22:51:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1176. [2023-11-06 22:51:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 908 states have (on average 1.198237885462555) internal successors, (1088), 920 states have internal predecessors, (1088), 155 states have call successors, (155), 92 states have call predecessors, (155), 112 states have return successors, (208), 163 states have call predecessors, (208), 151 states have call successors, (208) [2023-11-06 22:51:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1451 transitions. [2023-11-06 22:51:15,125 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1451 transitions. Word has length 140 [2023-11-06 22:51:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:15,125 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1451 transitions. [2023-11-06 22:51:15,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:51:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1451 transitions. [2023-11-06 22:51:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-06 22:51:15,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:15,129 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:15,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:15,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:51:15,338 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:15,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1503214572, now seen corresponding path program 1 times [2023-11-06 22:51:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668648902] [2023-11-06 22:51:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:51:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:51:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:51:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:51:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 22:51:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-06 22:51:16,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:16,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668648902] [2023-11-06 22:51:16,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668648902] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:16,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783821724] [2023-11-06 22:51:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:16,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:16,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:16,861 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:16,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:51:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:18,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 1891 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:51:18,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-06 22:51:18,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:18,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783821724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:18,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:18,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-11-06 22:51:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212369071] [2023-11-06 22:51:18,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:18,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:51:18,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:51:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:18,409 INFO L87 Difference]: Start difference. First operand 1176 states and 1451 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:18,617 INFO L93 Difference]: Finished difference Result 1350 states and 1689 transitions. [2023-11-06 22:51:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:51:18,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2023-11-06 22:51:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:18,627 INFO L225 Difference]: With dead ends: 1350 [2023-11-06 22:51:18,627 INFO L226 Difference]: Without dead ends: 1340 [2023-11-06 22:51:18,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:51:18,629 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 254 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:18,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 538 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2023-11-06 22:51:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1182. [2023-11-06 22:51:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 914 states have (on average 1.1969365426695842) internal successors, (1094), 926 states have internal predecessors, (1094), 155 states have call successors, (155), 92 states have call predecessors, (155), 112 states have return successors, (208), 163 states have call predecessors, (208), 151 states have call successors, (208) [2023-11-06 22:51:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1457 transitions. [2023-11-06 22:51:18,792 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1457 transitions. Word has length 153 [2023-11-06 22:51:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:18,793 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1457 transitions. [2023-11-06 22:51:18,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:51:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1457 transitions. [2023-11-06 22:51:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-06 22:51:18,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:18,796 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:18,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:19,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:51:19,006 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:19,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1938271971, now seen corresponding path program 1 times [2023-11-06 22:51:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34417594] [2023-11-06 22:51:19,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:19,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:51:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:51:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:51:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:51:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-06 22:51:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-06 22:51:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34417594] [2023-11-06 22:51:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34417594] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94914023] [2023-11-06 22:51:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:20,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:20,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:20,453 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:20,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:51:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:21,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:51:21,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-06 22:51:21,985 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94914023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2023-11-06 22:51:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541885687] [2023-11-06 22:51:21,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:21,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:51:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:21,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:51:21,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:21,988 INFO L87 Difference]: Start difference. First operand 1182 states and 1457 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-06 22:51:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:22,180 INFO L93 Difference]: Finished difference Result 2292 states and 2835 transitions. [2023-11-06 22:51:22,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:51:22,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 157 [2023-11-06 22:51:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:22,189 INFO L225 Difference]: With dead ends: 2292 [2023-11-06 22:51:22,189 INFO L226 Difference]: Without dead ends: 1182 [2023-11-06 22:51:22,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:22,193 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 76 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:22,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 429 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:51:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2023-11-06 22:51:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2023-11-06 22:51:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 914 states have (on average 1.1794310722100656) internal successors, (1078), 926 states have internal predecessors, (1078), 155 states have call successors, (155), 92 states have call predecessors, (155), 112 states have return successors, (208), 163 states have call predecessors, (208), 151 states have call successors, (208) [2023-11-06 22:51:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1441 transitions. [2023-11-06 22:51:22,341 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1441 transitions. Word has length 157 [2023-11-06 22:51:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:22,345 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1441 transitions. [2023-11-06 22:51:22,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-06 22:51:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1441 transitions. [2023-11-06 22:51:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-06 22:51:22,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:22,348 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:22,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:22,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:51:22,558 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:22,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:22,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1030281729, now seen corresponding path program 1 times [2023-11-06 22:51:22,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:22,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514364605] [2023-11-06 22:51:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:22,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:23,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:23,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:51:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:51:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:51:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:51:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:51:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 22:51:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 22:51:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-06 22:51:24,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:24,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514364605] [2023-11-06 22:51:24,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514364605] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:24,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118217826] [2023-11-06 22:51:24,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:24,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:24,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:24,133 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:24,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:51:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:25,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-06 22:51:25,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:51:25,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118217826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:25,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:25,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2023-11-06 22:51:25,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928222523] [2023-11-06 22:51:25,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:25,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:51:25,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:25,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:51:25,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:51:25,668 INFO L87 Difference]: Start difference. First operand 1182 states and 1441 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:51:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:25,905 INFO L93 Difference]: Finished difference Result 2336 states and 2858 transitions. [2023-11-06 22:51:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:51:25,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) Word has length 168 [2023-11-06 22:51:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:25,914 INFO L225 Difference]: With dead ends: 2336 [2023-11-06 22:51:25,915 INFO L226 Difference]: Without dead ends: 1219 [2023-11-06 22:51:25,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:51:25,919 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 15 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:25,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1974 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-11-06 22:51:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1190. [2023-11-06 22:51:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 922 states have (on average 1.1767895878524945) internal successors, (1085), 930 states have internal predecessors, (1085), 155 states have call successors, (155), 92 states have call predecessors, (155), 112 states have return successors, (208), 167 states have call predecessors, (208), 151 states have call successors, (208) [2023-11-06 22:51:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1448 transitions. [2023-11-06 22:51:26,092 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1448 transitions. Word has length 168 [2023-11-06 22:51:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:26,093 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 1448 transitions. [2023-11-06 22:51:26,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:51:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1448 transitions. [2023-11-06 22:51:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-06 22:51:26,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:26,096 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:26,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:26,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:51:26,305 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:26,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1016031584, now seen corresponding path program 2 times [2023-11-06 22:51:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:26,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108415931] [2023-11-06 22:51:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:51:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:51:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:51:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-06 22:51:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-06 22:51:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 22:51:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 22:51:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-06 22:51:27,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:27,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108415931] [2023-11-06 22:51:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108415931] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:27,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278657586] [2023-11-06 22:51:27,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:51:27,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:27,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:27,689 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:27,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:51:29,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:51:29,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:51:29,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 1631 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:51:29,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-06 22:51:29,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:29,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278657586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:29,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:29,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-06 22:51:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051251318] [2023-11-06 22:51:29,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:29,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:29,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:29,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:29,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:51:29,144 INFO L87 Difference]: Start difference. First operand 1190 states and 1448 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:51:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:29,285 INFO L93 Difference]: Finished difference Result 2308 states and 2818 transitions. [2023-11-06 22:51:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:29,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 168 [2023-11-06 22:51:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:29,294 INFO L225 Difference]: With dead ends: 2308 [2023-11-06 22:51:29,294 INFO L226 Difference]: Without dead ends: 1190 [2023-11-06 22:51:29,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:51:29,298 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 14 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:29,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 438 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2023-11-06 22:51:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2023-11-06 22:51:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 922 states have (on average 1.1746203904555315) internal successors, (1083), 930 states have internal predecessors, (1083), 155 states have call successors, (155), 92 states have call predecessors, (155), 112 states have return successors, (208), 167 states have call predecessors, (208), 151 states have call successors, (208) [2023-11-06 22:51:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1446 transitions. [2023-11-06 22:51:29,452 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1446 transitions. Word has length 168 [2023-11-06 22:51:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:29,453 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 1446 transitions. [2023-11-06 22:51:29,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:51:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1446 transitions. [2023-11-06 22:51:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 22:51:29,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:29,456 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:29,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:29,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:29,665 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:29,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash 378988998, now seen corresponding path program 1 times [2023-11-06 22:51:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:29,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114602273] [2023-11-06 22:51:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:30,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:30,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:51:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:51:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:51:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:51:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 22:51:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:51:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:51:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-06 22:51:31,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:31,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114602273] [2023-11-06 22:51:31,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114602273] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:31,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753238901] [2023-11-06 22:51:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:31,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:31,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:31,104 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:31,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 22:51:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:32,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 1948 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 22:51:32,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:51:32,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:32,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753238901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:32,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:32,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2023-11-06 22:51:32,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061977536] [2023-11-06 22:51:32,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:32,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:51:32,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:32,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:51:32,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:51:32,895 INFO L87 Difference]: Start difference. First operand 1190 states and 1446 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 8 states have internal predecessors, (119), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:51:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:33,335 INFO L93 Difference]: Finished difference Result 2486 states and 3036 transitions. [2023-11-06 22:51:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:51:33,336 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 8 states have internal predecessors, (119), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) Word has length 169 [2023-11-06 22:51:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:33,348 INFO L225 Difference]: With dead ends: 2486 [2023-11-06 22:51:33,348 INFO L226 Difference]: Without dead ends: 1336 [2023-11-06 22:51:33,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:51:33,354 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 24 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:33,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2163 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:51:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2023-11-06 22:51:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1267. [2023-11-06 22:51:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 990 states have (on average 1.1707070707070708) internal successors, (1159), 990 states have internal predecessors, (1159), 155 states have call successors, (155), 92 states have call predecessors, (155), 121 states have return successors, (225), 184 states have call predecessors, (225), 151 states have call successors, (225) [2023-11-06 22:51:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1539 transitions. [2023-11-06 22:51:33,624 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1539 transitions. Word has length 169 [2023-11-06 22:51:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:33,625 INFO L495 AbstractCegarLoop]: Abstraction has 1267 states and 1539 transitions. [2023-11-06 22:51:33,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 8 states have internal predecessors, (119), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:51:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1539 transitions. [2023-11-06 22:51:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 22:51:33,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:33,629 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:33,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:33,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:33,844 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:33,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash 809905799, now seen corresponding path program 2 times [2023-11-06 22:51:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:33,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722015859] [2023-11-06 22:51:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:51:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:51:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:51:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:51:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 22:51:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:51:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-06 22:51:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-06 22:51:35,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:35,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722015859] [2023-11-06 22:51:35,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722015859] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:35,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289867396] [2023-11-06 22:51:35,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:51:35,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:35,745 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:35,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 22:51:37,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:51:37,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:51:37,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:51:37,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-06 22:51:37,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:51:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289867396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:37,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:51:37,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-06 22:51:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632729997] [2023-11-06 22:51:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:37,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:51:37,752 INFO L87 Difference]: Start difference. First operand 1267 states and 1539 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:51:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:37,830 INFO L93 Difference]: Finished difference Result 1693 states and 2056 transitions. [2023-11-06 22:51:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:37,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2023-11-06 22:51:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:37,836 INFO L225 Difference]: With dead ends: 1693 [2023-11-06 22:51:37,836 INFO L226 Difference]: Without dead ends: 503 [2023-11-06 22:51:37,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:51:37,840 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 5 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:37,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 444 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-11-06 22:51:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 497. [2023-11-06 22:51:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 386 states have (on average 1.150259067357513) internal successors, (444), 388 states have internal predecessors, (444), 61 states have call successors, (61), 38 states have call predecessors, (61), 49 states have return successors, (79), 70 states have call predecessors, (79), 57 states have call successors, (79) [2023-11-06 22:51:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 584 transitions. [2023-11-06 22:51:37,910 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 584 transitions. Word has length 169 [2023-11-06 22:51:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:37,911 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 584 transitions. [2023-11-06 22:51:37,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:51:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 584 transitions. [2023-11-06 22:51:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-06 22:51:37,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:37,914 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:37,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:38,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:51:38,125 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:38,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash 437556386, now seen corresponding path program 1 times [2023-11-06 22:51:38,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:38,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692660015] [2023-11-06 22:51:38,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:38,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:51:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:51:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 22:51:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:51:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:51:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:51:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 22:51:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 22:51:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 22:51:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-06 22:51:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-06 22:51:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-06 22:51:39,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692660015] [2023-11-06 22:51:39,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692660015] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:51:39,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645679410] [2023-11-06 22:51:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:39,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:51:39,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:39,529 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:51:39,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 22:51:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 22:51:41,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:51:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:51:41,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:51:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 22:51:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645679410] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:51:41,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:51:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-11-06 22:51:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462066341] [2023-11-06 22:51:41,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:51:41,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:51:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:41,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:51:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:51:41,453 INFO L87 Difference]: Start difference. First operand 497 states and 584 transitions. Second operand has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 9 states have internal predecessors, (157), 5 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (31), 6 states have call predecessors, (31), 5 states have call successors, (31) [2023-11-06 22:51:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:42,886 INFO L93 Difference]: Finished difference Result 1042 states and 1239 transitions. [2023-11-06 22:51:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:51:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 9 states have internal predecessors, (157), 5 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (31), 6 states have call predecessors, (31), 5 states have call successors, (31) Word has length 171 [2023-11-06 22:51:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:42,894 INFO L225 Difference]: With dead ends: 1042 [2023-11-06 22:51:42,894 INFO L226 Difference]: Without dead ends: 525 [2023-11-06 22:51:42,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2023-11-06 22:51:42,897 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 238 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:42,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1889 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:51:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-11-06 22:51:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 502. [2023-11-06 22:51:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 390 states have (on average 1.1384615384615384) internal successors, (444), 390 states have internal predecessors, (444), 63 states have call successors, (63), 38 states have call predecessors, (63), 48 states have return successors, (82), 73 states have call predecessors, (82), 59 states have call successors, (82) [2023-11-06 22:51:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 589 transitions. [2023-11-06 22:51:42,965 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 589 transitions. Word has length 171 [2023-11-06 22:51:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:42,965 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 589 transitions. [2023-11-06 22:51:42,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.466666666666667) internal successors, (157), 9 states have internal predecessors, (157), 5 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (31), 6 states have call predecessors, (31), 5 states have call successors, (31) [2023-11-06 22:51:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 589 transitions. [2023-11-06 22:51:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-06 22:51:42,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:42,968 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:42,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:51:43,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 22:51:43,179 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:43,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash -619010039, now seen corresponding path program 1 times [2023-11-06 22:51:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699546901] [2023-11-06 22:51:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:51:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:51:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:51:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:51:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:51:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:51:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-06 22:51:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-06 22:51:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 22:51:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-06 22:51:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-06 22:51:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-06 22:51:44,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699546901] [2023-11-06 22:51:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699546901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:44,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:44,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:51:44,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538367321] [2023-11-06 22:51:44,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:44,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:51:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:51:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:51:44,396 INFO L87 Difference]: Start difference. First operand 502 states and 589 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-06 22:51:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:45,043 INFO L93 Difference]: Finished difference Result 785 states and 928 transitions. [2023-11-06 22:51:45,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:51:45,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 173 [2023-11-06 22:51:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:45,047 INFO L225 Difference]: With dead ends: 785 [2023-11-06 22:51:45,047 INFO L226 Difference]: Without dead ends: 353 [2023-11-06 22:51:45,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:51:45,049 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 219 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:45,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 647 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:51:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-11-06 22:51:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 345. [2023-11-06 22:51:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 270 states have (on average 1.137037037037037) internal successors, (307), 270 states have internal predecessors, (307), 44 states have call successors, (44), 27 states have call predecessors, (44), 30 states have return successors, (49), 47 states have call predecessors, (49), 40 states have call successors, (49) [2023-11-06 22:51:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 400 transitions. [2023-11-06 22:51:45,124 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 400 transitions. Word has length 173 [2023-11-06 22:51:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:45,124 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 400 transitions. [2023-11-06 22:51:45,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-06 22:51:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 400 transitions. [2023-11-06 22:51:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-06 22:51:45,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:45,127 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:45,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:51:45,128 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:45,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash -380509458, now seen corresponding path program 1 times [2023-11-06 22:51:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833342053] [2023-11-06 22:51:45,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:45,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:51:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:51:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:51:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:51:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:51:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:51:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-06 22:51:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-06 22:51:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-06 22:51:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-06 22:51:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-06 22:51:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-06 22:51:47,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:47,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833342053] [2023-11-06 22:51:47,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833342053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:47,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:47,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:51:47,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778300639] [2023-11-06 22:51:47,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:47,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:51:47,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:47,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:51:47,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:51:47,134 INFO L87 Difference]: Start difference. First operand 345 states and 400 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-06 22:51:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:48,141 INFO L93 Difference]: Finished difference Result 787 states and 953 transitions. [2023-11-06 22:51:48,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:51:48,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 175 [2023-11-06 22:51:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:48,146 INFO L225 Difference]: With dead ends: 787 [2023-11-06 22:51:48,146 INFO L226 Difference]: Without dead ends: 512 [2023-11-06 22:51:48,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:51:48,149 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 313 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:48,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1588 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:51:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2023-11-06 22:51:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 348. [2023-11-06 22:51:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 273 states have (on average 1.1355311355311355) internal successors, (310), 273 states have internal predecessors, (310), 44 states have call successors, (44), 27 states have call predecessors, (44), 30 states have return successors, (49), 47 states have call predecessors, (49), 40 states have call successors, (49) [2023-11-06 22:51:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 403 transitions. [2023-11-06 22:51:48,228 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 403 transitions. Word has length 175 [2023-11-06 22:51:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:48,229 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 403 transitions. [2023-11-06 22:51:48,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-06 22:51:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 403 transitions. [2023-11-06 22:51:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-06 22:51:48,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:48,233 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:48,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:51:48,233 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:48,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash 624985109, now seen corresponding path program 1 times [2023-11-06 22:51:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:48,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547388548] [2023-11-06 22:51:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:51:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:51:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:51:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:51:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:51:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:51:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-06 22:51:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-06 22:51:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-06 22:51:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 22:51:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-06 22:51:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-06 22:51:49,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547388548] [2023-11-06 22:51:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547388548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:49,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:49,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:51:49,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471154426] [2023-11-06 22:51:49,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:49,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:51:49,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:49,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:51:49,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:51:49,937 INFO L87 Difference]: Start difference. First operand 348 states and 403 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 7 states have internal predecessors, (116), 5 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-06 22:51:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:50,687 INFO L93 Difference]: Finished difference Result 358 states and 412 transitions. [2023-11-06 22:51:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:51:50,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 7 states have internal predecessors, (116), 5 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 176 [2023-11-06 22:51:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:50,690 INFO L225 Difference]: With dead ends: 358 [2023-11-06 22:51:50,690 INFO L226 Difference]: Without dead ends: 296 [2023-11-06 22:51:50,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:51:50,692 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 513 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:50,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 840 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:51:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-11-06 22:51:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 272. [2023-11-06 22:51:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 214 states have (on average 1.1355140186915889) internal successors, (243), 216 states have internal predecessors, (243), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (34), 32 states have call predecessors, (34), 33 states have call successors, (34) [2023-11-06 22:51:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 312 transitions. [2023-11-06 22:51:50,734 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 312 transitions. Word has length 176 [2023-11-06 22:51:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:50,735 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 312 transitions. [2023-11-06 22:51:50,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 7 states have internal predecessors, (116), 5 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2023-11-06 22:51:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 312 transitions. [2023-11-06 22:51:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-06 22:51:50,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:50,738 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:50,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:51:50,739 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:50,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:50,739 INFO L85 PathProgramCache]: Analyzing trace with hash -449704522, now seen corresponding path program 1 times [2023-11-06 22:51:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938466131] [2023-11-06 22:51:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:50,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:51:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-06 22:51:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:51:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 22:51:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:51:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:51:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 22:51:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:51:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 22:51:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:51:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-06 22:51:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-06 22:51:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-06 22:51:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 22:51:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-06 22:51:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-06 22:51:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:51:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-06 22:51:52,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:52,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938466131] [2023-11-06 22:51:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938466131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:52,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:52,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:51:52,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732404137] [2023-11-06 22:51:52,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:52,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:51:52,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:51:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:51:52,342 INFO L87 Difference]: Start difference. First operand 272 states and 312 transitions. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 5 states have internal predecessors, (134), 4 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-06 22:51:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:52,898 INFO L93 Difference]: Finished difference Result 283 states and 322 transitions. [2023-11-06 22:51:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:51:52,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 5 states have internal predecessors, (134), 4 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 205 [2023-11-06 22:51:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:52,900 INFO L225 Difference]: With dead ends: 283 [2023-11-06 22:51:52,900 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:51:52,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:51:52,901 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 208 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:52,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 850 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:51:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:51:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:51:52,904 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) [2023-11-06 22:51:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:51:52,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 205 [2023-11-06 22:51:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:52,905 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:51:52,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 5 states have internal predecessors, (134), 4 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-06 22:51:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:51:52,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:51:52,908 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:51:52,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:51:52,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:52:13,514 WARN L293 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 56 DAG size of output: 40 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-06 22:52:25,682 WARN L293 SmtUtils]: Spent 12.11s on a formula simplification. DAG size of input: 45 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-06 22:52:27,736 INFO L899 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2023-11-06 22:52:27,737 INFO L902 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2023-11-06 22:52:27,737 INFO L902 garLoopResultBuilder]: At program point L3920(line 3920) the Hoare annotation is: true [2023-11-06 22:52:27,737 INFO L899 garLoopResultBuilder]: For program point L3920-1(line 3920) no Hoare annotation was computed. [2023-11-06 22:52:27,737 INFO L899 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2023-11-06 22:52:27,737 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3909 3925) the Hoare annotation is: true [2023-11-06 22:52:27,737 INFO L899 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2023-11-06 22:52:27,738 INFO L902 garLoopResultBuilder]: At program point usb_register_returnLabel#1(lines 3465 3473) the Hoare annotation is: true [2023-11-06 22:52:27,738 INFO L902 garLoopResultBuilder]: At program point usb_register_driver_returnLabel#1(lines 4256 4258) the Hoare annotation is: true [2023-11-06 22:52:27,738 INFO L899 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2023-11-06 22:52:27,738 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2023-11-06 22:52:27,738 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 4209 4211) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2023-11-06 22:52:27,738 INFO L895 garLoopResultBuilder]: At program point L4210(line 4210) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2023-11-06 22:52:27,738 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2023-11-06 22:52:27,738 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2023-11-06 22:52:27,738 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2023-11-06 22:52:27,739 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 4264 4266) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |old(#valid)| |#valid|)) [2023-11-06 22:52:27,739 INFO L899 garLoopResultBuilder]: For program point printkFINAL(lines 4242 4244) no Hoare annotation was computed. [2023-11-06 22:52:27,739 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4242 4244) the Hoare annotation is: true [2023-11-06 22:52:27,739 INFO L899 garLoopResultBuilder]: For program point printkEXIT(lines 4242 4244) no Hoare annotation was computed. [2023-11-06 22:52:27,739 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2023-11-06 22:52:27,739 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4226 4228) the Hoare annotation is: true [2023-11-06 22:52:27,739 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2023-11-06 22:52:27,740 INFO L899 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2023-11-06 22:52:27,740 INFO L902 garLoopResultBuilder]: At program point usb_deregister_returnLabel#1(lines 4249 4251) the Hoare annotation is: true [2023-11-06 22:52:27,740 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3928 3936) the Hoare annotation is: true [2023-11-06 22:52:27,740 INFO L899 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2023-11-06 22:52:27,740 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2023-11-06 22:52:27,740 INFO L895 garLoopResultBuilder]: At program point L4207(line 4207) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (not (= 0 ~res_kbtab_probe_3~0)) (and (= |old(#length)| |#length|) (or (= |kzalloc_~flags#1| 208) (= |kzalloc_#in~flags#1| |kzalloc_~flags#1|)) (= |old(#valid)| |#valid|))) [2023-11-06 22:52:27,740 INFO L899 garLoopResultBuilder]: For program point L3409(line 3409) no Hoare annotation was computed. [2023-11-06 22:52:27,742 INFO L899 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2023-11-06 22:52:27,742 INFO L899 garLoopResultBuilder]: For program point L3409-2(line 3409) no Hoare annotation was computed. [2023-11-06 22:52:27,742 INFO L895 garLoopResultBuilder]: At program point kmalloc_returnLabel#1(lines 3394 3403) the Hoare annotation is: (or (= |kzalloc_~flags#1| 208) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |kzalloc_#in~flags#1| |kzalloc_~flags#1|) (not (= 0 ~res_kbtab_probe_3~0))) [2023-11-06 22:52:27,742 INFO L899 garLoopResultBuilder]: For program point L3409-4(line 3409) no Hoare annotation was computed. [2023-11-06 22:52:27,742 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 3405 3413) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0))) [2023-11-06 22:52:27,742 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2023-11-06 22:52:27,743 INFO L895 garLoopResultBuilder]: At program point __kmalloc_returnLabel#1(lines 4206 4208) the Hoare annotation is: (or (= |kzalloc_~flags#1| 208) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |kzalloc_#in~flags#1| |kzalloc_~flags#1|) (not (= 0 ~res_kbtab_probe_3~0))) [2023-11-06 22:52:27,743 INFO L902 garLoopResultBuilder]: At program point LDV_STOP(lines 4055 4061) the Hoare annotation is: true [2023-11-06 22:52:27,743 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2023-11-06 22:52:27,743 INFO L895 garLoopResultBuilder]: At program point L4117(lines 4093 4122) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (not (= |old(~ldv_coherent_state~0)| 1)))) (and (or .cse0 (and (= usb_free_coherent_~addr.base 0) (= |usb_free_coherent_#in~addr.base| 0) (<= 1 ~ldv_coherent_state~0) (= |usb_free_coherent_#in~addr.offset| 0) (= usb_free_coherent_~addr.offset 0)) .cse1 (and (= ~ldv_coherent_state~0 0) (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base) (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset))) (or (not (= (mod (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset) 18446744073709551616) 0)) .cse0 (not (= 0 ~res_kbtab_probe_3~0)) .cse1))) [2023-11-06 22:52:27,743 INFO L899 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2023-11-06 22:52:27,743 INFO L895 garLoopResultBuilder]: At program point L4109(line 4109) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2023-11-06 22:52:27,744 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 4093 4122) the Hoare annotation is: (or (= ~ldv_coherent_state~0 1) (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2023-11-06 22:52:27,744 INFO L899 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2023-11-06 22:52:27,744 INFO L895 garLoopResultBuilder]: At program point $Ultimate##5(lines 4097 4116) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (and (= ~ldv_coherent_state~0 1) (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base) (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset)) (not (= |old(~ldv_coherent_state~0)| 1))) [2023-11-06 22:52:27,744 INFO L902 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2023-11-06 22:52:27,744 INFO L899 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2023-11-06 22:52:27,744 INFO L899 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2023-11-06 22:52:27,745 INFO L899 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2023-11-06 22:52:27,745 INFO L899 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2023-11-06 22:52:27,745 INFO L902 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2023-11-06 22:52:27,745 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2023-11-06 22:52:27,745 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 3433 3441) the Hoare annotation is: true [2023-11-06 22:52:27,745 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2023-11-06 22:52:27,745 INFO L899 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2023-11-06 22:52:27,746 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2023-11-06 22:52:27,746 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 .cse1 (not (= ~ldv_coherent_state~0 1)) .cse2 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse2))) [2023-11-06 22:52:27,746 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2023-11-06 22:52:27,747 INFO L902 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2023-11-06 22:52:27,747 INFO L899 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2023-11-06 22:52:27,747 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 4150 4179) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2023-11-06 22:52:27,747 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2023-11-06 22:52:27,747 INFO L895 garLoopResultBuilder]: At program point $Ultimate##5(lines 4154 4173) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2023-11-06 22:52:27,747 INFO L899 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2023-11-06 22:52:27,748 INFO L899 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2023-11-06 22:52:27,748 INFO L895 garLoopResultBuilder]: At program point L4174(lines 4150 4179) the Hoare annotation is: (or (and (= ~ldv_urb_state~0 0) (let ((.cse1 (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (< (* .cse0 18446744073709551616) .cse1) (< .cse0 0))))) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2023-11-06 22:52:27,748 INFO L895 garLoopResultBuilder]: At program point L4166(line 4166) the Hoare annotation is: (or (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2023-11-06 22:52:27,748 INFO L899 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2023-11-06 22:52:27,748 INFO L899 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2023-11-06 22:52:27,749 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= ~ldv_coherent_state~0 1))) (.cse1 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or (< ~ldv_urb_state~0 0) (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1) (or (not (= ~ldv_urb_state~0 0)) .cse0 .cse2 .cse1 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_urb_state~0 1)) .cse0 .cse2 .cse1))) [2023-11-06 22:52:27,749 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2023-11-06 22:52:27,749 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2023-11-06 22:52:27,749 INFO L895 garLoopResultBuilder]: At program point L4032(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2023-11-06 22:52:27,750 INFO L899 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2023-11-06 22:52:27,750 INFO L895 garLoopResultBuilder]: At program point L3454-1(line 3454) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,750 INFO L895 garLoopResultBuilder]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2))) [2023-11-06 22:52:27,750 INFO L895 garLoopResultBuilder]: At program point ldv_initialize_returnLabel#1(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2023-11-06 22:52:27,750 INFO L895 garLoopResultBuilder]: At program point L3884(line 3884) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2023-11-06 22:52:27,751 INFO L899 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2023-11-06 22:52:27,751 INFO L899 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2023-11-06 22:52:27,751 INFO L899 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2023-11-06 22:52:27,751 INFO L899 garLoopResultBuilder]: For program point L3488(line 3488) no Hoare annotation was computed. [2023-11-06 22:52:27,751 INFO L899 garLoopResultBuilder]: For program point L3488-2(line 3488) no Hoare annotation was computed. [2023-11-06 22:52:27,751 INFO L899 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2023-11-06 22:52:27,752 INFO L895 garLoopResultBuilder]: At program point usb_fill_int_urb_returnLabel#1(lines 3475 3498) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= 1073741824 (mod |ULTIMATE.start_kbtab_probe_#t~nondet80#1| 4294967296)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,752 INFO L899 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2023-11-06 22:52:27,752 INFO L895 garLoopResultBuilder]: At program point L3885(line 3885) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1)) [2023-11-06 22:52:27,752 INFO L899 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2023-11-06 22:52:27,752 INFO L899 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2023-11-06 22:52:27,752 INFO L899 garLoopResultBuilder]: For program point L3836(line 3836) no Hoare annotation was computed. [2023-11-06 22:52:27,752 INFO L899 garLoopResultBuilder]: For program point L3836-2(line 3836) no Hoare annotation was computed. [2023-11-06 22:52:27,753 INFO L899 garLoopResultBuilder]: For program point L3836-4(line 3836) no Hoare annotation was computed. [2023-11-06 22:52:27,753 INFO L899 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2023-11-06 22:52:27,753 INFO L895 garLoopResultBuilder]: At program point L3886(line 3886) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_urb_state~0 0)) [2023-11-06 22:52:27,753 INFO L899 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2023-11-06 22:52:27,753 INFO L895 garLoopResultBuilder]: At program point L3886-1(lines 3875 3890) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_urb_state~0 0)) [2023-11-06 22:52:27,753 INFO L895 garLoopResultBuilder]: At program point usb_make_path_returnLabel#1(lines 3449 3463) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,754 INFO L899 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2023-11-06 22:52:27,754 INFO L899 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2023-11-06 22:52:27,754 INFO L895 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2))) [2023-11-06 22:52:27,754 INFO L899 garLoopResultBuilder]: For program point L3837(line 3837) no Hoare annotation was computed. [2023-11-06 22:52:27,754 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2023-11-06 22:52:27,754 INFO L899 garLoopResultBuilder]: For program point L3837-2(line 3837) no Hoare annotation was computed. [2023-11-06 22:52:27,755 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2023-11-06 22:52:27,755 INFO L899 garLoopResultBuilder]: For program point L3837-4(line 3837) no Hoare annotation was computed. [2023-11-06 22:52:27,755 INFO L899 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2023-11-06 22:52:27,755 INFO L899 garLoopResultBuilder]: For program point L3491(line 3491) no Hoare annotation was computed. [2023-11-06 22:52:27,755 INFO L899 garLoopResultBuilder]: For program point L3491-2(line 3491) no Hoare annotation was computed. [2023-11-06 22:52:27,755 INFO L899 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2023-11-06 22:52:27,755 INFO L899 garLoopResultBuilder]: For program point L3838-2(line 3838) no Hoare annotation was computed. [2023-11-06 22:52:27,756 INFO L899 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2023-11-06 22:52:27,756 INFO L899 garLoopResultBuilder]: For program point L3838-4(line 3838) no Hoare annotation was computed. [2023-11-06 22:52:27,756 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4070 4090) no Hoare annotation was computed. [2023-11-06 22:52:27,756 INFO L895 garLoopResultBuilder]: At program point interface_to_usbdev_returnLabel#1(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2023-11-06 22:52:27,756 INFO L899 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2023-11-06 22:52:27,756 INFO L899 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2023-11-06 22:52:27,757 INFO L895 garLoopResultBuilder]: At program point ldv_check_return_value_returnLabel#1(lines 4232 4234) the Hoare annotation is: (let ((.cse2 (= 0 ~res_kbtab_probe_3~0)) (.cse1 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse0 (= |ULTIMATE.start_kbtab_probe_#res#1| 0))) (or (and (= ~ldv_coherent_state~0 0) (not .cse0) (= ~ldv_urb_state~0 0) .cse1 (not .cse2)) (and .cse2 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse1 .cse0))) [2023-11-06 22:52:27,757 INFO L895 garLoopResultBuilder]: At program point __create_pipe_returnLabel#1(lines 3506 3511) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (<= |ULTIMATE.start___create_pipe_~endpoint#1| 255) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0) (<= 0 |ULTIMATE.start___create_pipe_~endpoint#1|)) [2023-11-06 22:52:27,757 INFO L895 garLoopResultBuilder]: At program point L4037(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2023-11-06 22:52:27,757 INFO L895 garLoopResultBuilder]: At program point L3426(line 3426) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2023-11-06 22:52:27,757 INFO L899 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2023-11-06 22:52:27,758 INFO L895 garLoopResultBuilder]: At program point L3839-1(line 3839) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,758 INFO L895 garLoopResultBuilder]: At program point L3839(line 3839) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,758 INFO L899 garLoopResultBuilder]: For program point L3509(line 3509) no Hoare annotation was computed. [2023-11-06 22:52:27,758 INFO L899 garLoopResultBuilder]: For program point L3509-2(line 3509) no Hoare annotation was computed. [2023-11-06 22:52:27,758 INFO L895 garLoopResultBuilder]: At program point L3856(line 3856) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2023-11-06 22:52:27,758 INFO L899 garLoopResultBuilder]: For program point L3509-4(line 3509) no Hoare annotation was computed. [2023-11-06 22:52:27,759 INFO L899 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2023-11-06 22:52:27,759 INFO L895 garLoopResultBuilder]: At program point kbtab_probe_returnLabel#1(lines 3782 3874) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse3 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse2 .cse4) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse3 (not .cse4) .cse1 .cse2))) [2023-11-06 22:52:27,759 INFO L895 garLoopResultBuilder]: At program point L3972(line 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2023-11-06 22:52:27,759 INFO L899 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2023-11-06 22:52:27,759 INFO L895 garLoopResultBuilder]: At program point L3840(line 3840) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:52:27,760 INFO L899 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2023-11-06 22:52:27,760 INFO L895 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2023-11-06 22:52:27,760 INFO L899 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2023-11-06 22:52:27,760 INFO L895 garLoopResultBuilder]: At program point usb_alloc_coherent_returnLabel#1(lines 4066 4091) the Hoare annotation is: (let ((.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.offset| 0)) (.cse0 (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (.cse4 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (.cse5 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (= ~ldv_coherent_state~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ~res_kbtab_probe_3~0) .cse1 (= ~ldv_coherent_state~0 1) (or (and .cse0 (not .cse2) .cse4) (and (not .cse0) .cse4 (not .cse3))) .cse5))) [2023-11-06 22:52:27,761 INFO L895 garLoopResultBuilder]: At program point strlcat_returnLabel#1(lines 4246 4248) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,761 INFO L895 garLoopResultBuilder]: At program point L4073(line 4073) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,761 INFO L899 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2023-11-06 22:52:27,761 INFO L895 garLoopResultBuilder]: At program point $Ultimate##39(lines 4129 4142) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,761 INFO L895 garLoopResultBuilder]: At program point usb_get_intfdata_returnLabel#1(lines 3422 3430) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2023-11-06 22:52:27,762 INFO L899 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2023-11-06 22:52:27,762 INFO L899 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2023-11-06 22:52:27,762 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2023-11-06 22:52:27,762 INFO L895 garLoopResultBuilder]: At program point L3529(line 3529) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,762 INFO L895 garLoopResultBuilder]: At program point $Ultimate##30(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,763 INFO L895 garLoopResultBuilder]: At program point $Ultimate##7(lines 3980 4031) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse0 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2023-11-06 22:52:27,763 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:52:27,763 INFO L899 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2023-11-06 22:52:27,763 INFO L895 garLoopResultBuilder]: At program point input_unregister_device_returnLabel#1(lines 4229 4231) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2023-11-06 22:52:27,763 INFO L895 garLoopResultBuilder]: At program point L3513(line 3513) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,764 INFO L895 garLoopResultBuilder]: At program point input_set_drvdata_returnLabel#1(lines 3525 3533) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,764 INFO L899 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2023-11-06 22:52:27,764 INFO L895 garLoopResultBuilder]: At program point $Ultimate##21(lines 4003 4014) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse0 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2023-11-06 22:52:27,764 INFO L899 garLoopResultBuilder]: For program point L3844(line 3844) no Hoare annotation was computed. [2023-11-06 22:52:27,764 INFO L899 garLoopResultBuilder]: For program point L3844-2(line 3844) no Hoare annotation was computed. [2023-11-06 22:52:27,764 INFO L899 garLoopResultBuilder]: For program point L3844-4(line 3844) no Hoare annotation was computed. [2023-11-06 22:52:27,765 INFO L899 garLoopResultBuilder]: For program point L3844-6(line 3844) no Hoare annotation was computed. [2023-11-06 22:52:27,765 INFO L899 garLoopResultBuilder]: For program point L3844-8(line 3844) no Hoare annotation was computed. [2023-11-06 22:52:27,765 INFO L895 garLoopResultBuilder]: At program point input_free_device_returnLabel#1(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2))) [2023-11-06 22:52:27,765 INFO L899 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2023-11-06 22:52:27,765 INFO L895 garLoopResultBuilder]: At program point L3861(line 3861) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2023-11-06 22:52:27,765 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:52:27,766 INFO L899 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2023-11-06 22:52:27,766 INFO L895 garLoopResultBuilder]: At program point usb_alloc_urb_returnLabel#1(lines 4124 4148) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse5 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) (.cse1 (= ~ldv_coherent_state~0 1)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)))) (.cse4 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= ~ldv_urb_state~0 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (or (not .cse0) (not .cse5)) (= 0 ~res_kbtab_probe_3~0) .cse1 (= ~ldv_urb_state~0 1) .cse2 .cse3 .cse4))) [2023-11-06 22:52:27,766 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4127 4147) no Hoare annotation was computed. [2023-11-06 22:52:27,766 INFO L899 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2023-11-06 22:52:27,766 INFO L895 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2023-11-06 22:52:27,767 INFO L895 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2023-11-06 22:52:27,767 INFO L895 garLoopResultBuilder]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 1)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) .cse0 .cse1 .cse2))) [2023-11-06 22:52:27,767 INFO L899 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2023-11-06 22:52:27,767 INFO L899 garLoopResultBuilder]: For program point L3847(line 3847) no Hoare annotation was computed. [2023-11-06 22:52:27,767 INFO L899 garLoopResultBuilder]: For program point L3847-2(line 3847) no Hoare annotation was computed. [2023-11-06 22:52:27,767 INFO L899 garLoopResultBuilder]: For program point L3847-4(line 3847) no Hoare annotation was computed. [2023-11-06 22:52:27,768 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:52:27,768 INFO L895 garLoopResultBuilder]: At program point L3798(line 3798) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,768 INFO L899 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2023-11-06 22:52:27,768 INFO L895 garLoopResultBuilder]: At program point usb_to_input_id_returnLabel#1(lines 3569 3578) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,768 INFO L895 garLoopResultBuilder]: At program point input_allocate_device_returnLabel#1(lines 3512 3514) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,769 INFO L899 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2023-11-06 22:52:27,769 INFO L899 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2023-11-06 22:52:27,769 INFO L895 garLoopResultBuilder]: At program point L3865(line 3865) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (= ~ldv_coherent_state~0 1)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and (or (not (= |ULTIMATE.start_kbtab_probe_#t~mem93#1.base| 0)) (not (= |ULTIMATE.start_kbtab_probe_#t~mem93#1.offset| 0))) .cse0 .cse1 .cse2 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) .cse0 .cse1 .cse2))) [2023-11-06 22:52:27,769 INFO L899 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2023-11-06 22:52:27,769 INFO L895 garLoopResultBuilder]: At program point L3882(line 3882) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2023-11-06 22:52:27,770 INFO L895 garLoopResultBuilder]: At program point $Ultimate##110(lines 4017 4023) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse0 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2023-11-06 22:52:27,770 INFO L899 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2023-11-06 22:52:27,770 INFO L895 garLoopResultBuilder]: At program point L4130(line 4130) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,770 INFO L895 garLoopResultBuilder]: At program point kbtab_probe_fail3#1(lines 3793 3873) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2023-11-06 22:52:27,770 INFO L895 garLoopResultBuilder]: At program point input_register_device_returnLabel#1(lines 4223 4225) the Hoare annotation is: (and (= 0 ~res_kbtab_probe_3~0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2023-11-06 22:52:27,770 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2023-11-06 22:52:27,771 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 4046 4051) the Hoare annotation is: true [2023-11-06 22:52:27,771 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2023-11-06 22:52:27,771 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2023-11-06 22:52:27,771 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2023-11-06 22:52:27,771 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2023-11-06 22:52:27,771 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4213 4215) the Hoare annotation is: true [2023-11-06 22:52:27,775 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:52:27,777 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:52:27,793 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:27,794 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:27,796 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:27,796 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:27,798 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,798 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,799 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,799 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,802 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,803 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,804 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,804 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,805 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,805 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,805 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,814 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,815 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,815 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,816 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,816 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,816 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:27,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:27,820 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:27,821 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:27,821 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:27,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:52:27 BoogieIcfgContainer [2023-11-06 22:52:27,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:52:27,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:52:27,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:52:27,825 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:52:27,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:31" (3/4) ... [2023-11-06 22:52:27,829 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:52:27,834 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2023-11-06 22:52:27,834 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2023-11-06 22:52:27,834 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2023-11-06 22:52:27,834 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2023-11-06 22:52:27,834 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2023-11-06 22:52:27,834 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printk [2023-11-06 22:52:27,834 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2023-11-06 22:52:27,835 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2023-11-06 22:52:27,835 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2023-11-06 22:52:27,835 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-11-06 22:52:27,835 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2023-11-06 22:52:27,835 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2023-11-06 22:52:27,835 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2023-11-06 22:52:27,836 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2023-11-06 22:52:27,836 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2023-11-06 22:52:27,870 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 65 nodes and edges [2023-11-06 22:52:27,872 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2023-11-06 22:52:27,874 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-06 22:52:27,881 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:52:27,883 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:52:27,885 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:52:27,931 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!((ldv_urb_state == 0)) || (((addr == 0) && (addr == 0)) && (1 <= ldv_coherent_state))) || !((\old(ldv_coherent_state) == 1))) || ((ldv_coherent_state == 0) && (addr == addr))) [2023-11-06 22:52:27,931 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_urb_state == 0) || !((1 == \old(ldv_urb_state)))) || !((ldv_coherent_state == 1))) || !((0 == res_kbtab_probe_3))) [2023-11-06 22:52:27,934 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!((ldv_urb_state == 0)) || ((ldv_coherent_state == 1) && (addr == addr))) || !((\old(ldv_coherent_state) == 1))) [2023-11-06 22:52:27,935 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0) && (ldv_urb_state == 0)) && ((\result + 12) <= 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) || (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (\result == 0))) || ((((((ldv_coherent_state == 0) && !((error == 0))) && (0 == res_kbtab_probe_3)) && !((\result == 0))) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0))) [2023-11-06 22:52:27,935 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0) && !((\result == 0))) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && !((0 == res_kbtab_probe_3))) || (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (\result == 0))) [2023-11-06 22:52:27,936 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((flags == 208) || !((ldv_coherent_state == 0))) || !((ldv_urb_state == 0))) || (\old(flags) == flags)) || !((0 == res_kbtab_probe_3))) [2023-11-06 22:52:27,936 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((flags == 208) || !((ldv_coherent_state == 0))) || !((ldv_urb_state == 0))) || (\old(flags) == flags)) || !((0 == res_kbtab_probe_3))) [2023-11-06 22:52:27,936 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0) && (0 == arbitrary_memory)) && (ldv_urb_state == 0)) && (\result == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) || (((((0 == res_kbtab_probe_3) && (ldv_urb_state == 0)) && (ldv_coherent_state == 1)) && (((0 == arbitrary_memory) && (ldv_s_kbtab_driver_usb_driver == 0)) || ((!((0 == arbitrary_memory)) && (ldv_s_kbtab_driver_usb_driver == 0)) && !((\result == 0))))) && ((error + 12) <= 0))) [2023-11-06 22:52:27,936 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0) && (ldv_urb_state == 0)) && (ldv_coherent_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (!((*kbtab == 0)) || !((*kbtab == 0)))) && ((error + 12) <= 0)) || ((((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (!((*kbtab == 0)) || !((*kbtab == 0)))) && ((error + 12) <= 0))) [2023-11-06 22:52:27,937 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_urb_state == 1) || !((1 == \old(ldv_urb_state)))) || !((ldv_coherent_state == 1))) || !((0 == res_kbtab_probe_3))) [2023-11-06 22:52:28,152 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!((ldv_urb_state == 0)) || (((addr == 0) && (addr == 0)) && (1 <= ldv_coherent_state))) || !((\old(ldv_coherent_state) == 1))) || ((ldv_coherent_state == 0) && (addr == addr))) [2023-11-06 22:52:28,152 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_urb_state == 0) || !((1 == \old(ldv_urb_state)))) || !((ldv_coherent_state == 1))) || !((0 == res_kbtab_probe_3))) [2023-11-06 22:52:28,154 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!((ldv_urb_state == 0)) || ((ldv_coherent_state == 1) && (addr == addr))) || !((\old(ldv_coherent_state) == 1))) [2023-11-06 22:52:28,154 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0) && (ldv_urb_state == 0)) && ((\result + 12) <= 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) || (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (\result == 0))) || ((((((ldv_coherent_state == 0) && !((error == 0))) && (0 == res_kbtab_probe_3)) && !((\result == 0))) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0))) [2023-11-06 22:52:28,155 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0) && !((\result == 0))) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && !((0 == res_kbtab_probe_3))) || (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (\result == 0))) [2023-11-06 22:52:28,155 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((flags == 208) || !((ldv_coherent_state == 0))) || !((ldv_urb_state == 0))) || (\old(flags) == flags)) || !((0 == res_kbtab_probe_3))) [2023-11-06 22:52:28,157 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((flags == 208) || !((ldv_coherent_state == 0))) || !((ldv_urb_state == 0))) || (\old(flags) == flags)) || !((0 == res_kbtab_probe_3))) [2023-11-06 22:52:28,158 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0) && (0 == arbitrary_memory)) && (ldv_urb_state == 0)) && (\result == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) || (((((0 == res_kbtab_probe_3) && (ldv_urb_state == 0)) && (ldv_coherent_state == 1)) && (((0 == arbitrary_memory) && (ldv_s_kbtab_driver_usb_driver == 0)) || ((!((0 == arbitrary_memory)) && (ldv_s_kbtab_driver_usb_driver == 0)) && !((\result == 0))))) && ((error + 12) <= 0))) [2023-11-06 22:52:28,158 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0) && (ldv_urb_state == 0)) && (ldv_coherent_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (!((*kbtab == 0)) || !((*kbtab == 0)))) && ((error + 12) <= 0)) || ((((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (!((*kbtab == 0)) || !((*kbtab == 0)))) && ((error + 12) <= 0))) [2023-11-06 22:52:28,158 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_urb_state == 1) || !((1 == \old(ldv_urb_state)))) || !((ldv_coherent_state == 1))) || !((0 == res_kbtab_probe_3))) [2023-11-06 22:52:28,217 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:52:28,218 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:52:28,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:52:28,218 INFO L158 Benchmark]: Toolchain (without parser) took 120643.27ms. Allocated memory was 144.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 107.1MB in the beginning and 887.6MB in the end (delta: -780.5MB). Peak memory consumption was 823.6MB. Max. memory is 16.1GB. [2023-11-06 22:52:28,219 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 111.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:52:28,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1295.50ms. Allocated memory was 144.7MB in the beginning and 188.7MB in the end (delta: 44.0MB). Free memory was 107.1MB in the beginning and 131.7MB in the end (delta: -24.7MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2023-11-06 22:52:28,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.88ms. Allocated memory is still 188.7MB. Free memory was 131.7MB in the beginning and 125.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:52:28,220 INFO L158 Benchmark]: Boogie Preprocessor took 113.32ms. Allocated memory is still 188.7MB. Free memory was 125.4MB in the beginning and 119.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:52:28,220 INFO L158 Benchmark]: RCFGBuilder took 2013.02ms. Allocated memory is still 188.7MB. Free memory was 119.1MB in the beginning and 83.8MB in the end (delta: 35.3MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2023-11-06 22:52:28,220 INFO L158 Benchmark]: TraceAbstraction took 116668.08ms. Allocated memory was 188.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 83.8MB in the beginning and 915.9MB in the end (delta: -832.0MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-11-06 22:52:28,225 INFO L158 Benchmark]: Witness Printer took 393.11ms. Allocated memory is still 1.7GB. Free memory was 915.9MB in the beginning and 887.6MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-06 22:52:28,226 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80ms. Allocated memory is still 111.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1295.50ms. Allocated memory was 144.7MB in the beginning and 188.7MB in the end (delta: 44.0MB). Free memory was 107.1MB in the beginning and 131.7MB in the end (delta: -24.7MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.88ms. Allocated memory is still 188.7MB. Free memory was 131.7MB in the beginning and 125.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.32ms. Allocated memory is still 188.7MB. Free memory was 125.4MB in the beginning and 119.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2013.02ms. Allocated memory is still 188.7MB. Free memory was 119.1MB in the beginning and 83.8MB in the end (delta: 35.3MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * TraceAbstraction took 116668.08ms. Allocated memory was 188.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 83.8MB in the beginning and 915.9MB in the end (delta: -832.0MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 393.11ms. Allocated memory is still 1.7GB. Free memory was 915.9MB in the beginning and 887.6MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4049]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 197 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 116.5s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 34.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4273 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4113 mSDsluCounter, 27384 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 294 IncrementalHoareTripleChecker+Unchecked, 21005 mSDsCounter, 841 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4791 IncrementalHoareTripleChecker+Invalid, 5926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 841 mSolverCounterUnsat, 6379 mSDtfsCounter, 4791 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3431 GetRequests, 3145 SyntacticMatches, 1 SemanticMatches, 285 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1267occurred in iteration=20, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 1593 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 3949 PreInvPairs, 4280 NumberOfFragments, 1588 HoareAnnotationTreeSize, 3949 FomulaSimplifications, 930618 FormulaSimplificationTreeSizeReduction, 6.7s HoareSimplificationTime, 84 FomulaSimplificationsInter, 28689 FormulaSimplificationTreeSizeReductionInter, 28.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 5520 NumberOfCodeBlocks, 5414 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 5763 ConstructedInterpolants, 8 QuantifiedInterpolants, 9956 SizeOfPredicates, 91 NumberOfNonLiveVariables, 26570 ConjunctsInSsa, 330 ConjunctsInUnsatCore, 45 InterpolantComputations, 25 PerfectInterpolantSequences, 1530/1700 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: 3442]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((0 == res_kbtab_probe_3) && (1 <= ldv_s_kbtab_driver_usb_driver)) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) - InvariantResult [Line: 4017]: Loop Invariant Derived loop invariant: (((((0 == res_kbtab_probe_3) && (1 <= ldv_s_kbtab_driver_usb_driver)) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) || ((((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0))) - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0) - InvariantResult [Line: 4055]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4124]: Loop Invariant [2023-11-06 22:52:28,246 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:28,246 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:28,247 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:28,247 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator Derived loop invariant: (((((((\result == 0) && (ldv_urb_state == 0)) && (ldv_coherent_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (!((*kbtab == 0)) || !((*kbtab == 0)))) && ((error + 12) <= 0)) || ((((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (!((*kbtab == 0)) || !((*kbtab == 0)))) && ((error + 12) <= 0))) - InvariantResult [Line: 4003]: Loop Invariant Derived loop invariant: (((((0 == res_kbtab_probe_3) && (1 <= ldv_s_kbtab_driver_usb_driver)) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) || ((((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0))) - InvariantResult [Line: 4097]: Loop Invariant [2023-11-06 22:52:28,248 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,248 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,249 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,249 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression Derived loop invariant: ((!((ldv_urb_state == 0)) || ((ldv_coherent_state == 1) && (addr == addr))) || !((\old(ldv_coherent_state) == 1))) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((!((error == 0)) && (0 == res_kbtab_probe_3)) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((ldv_urb_state == 0) && (ldv_coherent_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (!((*kbtab == 0)) || !((*kbtab == 0)))) && ((error + 12) <= 0)) || ((((!((error == 0)) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_coherent_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0))) - InvariantResult [Line: 4093]: Loop Invariant [2023-11-06 22:52:28,260 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,261 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,261 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,261 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,262 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,262 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,263 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,263 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,263 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,263 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~addr!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression Derived loop invariant: (((!((ldv_urb_state == 0)) || (((addr == 0) && (addr == 0)) && (1 <= ldv_coherent_state))) || !((\old(ldv_coherent_state) == 1))) || ((ldv_coherent_state == 0) && (addr == addr))) - InvariantResult [Line: 3875]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (1 <= ldv_s_kbtab_driver_usb_driver)) && (ldv_urb_state == 0)) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: (((((flags == 208) || !((ldv_coherent_state == 0))) || !((ldv_urb_state == 0))) || (\old(flags) == flags)) || !((0 == res_kbtab_probe_3))) - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) - InvariantResult [Line: 4129]: Loop Invariant Derived loop invariant: ((((((0 == res_kbtab_probe_3) && (ldv_urb_state == 0)) && (ldv_coherent_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (!((*kbtab == 0)) || !((*kbtab == 0)))) && ((error + 12) <= 0)) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((flags == 208) || !((ldv_coherent_state == 0))) || !((ldv_urb_state == 0))) || (\old(flags) == flags)) || !((0 == res_kbtab_probe_3))) - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0) && (ldv_urb_state == 0)) && ((\result + 12) <= 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) || (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (\result == 0))) || ((((((ldv_coherent_state == 0) && !((error == 0))) && (0 == res_kbtab_probe_3)) && !((\result == 0))) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0))) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) || (((((ldv_coherent_state == 0) && !((error == 0))) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0))) - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: ((((ldv_urb_state == 1) || !((1 == \old(ldv_urb_state)))) || !((ldv_coherent_state == 1))) || !((0 == res_kbtab_probe_3))) - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0) && !((\result == 0))) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && !((0 == res_kbtab_probe_3))) || (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (\result == 0))) - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ((((0 == res_kbtab_probe_3) && (1 <= ldv_s_kbtab_driver_usb_driver)) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: (((((0 == res_kbtab_probe_3) && (1 <= ldv_s_kbtab_driver_usb_driver)) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) || ((((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0))) - InvariantResult [Line: 4150]: Loop Invariant [2023-11-06 22:52:28,270 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,270 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,270 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,270 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,271 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:52:28,271 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~urb!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression Derived loop invariant: ((((ldv_urb_state == 0) || !((1 == \old(ldv_urb_state)))) || !((ldv_coherent_state == 1))) || !((0 == res_kbtab_probe_3))) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) || (((((ldv_coherent_state == 0) && !((error == 0))) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0))) - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: ((((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && (1073741824 <= (org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@32708871 % 4294967296))) && ((error + 12) <= 0)) - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0) - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: (((((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (endpoint <= 255)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) && (0 <= endpoint)) - InvariantResult [Line: 4066]: Loop Invariant [2023-11-06 22:52:28,273 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:28,274 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:28,274 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:52:28,274 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator Derived loop invariant: (((((((ldv_coherent_state == 0) && (0 == arbitrary_memory)) && (ldv_urb_state == 0)) && (\result == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) || (((((0 == res_kbtab_probe_3) && (ldv_urb_state == 0)) && (ldv_coherent_state == 1)) && (((0 == arbitrary_memory) && (ldv_s_kbtab_driver_usb_driver == 0)) || ((!((0 == arbitrary_memory)) && (ldv_s_kbtab_driver_usb_driver == 0)) && !((\result == 0))))) && ((error + 12) <= 0))) - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) - InvariantResult [Line: 3454]: Loop Invariant Derived loop invariant: (((((0 == res_kbtab_probe_3) && (ldv_coherent_state == 1)) && (ldv_urb_state == 1)) && (ldv_s_kbtab_driver_usb_driver == 0)) && ((error + 12) <= 0)) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0) && (0 == res_kbtab_probe_3)) && (ldv_urb_state == 0)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:52:28,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_080a8831-73f2-44d5-a16d-3a031e3f8906/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE