./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:01:48,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:01:49,040 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-64bit-Taipan_Default.epf [2023-12-02 18:01:49,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:01:49,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:01:49,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:01:49,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:01:49,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:01:49,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:01:49,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:01:49,077 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:01:49,077 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:01:49,078 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:01:49,079 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:01:49,079 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:01:49,080 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:01:49,080 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:01:49,081 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:01:49,081 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:01:49,082 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:01:49,083 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:01:49,083 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:01:49,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:01:49,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:01:49,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:01:49,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:01:49,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:01:49,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:01:49,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:01:49,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:01:49,092 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:01:49,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:01:49,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:01:49,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:01:49,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:01:49,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:01:49,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:01:49,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:01:49,094 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:01:49,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:01:49,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:01:49,095 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:01:49,095 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:01:49,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:01:49,096 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/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_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2023-12-02 18:01:49,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:01:49,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:01:49,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:01:49,332 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:01:49,332 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:01:49,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-12-02 18:01:52,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:01:52,513 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:01:52,514 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-12-02 18:01:52,540 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/data/11fb2ea5d/a8a6e2926aa2497289c856b283e894e3/FLAG15887aba3 [2023-12-02 18:01:52,555 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/data/11fb2ea5d/a8a6e2926aa2497289c856b283e894e3 [2023-12-02 18:01:52,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:01:52,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:01:52,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:01:52,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:01:52,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:01:52,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:01:52" (1/1) ... [2023-12-02 18:01:52,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d480c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:52, skipping insertion in model container [2023-12-02 18:01:52,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:01:52" (1/1) ... [2023-12-02 18:01:52,647 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:01:53,271 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_0b503ba2-581d-4da1-b561-965795b82e72/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2023-12-02 18:01:53,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:01:53,339 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:01:53,513 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_0b503ba2-581d-4da1-b561-965795b82e72/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2023-12-02 18:01:53,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:01:53,596 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:01:53,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53 WrapperNode [2023-12-02 18:01:53,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:01:53,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:01:53,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:01:53,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:01:53,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,689 INFO L138 Inliner]: procedures = 109, calls = 320, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 866 [2023-12-02 18:01:53,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:01:53,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:01:53,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:01:53,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:01:53,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:01:53,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:01:53,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:01:53,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:01:53,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (1/1) ... [2023-12-02 18:01:53,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:01:53,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:01:53,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:01:53,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:01:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-12-02 18:01:53,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-12-02 18:01:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 18:01:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-12-02 18:01:53,868 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-12-02 18:01:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-12-02 18:01:53,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-12-02 18:01:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-12-02 18:01:53,869 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-12-02 18:01:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2023-12-02 18:01:53,869 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2023-12-02 18:01:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 18:01:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-12-02 18:01:53,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-12-02 18:01:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-12-02 18:01:53,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-12-02 18:01:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2023-12-02 18:01:53,870 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2023-12-02 18:01:53,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2023-12-02 18:01:53,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2023-12-02 18:01:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 18:01:53,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 18:01:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 18:01:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:01:53,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-12-02 18:01:53,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-12-02 18:01:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 18:01:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2023-12-02 18:01:53,872 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2023-12-02 18:01:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2023-12-02 18:01:53,872 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2023-12-02 18:01:53,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2023-12-02 18:01:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2023-12-02 18:01:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 18:01:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:01:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 18:01:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-12-02 18:01:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-12-02 18:01:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-12-02 18:01:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2023-12-02 18:01:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-12-02 18:01:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-12-02 18:01:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 18:01:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:01:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:01:54,129 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:01:54,131 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:01:54,211 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-12-02 18:01:54,840 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:01:55,110 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:01:55,111 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 18:01:55,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:01:55 BoogieIcfgContainer [2023-12-02 18:01:55,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:01:55,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:01:55,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:01:55,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:01:55,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:01:52" (1/3) ... [2023-12-02 18:01:55,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2b0dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:01:55, skipping insertion in model container [2023-12-02 18:01:55,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:01:53" (2/3) ... [2023-12-02 18:01:55,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2b0dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:01:55, skipping insertion in model container [2023-12-02 18:01:55,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:01:55" (3/3) ... [2023-12-02 18:01:55,121 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-12-02 18:01:55,141 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:01:55,141 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 18:01:55,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:01:55,201 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@694a8593, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:01:55,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 18:01:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 116 states have internal predecessors, (150), 44 states have call successors, (44), 17 states have call predecessors, (44), 16 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-02 18:01:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 18:01:55,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:55,216 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] [2023-12-02 18:01:55,217 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:01:55,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash 937797664, now seen corresponding path program 1 times [2023-12-02 18:01:55,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:55,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83917481] [2023-12-02 18:01:55,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:55,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:01:55,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83917481] [2023-12-02 18:01:55,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83917481] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:01:55,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:01:55,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:01:55,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331228289] [2023-12-02 18:01:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:01:55,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:01:55,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:55,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:01:55,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:01:55,662 INFO L87 Difference]: Start difference. First operand has 169 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 116 states have internal predecessors, (150), 44 states have call successors, (44), 17 states have call predecessors, (44), 16 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 18:01:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:56,899 INFO L93 Difference]: Finished difference Result 477 states and 662 transitions. [2023-12-02 18:01:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:01:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-02 18:01:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:56,916 INFO L225 Difference]: With dead ends: 477 [2023-12-02 18:01:56,916 INFO L226 Difference]: Without dead ends: 299 [2023-12-02 18:01:56,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 18:01:56,924 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 199 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:56,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 372 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 18:01:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-02 18:01:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2023-12-02 18:01:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 196 states have (on average 1.336734693877551) internal successors, (262), 199 states have internal predecessors, (262), 73 states have call successors, (73), 30 states have call predecessors, (73), 29 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-02 18:01:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 404 transitions. [2023-12-02 18:01:56,996 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 404 transitions. Word has length 23 [2023-12-02 18:01:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:56,996 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 404 transitions. [2023-12-02 18:01:56,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 18:01:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 404 transitions. [2023-12-02 18:01:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 18:01:57,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:57,000 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 18:01:57,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 18:01:57,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:01:57,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash -76832100, now seen corresponding path program 1 times [2023-12-02 18:01:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:57,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881633991] [2023-12-02 18:01:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:57,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 18:01:57,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:57,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881633991] [2023-12-02 18:01:57,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881633991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:01:57,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:01:57,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:01:57,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240335007] [2023-12-02 18:01:57,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:01:57,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:01:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:01:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:01:57,124 INFO L87 Difference]: Start difference. First operand 299 states and 404 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 18:01:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:58,513 INFO L93 Difference]: Finished difference Result 495 states and 659 transitions. [2023-12-02 18:01:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:01:58,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-12-02 18:01:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:58,520 INFO L225 Difference]: With dead ends: 495 [2023-12-02 18:01:58,520 INFO L226 Difference]: Without dead ends: 492 [2023-12-02 18:01:58,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 18:01:58,523 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 133 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:58,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 347 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 18:01:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-12-02 18:01:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 488. [2023-12-02 18:01:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 324 states have (on average 1.3302469135802468) internal successors, (431), 329 states have internal predecessors, (431), 113 states have call successors, (113), 51 states have call predecessors, (113), 50 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2023-12-02 18:01:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 653 transitions. [2023-12-02 18:01:58,574 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 653 transitions. Word has length 39 [2023-12-02 18:01:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:58,575 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 653 transitions. [2023-12-02 18:01:58,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 18:01:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 653 transitions. [2023-12-02 18:01:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 18:01:58,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:01:58,578 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 18:01:58,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 18:01:58,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:01:58,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:01:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1913182748, now seen corresponding path program 1 times [2023-12-02 18:01:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:01:58,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435112431] [2023-12-02 18:01:58,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:01:58,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:01:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:01:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 18:01:58,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:01:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435112431] [2023-12-02 18:01:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435112431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:01:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:01:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:01:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290673996] [2023-12-02 18:01:58,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:01:58,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:01:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:01:58,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:01:58,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:01:58,685 INFO L87 Difference]: Start difference. First operand 488 states and 653 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 18:01:59,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:01:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:01:59,946 INFO L93 Difference]: Finished difference Result 490 states and 654 transitions. [2023-12-02 18:01:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:01:59,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-12-02 18:01:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:01:59,953 INFO L225 Difference]: With dead ends: 490 [2023-12-02 18:01:59,954 INFO L226 Difference]: Without dead ends: 487 [2023-12-02 18:01:59,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 18:01:59,956 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:01:59,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 177 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 18:01:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2023-12-02 18:01:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2023-12-02 18:01:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 324 states have (on average 1.3271604938271604) internal successors, (430), 328 states have internal predecessors, (430), 112 states have call successors, (112), 51 states have call predecessors, (112), 50 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2023-12-02 18:01:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 651 transitions. [2023-12-02 18:01:59,997 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 651 transitions. Word has length 40 [2023-12-02 18:01:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:01:59,998 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 651 transitions. [2023-12-02 18:01:59,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 18:01:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 651 transitions. [2023-12-02 18:02:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 18:02:00,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:00,001 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 18:02:00,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 18:02:00,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:02:00,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash -820861537, now seen corresponding path program 1 times [2023-12-02 18:02:00,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:00,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548222725] [2023-12-02 18:02:00,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:00,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 18:02:00,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548222725] [2023-12-02 18:02:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548222725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:02:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:02:00,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:02:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984124641] [2023-12-02 18:02:00,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:02:00,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:02:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:02:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:02:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:02:00,100 INFO L87 Difference]: Start difference. First operand 487 states and 651 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 18:02:01,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:02:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:02:01,643 INFO L93 Difference]: Finished difference Result 489 states and 652 transitions. [2023-12-02 18:02:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:02:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-12-02 18:02:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:02:01,648 INFO L225 Difference]: With dead ends: 489 [2023-12-02 18:02:01,648 INFO L226 Difference]: Without dead ends: 486 [2023-12-02 18:02:01,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 18:02:01,650 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:02:01,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 175 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 18:02:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-12-02 18:02:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2023-12-02 18:02:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 324 states have (on average 1.3240740740740742) internal successors, (429), 327 states have internal predecessors, (429), 111 states have call successors, (111), 51 states have call predecessors, (111), 50 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2023-12-02 18:02:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 649 transitions. [2023-12-02 18:02:01,691 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 649 transitions. Word has length 41 [2023-12-02 18:02:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:02:01,691 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 649 transitions. [2023-12-02 18:02:01,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 18:02:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 649 transitions. [2023-12-02 18:02:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 18:02:01,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:01,694 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 18:02:01,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 18:02:01,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:02:01,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash 323116415, now seen corresponding path program 1 times [2023-12-02 18:02:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:01,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106351917] [2023-12-02 18:02:01,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:01,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 18:02:01,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:01,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106351917] [2023-12-02 18:02:01,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106351917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:02:01,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:02:01,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:02:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598634658] [2023-12-02 18:02:01,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:02:01,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:02:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:02:01,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:02:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:02:01,778 INFO L87 Difference]: Start difference. First operand 486 states and 649 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 18:02:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:02:02,415 INFO L93 Difference]: Finished difference Result 488 states and 650 transitions. [2023-12-02 18:02:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:02:02,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2023-12-02 18:02:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:02:02,421 INFO L225 Difference]: With dead ends: 488 [2023-12-02 18:02:02,421 INFO L226 Difference]: Without dead ends: 480 [2023-12-02 18:02:02,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 18:02:02,423 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:02:02,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 174 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 18:02:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-12-02 18:02:02,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2023-12-02 18:02:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 319 states have (on average 1.3197492163009403) internal successors, (421), 321 states have internal predecessors, (421), 110 states have call successors, (110), 51 states have call predecessors, (110), 50 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2023-12-02 18:02:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 640 transitions. [2023-12-02 18:02:02,474 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 640 transitions. Word has length 42 [2023-12-02 18:02:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:02:02,474 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 640 transitions. [2023-12-02 18:02:02,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 18:02:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 640 transitions. [2023-12-02 18:02:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 18:02:02,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:02,478 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-12-02 18:02:02,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 18:02:02,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:02:02,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1788452225, now seen corresponding path program 1 times [2023-12-02 18:02:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141355682] [2023-12-02 18:02:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 18:02:02,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141355682] [2023-12-02 18:02:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141355682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:02:02,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:02:02,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:02:02,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424816615] [2023-12-02 18:02:02,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:02:02,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:02:02,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:02:02,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:02:02,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:02:02,664 INFO L87 Difference]: Start difference. First operand 480 states and 640 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-02 18:02:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:02:03,729 INFO L93 Difference]: Finished difference Result 784 states and 1044 transitions. [2023-12-02 18:02:03,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:02:03,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2023-12-02 18:02:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:02:03,733 INFO L225 Difference]: With dead ends: 784 [2023-12-02 18:02:03,733 INFO L226 Difference]: Without dead ends: 315 [2023-12-02 18:02:03,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-02 18:02:03,737 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 31 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:02:03,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 334 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 18:02:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-12-02 18:02:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 310. [2023-12-02 18:02:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 216 states have (on average 1.3333333333333333) internal successors, (288), 217 states have internal predecessors, (288), 61 states have call successors, (61), 33 states have call predecessors, (61), 32 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-02 18:02:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 409 transitions. [2023-12-02 18:02:03,760 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 409 transitions. Word has length 110 [2023-12-02 18:02:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:02:03,760 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 409 transitions. [2023-12-02 18:02:03,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-02 18:02:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 409 transitions. [2023-12-02 18:02:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 18:02:03,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:03,763 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-12-02 18:02:03,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 18:02:03,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:02:03,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1976625254, now seen corresponding path program 1 times [2023-12-02 18:02:03,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:03,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619784621] [2023-12-02 18:02:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:03,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-02 18:02:04,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619784621] [2023-12-02 18:02:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619784621] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:02:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181016339] [2023-12-02 18:02:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:04,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:02:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:02:04,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:02:04,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 18:02:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:04,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 18:02:04,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:02:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-02 18:02:04,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:02:04,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181016339] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:02:04,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:02:04,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-12-02 18:02:04,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254863458] [2023-12-02 18:02:04,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:02:04,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:02:04,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:02:04,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:02:04,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:02:04,802 INFO L87 Difference]: Start difference. First operand 310 states and 409 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-02 18:02:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:02:06,259 INFO L93 Difference]: Finished difference Result 603 states and 797 transitions. [2023-12-02 18:02:06,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:02:06,260 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2023-12-02 18:02:06,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:02:06,263 INFO L225 Difference]: With dead ends: 603 [2023-12-02 18:02:06,263 INFO L226 Difference]: Without dead ends: 317 [2023-12-02 18:02:06,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:02:06,265 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 5 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:02:06,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 515 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 18:02:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-02 18:02:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 312. [2023-12-02 18:02:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 218 states have (on average 1.3256880733944953) internal successors, (289), 219 states have internal predecessors, (289), 61 states have call successors, (61), 33 states have call predecessors, (61), 32 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-02 18:02:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 410 transitions. [2023-12-02 18:02:06,283 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 410 transitions. Word has length 116 [2023-12-02 18:02:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:02:06,284 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 410 transitions. [2023-12-02 18:02:06,284 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-02 18:02:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 410 transitions. [2023-12-02 18:02:06,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-02 18:02:06,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:06,286 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2023-12-02 18:02:06,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:02:06,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 18:02:06,492 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:02:06,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:06,492 INFO L85 PathProgramCache]: Analyzing trace with hash 819060779, now seen corresponding path program 1 times [2023-12-02 18:02:06,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:06,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465707464] [2023-12-02 18:02:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:06,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-02 18:02:06,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:06,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465707464] [2023-12-02 18:02:06,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465707464] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:02:06,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618145405] [2023-12-02 18:02:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:06,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:02:06,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:02:06,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:02:06,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 18:02:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:07,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 18:02:07,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:02:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 18:02:07,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:02:07,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618145405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:02:07,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:02:07,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 9 [2023-12-02 18:02:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759444406] [2023-12-02 18:02:07,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:02:07,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:02:07,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:02:07,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:02:07,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:02:07,432 INFO L87 Difference]: Start difference. First operand 312 states and 410 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-02 18:02:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:02:10,033 INFO L93 Difference]: Finished difference Result 618 states and 823 transitions. [2023-12-02 18:02:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:02:10,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 120 [2023-12-02 18:02:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:02:10,038 INFO L225 Difference]: With dead ends: 618 [2023-12-02 18:02:10,038 INFO L226 Difference]: Without dead ends: 332 [2023-12-02 18:02:10,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:02:10,040 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:02:10,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1041 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-02 18:02:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-12-02 18:02:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 324. [2023-12-02 18:02:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 226 states have (on average 1.3141592920353982) internal successors, (297), 227 states have internal predecessors, (297), 61 states have call successors, (61), 33 states have call predecessors, (61), 36 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2023-12-02 18:02:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 431 transitions. [2023-12-02 18:02:10,068 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 431 transitions. Word has length 120 [2023-12-02 18:02:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:02:10,069 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 431 transitions. [2023-12-02 18:02:10,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-02 18:02:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 431 transitions. [2023-12-02 18:02:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 18:02:10,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:10,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 18:02:10,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 18:02:10,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-02 18:02:10,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:02:10,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash -135029238, now seen corresponding path program 1 times [2023-12-02 18:02:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48942156] [2023-12-02 18:02:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-02 18:02:10,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:10,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48942156] [2023-12-02 18:02:10,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48942156] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:02:10,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970549621] [2023-12-02 18:02:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:10,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:02:10,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:02:10,851 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:02:10,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 18:02:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:11,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 18:02:11,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:02:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-02 18:02:11,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:02:11,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970549621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:02:11,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:02:11,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2023-12-02 18:02:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023443020] [2023-12-02 18:02:11,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:02:11,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:02:11,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:02:11,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:02:11,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:02:11,355 INFO L87 Difference]: Start difference. First operand 324 states and 431 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-02 18:02:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:02:13,109 INFO L93 Difference]: Finished difference Result 632 states and 848 transitions. [2023-12-02 18:02:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:02:13,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2023-12-02 18:02:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:02:13,112 INFO L225 Difference]: With dead ends: 632 [2023-12-02 18:02:13,112 INFO L226 Difference]: Without dead ends: 334 [2023-12-02 18:02:13,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:02:13,113 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:02:13,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 679 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:02:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-02 18:02:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 328. [2023-12-02 18:02:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 230 states have (on average 1.308695652173913) internal successors, (301), 229 states have internal predecessors, (301), 61 states have call successors, (61), 33 states have call predecessors, (61), 36 states have return successors, (73), 65 states have call predecessors, (73), 60 states have call successors, (73) [2023-12-02 18:02:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 435 transitions. [2023-12-02 18:02:13,136 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 435 transitions. Word has length 124 [2023-12-02 18:02:13,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:02:13,136 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 435 transitions. [2023-12-02 18:02:13,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-02 18:02:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 435 transitions. [2023-12-02 18:02:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-02 18:02:13,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:13,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 18:02:13,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 18:02:13,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-02 18:02:13,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:02:13,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1197330711, now seen corresponding path program 2 times [2023-12-02 18:02:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057076555] [2023-12-02 18:02:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-02 18:02:14,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:14,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057076555] [2023-12-02 18:02:14,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057076555] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:02:14,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297291585] [2023-12-02 18:02:14,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:02:14,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:02:14,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:02:14,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:02:14,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 18:02:14,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 18:02:14,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:02:14,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 18:02:14,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:02:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-02 18:02:14,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:02:14,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297291585] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:02:14,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:02:14,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-12-02 18:02:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146632048] [2023-12-02 18:02:14,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:02:14,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:02:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:02:14,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:02:14,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:02:14,968 INFO L87 Difference]: Start difference. First operand 328 states and 435 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-02 18:02:17,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 18:02:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:02:17,511 INFO L93 Difference]: Finished difference Result 465 states and 616 transitions. [2023-12-02 18:02:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:02:17,512 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-02 18:02:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:02:17,516 INFO L225 Difference]: With dead ends: 465 [2023-12-02 18:02:17,516 INFO L226 Difference]: Without dead ends: 458 [2023-12-02 18:02:17,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:02:17,517 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 55 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:02:17,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 458 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 18:02:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-12-02 18:02:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2023-12-02 18:02:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 322 states have (on average 1.3043478260869565) internal successors, (420), 320 states have internal predecessors, (420), 84 states have call successors, (84), 46 states have call predecessors, (84), 51 states have return successors, (102), 91 states have call predecessors, (102), 83 states have call successors, (102) [2023-12-02 18:02:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 606 transitions. [2023-12-02 18:02:17,555 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 606 transitions. Word has length 128 [2023-12-02 18:02:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:02:17,556 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 606 transitions. [2023-12-02 18:02:17,556 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-02 18:02:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 606 transitions. [2023-12-02 18:02:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 18:02:17,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:17,559 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 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] [2023-12-02 18:02:17,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 18:02:17,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 18:02:17,760 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:02:17,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -639724839, now seen corresponding path program 1 times [2023-12-02 18:02:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:17,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506720740] [2023-12-02 18:02:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:17,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-12-02 18:02:18,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506720740] [2023-12-02 18:02:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506720740] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:02:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460567423] [2023-12-02 18:02:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:18,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:02:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:02:18,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:02:18,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 18:02:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:18,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:02:18,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:02:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-02 18:02:19,037 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:02:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460567423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:02:19,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:02:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 18:02:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392387460] [2023-12-02 18:02:19,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:02:19,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:02:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:02:19,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:02:19,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:02:19,039 INFO L87 Difference]: Start difference. First operand 458 states and 606 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-02 18:02:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:02:22,821 INFO L93 Difference]: Finished difference Result 1166 states and 1569 transitions. [2023-12-02 18:02:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:02:22,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 144 [2023-12-02 18:02:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:02:22,829 INFO L225 Difference]: With dead ends: 1166 [2023-12-02 18:02:22,829 INFO L226 Difference]: Without dead ends: 1161 [2023-12-02 18:02:22,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:02:22,830 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 421 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:02:22,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 811 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-02 18:02:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2023-12-02 18:02:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1049. [2023-12-02 18:02:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 732 states have (on average 1.3155737704918034) internal successors, (963), 731 states have internal predecessors, (963), 199 states have call successors, (199), 104 states have call predecessors, (199), 117 states have return successors, (243), 213 states have call predecessors, (243), 198 states have call successors, (243) [2023-12-02 18:02:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1405 transitions. [2023-12-02 18:02:22,889 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1405 transitions. Word has length 144 [2023-12-02 18:02:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:02:22,889 INFO L495 AbstractCegarLoop]: Abstraction has 1049 states and 1405 transitions. [2023-12-02 18:02:22,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-02 18:02:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1405 transitions. [2023-12-02 18:02:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-02 18:02:22,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:02:22,892 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 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] [2023-12-02 18:02:22,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 18:02:23,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 18:02:23,093 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:02:23,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:02:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash -754593653, now seen corresponding path program 1 times [2023-12-02 18:02:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:02:23,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28938425] [2023-12-02 18:02:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:02:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-02 18:02:24,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:02:24,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28938425] [2023-12-02 18:02:24,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28938425] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:02:24,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701998844] [2023-12-02 18:02:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:02:24,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:02:24,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:02:24,072 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:02:24,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b503ba2-581d-4da1-b561-965795b82e72/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 18:02:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:02:24,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 123 conjunts are in the unsatisfiable core [2023-12-02 18:02:24,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:02:24,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:02:24,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-02 18:02:25,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 3 [2023-12-02 18:02:41,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 3 [2023-12-02 18:02:41,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 18:02:41,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:02:41,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 18:02:41,642 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-12-02 18:02:41,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-12-02 18:02:42,050 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:42,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:02:42,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:02:44,482 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-12-02 18:02:44,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2023-12-02 18:02:53,331 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:53,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:02:58,556 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:02:58,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 18:03:03,162 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 18:03:03,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 18:03:07,607 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:03:07,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2023-12-02 18:03:09,772 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:03:09,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2023-12-02 18:03:09,802 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:03:09,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2023-12-02 18:03:12,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:03:12,109 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 18:03:12,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2023-12-02 18:03:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 18:03:12,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:03:14,222 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_619 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2023-12-02 18:03:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701998844] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:03:14,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [306456351] [2023-12-02 18:03:14,253 INFO L159 IcfgInterpreter]: Started Sifa with 102 locations of interest [2023-12-02 18:03:14,253 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:03:14,256 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:03:14,260 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:03:14,261 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:03:46,506 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:03:46,910 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:04:09,694 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:04:10,148 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:04:37,336 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:04:38,121 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:05:06,576 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:05:07,011 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:05:30,071 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:05:30,518 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:05:51,420 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:05:51,868 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 18:06:38,911 INFO L197 IcfgInterpreter]: Interpreting procedure ldv__builtin_expect with input of size 139 for LOIs [2023-12-02 18:06:39,091 INFO L197 IcfgInterpreter]: Interpreting procedure usb_free_coherent with input of size 220 for LOIs [2023-12-02 18:06:39,166 INFO L197 IcfgInterpreter]: Interpreting procedure kzalloc with input of size 82 for LOIs [2023-12-02 18:06:39,915 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_error with input of size 12 for LOIs [2023-12-02 18:06:39,917 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 102 for LOIs [2023-12-02 18:06:40,735 INFO L197 IcfgInterpreter]: Interpreting procedure strlcat with input of size 274 for LOIs [2023-12-02 18:06:40,993 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_undef_int with input of size 82 for LOIs [2023-12-02 18:06:41,007 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_init_zalloc with input of size 495 for LOIs [2023-12-02 18:06:49,322 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.meminit with input of size 520 for LOIs [2023-12-02 18:06:50,331 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2023-12-02 18:06:50,333 INFO L197 IcfgInterpreter]: Interpreting procedure printk with input of size 742 for LOIs [2023-12-02 18:06:51,516 INFO L197 IcfgInterpreter]: Interpreting procedure kfree with input of size 206 for LOIs [2023-12-02 18:06:51,573 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:07:04,270 WARN L293 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 495 DAG size of output: 495 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:07:11,134 WARN L293 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 516 DAG size of output: 516 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:07:18,361 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 520 DAG size of output: 520 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:07:25,539 WARN L293 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 522 DAG size of output: 522 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:07:32,984 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 711 DAG size of output: 709 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:07:46,400 WARN L293 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 768 DAG size of output: 754 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:07:54,962 WARN L293 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 763 DAG size of output: 754 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:08:03,279 WARN L293 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 742 DAG size of output: 738 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:08:12,056 WARN L293 SmtUtils]: Spent 7.05s on a formula simplification. DAG size of input: 742 DAG size of output: 738 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 18:09:54,847 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~bulk_urb~0.base 0) (= c_~bulk_urb~0.offset 0) (= |c_ULTIMATE.start_usb_endpoint_is_int_in_#res#1| 1) (= c_~LDV_IN_INTERRUPT~0 1) (= c_~__mod_usb_device_table~0.bInterfaceProtocol 0) (= 0 |c_ULTIMATE.start_main_~tmp___0~6#1|) (= 0 c_~INTERF_STATE~0) (= |c_ULTIMATE.start_usb_endpoint_dir_in_#res#1| 1) (= |c_ULTIMATE.start_main_~tmp___1~3#1| 0) (= 3 c_~ldv_state_variable_0~0) (= |c_ULTIMATE.start_ldv_usb_register_driver_2_#res#1| 0) (= |c_ULTIMATE.start_usb_endpoint_xfer_int_#res#1| 1) (exists ((|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int))) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_94| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_91| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_93| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_94| (Array Int (Array Int Int))) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_196| (Array Int (Array Int Int))) (|v_#memory_int_232| (Array Int (Array Int Int))) (|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int))) (|v_#memory_int_233| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_int_150| (Array Int (Array Int Int)))) (let ((.cse42 (select |v_#memory_$Pointer$.offset_196| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse41 (select |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse43 (+ |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset| 208)) (.cse15 (+ 192 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|)) (.cse54 (+ 200 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|))) (let ((.cse12 (select |v_#memory_int_101| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse40 (select |v_#memory_int_231| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse14 (select |v_#memory_int_232| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse18 (select |v_#memory_int_100| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse11 (select |v_#memory_$Pointer$.base_91| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse16 (select |v_#memory_int_150| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse2 (select |v_#memory_$Pointer$.offset_90| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| 802)) (.cse8 (+ |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| 540)) (.cse9 (+ 548 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse6 (select |v_#memory_$Pointer$.base_90| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse1 (+ 30 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse17 (select |v_#memory_int_105| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse49 (select |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse48 (+ 26 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse59 (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse0 (select |v_#memory_$Pointer$.offset_94| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse52 (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse56 (select |v_#memory_$Pointer$.base_94| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse46 (+ 28 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse5 (store |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (store (store .cse41 .cse43 |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.base|) .cse15 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) .cse54 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|))) (.cse51 (select |v_#memory_$Pointer$.base_93| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse3 (store |v_#memory_$Pointer$.offset_196| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (store (store .cse42 .cse43 |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.offset|) .cse15 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset|) .cse54 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|))) (.cse57 (+ 8 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse58 (select |v_#memory_$Pointer$.offset_93| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse50 (+ |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| 24)) (.cse13 (select |v_#memory_int_102| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse10 (+ 32 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse55 (select |v_#memory_$Pointer$.offset_91| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse53 (+ |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| 80))) (and (= (store |v_#memory_$Pointer$.offset_94| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse0 .cse1 (select .cse2 .cse1))) |v_#memory_$Pointer$.offset_90|) (= (mod (let ((.cse4 (+ |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset| 1464))) (+ (select (select .cse3 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) .cse4) (select (select .cse5 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) .cse4))) 18446744073709551616) 0) (= (store |v_#memory_$Pointer$.base_90| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store (store (store .cse6 .cse7 |c_ULTIMATE.start_usb_acecad_probe_~intf#1.base|) .cse8 |#funAddr~usb_acecad_open.base|) .cse9 |#funAddr~usb_acecad_close.base|) .cse10 (select .cse11 .cse10))) |v_#memory_$Pointer$.base_91|) (= (store |v_#memory_int_101| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse12 .cse9 (select .cse13 .cse9))) |v_#memory_int_102|) (= (store |v_#memory_int_232| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store .cse14 .cse15 (select .cse16 .cse15))) |v_#memory_int_150|) (= (store |v_#memory_int_233| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (select |v_#memory_int_233| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| (select .cse17 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|))) |v_#memory_int_105|) (= (store |v_#memory_int_100| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse18 .cse8 (select .cse12 .cse8))) |v_#memory_int_101|) (let ((.cse39 (+ 216 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|))) (let ((.cse19 (= |c_ULTIMATE.start_usb_acecad_probe_~tmp___4~0#1.offset| |c_ULTIMATE.start_usb_alloc_coherent_#res#1.offset|)) (.cse20 (= |c_ULTIMATE.start_usb_acecad_probe_~tmp___4~0#1.base| |c_ULTIMATE.start_usb_alloc_coherent_#res#1.base|)) (.cse21 (exists ((|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse39 |c_ULTIMATE.start_usb_acecad_probe_~tmp___4~0#1.base|)) |v_#memory_$Pointer$.base_196|))) (.cse22 (not (= (mod (+ (select .cse41 .cse39) (select .cse42 .cse39)) 18446744073709551616) 0))) (.cse31 (exists ((|v_#memory_int_230| (Array Int (Array Int Int)))) (= (store |v_#memory_int_230| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (select |v_#memory_int_230| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse39 (select .cse40 .cse39))) |v_#memory_int_231|))) (.cse29 (= 0 |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|)) (.cse24 (= |c_ULTIMATE.start_usb_alloc_urb_#res#1.offset| 0)) (.cse32 (exists ((|v_#memory_$Pointer$.offset_195| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_196| (store |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (select |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse39 |c_ULTIMATE.start_usb_acecad_probe_~tmp___4~0#1.offset|)))))) (or (and .cse19 .cse20 .cse21 .cse22 (exists ((v_ldv_malloc_~p~0.base_BEFORE_RETURN_48 Int) (v_ldv_malloc_~size_BEFORE_RETURN_48 Int) (v_ldv_malloc_~p~0.offset_BEFORE_RETURN_48 Int) (v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_48 Int) (v_ldv_malloc_~tmp~4.offset_BEFORE_RETURN_48 Int) (v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 Int)) (let ((.cse28 (<= 0 (+ v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_48 2147483648))) (.cse30 (<= v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_48 2147483647)) (.cse25 (= v_ldv_malloc_~p~0.offset_BEFORE_RETURN_48 0)) (.cse26 (= v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_48 0)) (.cse27 (= v_ldv_malloc_~tmp~4.offset_BEFORE_RETURN_48 0))) (and (let ((.cse23 (= 180 v_ldv_malloc_~size_BEFORE_RETURN_48))) (or (and .cse23 (= v_ldv_malloc_~p~0.base_BEFORE_RETURN_48 |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|) (= v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 v_ldv_malloc_~p~0.base_BEFORE_RETURN_48) (exists ((|v_#valid_53| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_53| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 1)) (= (select |v_#valid_53| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48) 0))) .cse24 (not (= (mod v_ldv_malloc_~p~0.base_BEFORE_RETURN_48 18446744073709551616) 0)) .cse25 .cse26 .cse27 (<= (+ v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 1) |c_#StackHeapBarrier|) (exists ((|v_#length_29| (Array Int Int))) (= (store |v_#length_29| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 180) |c_#length|)) (not (= v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 0))) (and .cse23 .cse28 (not .cse26) .cse24 .cse29 .cse30))) (or (and .cse28 .cse24 .cse29 .cse30) (and .cse24 .cse25 .cse26 .cse27))))) .cse31 .cse32) (and .cse19 .cse20 .cse21 .cse22 .cse31 (exists ((v_ldv_malloc_~p~0.base_BEFORE_RETURN_47 Int) (v_ldv_malloc_~p~0.offset_BEFORE_RETURN_47 Int) (v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_47 Int) (v_ldv_malloc_~size_BEFORE_RETURN_47 Int) (v_ldv_malloc_~tmp~4.offset_BEFORE_RETURN_47 Int) (v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 Int)) (let ((.cse37 (<= v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_47 2147483647)) (.cse38 (<= 0 (+ v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_47 2147483648))) (.cse33 (= v_ldv_malloc_~p~0.offset_BEFORE_RETURN_47 0)) (.cse34 (= v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_47 0)) (.cse36 (= v_ldv_malloc_~tmp~4.offset_BEFORE_RETURN_47 0))) (and (let ((.cse35 (= 180 v_ldv_malloc_~size_BEFORE_RETURN_47))) (or (and (exists ((|v_#valid_53| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_53| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 1)) (= (select |v_#valid_53| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47) 0))) .cse24 (not (= v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 0)) .cse33 (exists ((|v_#length_29| (Array Int Int))) (= (store |v_#length_29| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 180) |c_#length|)) .cse34 .cse35 (not (= (mod v_ldv_malloc_~p~0.base_BEFORE_RETURN_47 18446744073709551616) 0)) (= v_ldv_malloc_~p~0.base_BEFORE_RETURN_47 |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|) (= v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 v_ldv_malloc_~p~0.base_BEFORE_RETURN_47) (<= (+ v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 1) |c_#StackHeapBarrier|) .cse36) (and .cse24 .cse37 .cse29 .cse35 .cse38 (not .cse34)))) (or (and .cse24 .cse37 .cse29 .cse38) (and .cse24 .cse33 .cse34 .cse36))))) .cse32)))) (= |v_#memory_int_232| (store |v_#memory_int_231| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store .cse40 .cse43 (select .cse14 .cse43)))) (= (store |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (let ((.cse44 (let ((.cse45 (let ((.cse47 (store .cse49 .cse50 3))) (store .cse47 .cse48 (select (select (store |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| .cse47) |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) (+ |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset| 1160)))))) (store .cse45 .cse46 (select (select (store |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| .cse45) |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) (+ 1162 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset|)))))) (store .cse44 .cse1 (select (select (store |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| .cse44) |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) (+ 1164 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset|)))) .cse7 (select .cse18 .cse7))) |v_#memory_int_100|) (= |v_#memory_$Pointer$.base_95| (store |v_#memory_$Pointer$.base_93| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse51 .cse48 (select .cse52 .cse48)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_91| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse11 .cse53 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) .cse53)))) (= (store |v_#memory_int_150| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store .cse16 .cse54 (select (select |v_#memory_int_233| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse54))) |v_#memory_int_233|) (= (store |v_#memory_$Pointer$.offset_90| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store (store (store .cse2 .cse7 44) .cse8 |#funAddr~usb_acecad_open.offset|) .cse9 |#funAddr~usb_acecad_close.offset|) .cse10 (select .cse55 .cse10))) |v_#memory_$Pointer$.offset_91|) (= (store |v_#memory_$Pointer$.base_94| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse56 .cse1 (select .cse6 .cse1))) |v_#memory_$Pointer$.base_90|) (= (store |v_#memory_int_105| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse17 .cse57 (select .cse49 .cse57))) |v_#memory_int_104|) (= |v_#memory_$Pointer$.offset_95| (store |v_#memory_$Pointer$.offset_93| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse58 .cse48 (select .cse59 .cse48)))) (= (store |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse59 .cse46 (select .cse0 .cse46))) |v_#memory_$Pointer$.offset_94|) (= |v_#memory_$Pointer$.base_94| (store |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse52 .cse46 (select .cse56 .cse46)))) (= |v_#memory_$Pointer$.base_93| (store .cse5 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store (store (select .cse5 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse57 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse50 (select .cse51 .cse50)))) (= (store .cse3 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store (store (select .cse3 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|) .cse57 (+ 128 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|)) .cse50 (select .cse58 .cse50))) |v_#memory_$Pointer$.offset_93|) (= |c_#memory_int| (store |v_#memory_int_102| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store .cse13 .cse10 10) .cse53 7169))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_91| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse55 .cse53 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) .cse53)))))))) (= c_~__mod_usb_device_table~0.idVendor 0) (= c_~__mod_usb_device_table~0.driver_info 0) (= |c_ULTIMATE.start_usb_acecad_init_#res#1| 0) (= c_~completeFnBulk~0.base 0) (<= 0 (+ |c_ULTIMATE.start_usb_make_path_#res#1| 2147483648)) (= |c_~#usb_acecad_id_table~0.base| 11) (= |c_ULTIMATE.start_usb_register_#res#1| 0) (= c_~__mod_usb_device_table~0.bInterfaceSubClass 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_usb_acecad_probe_~tmp___0~5#1| 1) (= c_~usb_acecad_driver_group1~0.offset 0) (= c_~__mod_usb_device_table~0.bDeviceProtocol 0) (= |c_ULTIMATE.start_main_~tmp~17#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) 16) |c_ULTIMATE.start_usb_acecad_probe_#t~mem155#1|) (= |c_~#usb_acecad_driver~0.base| 12) (= c_~SERIAL_STATE~0 0) (= |c_ULTIMATE.start_main_~tmp___2~1#1| 1) (= c_~DEV_STATE~0 0) (= c_~completeFnBulk~0.offset 0) (= c_~usb_intfdata~0.base 0) (= c_~__mod_usb_device_table~0.idProduct 0) (= |c_ULTIMATE.start_usb_alloc_urb_#res#1.offset| |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.offset|) (= |c_ULTIMATE.start_usb_acecad_probe_#in~intf#1.offset| 0) (let ((.cse60 (= |c_ULTIMATE.start_usb_acecad_probe_#t~mem155#1| 0))) (or (and (not |c_ULTIMATE.start_usb_acecad_probe_#t~switch156#1|) (not .cse60)) (and .cse60 |c_ULTIMATE.start_usb_acecad_probe_#t~switch156#1|))) (= |c_ULTIMATE.start_usb_acecad_probe_#in~id#1.offset| 0) (= c_~usb_counter~0 0) (= c_~usb_intfdata~0.offset 0) (= c_~ldv_state_variable_1~0 1) (= 0 c_~__mod_usb_device_table~0.bDeviceClass) (= c_~__mod_usb_device_table~0.match_flags 0) (= c_~__mod_usb_device_table~0.bcdDevice_lo 0) (= c_~__mod_usb_device_table~0.bInterfaceClass 0) (= c_~ref_cnt~0 0) (= |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.base| |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|) (= |c_ULTIMATE.start_usb_acecad_probe_~intf#1.offset| 0) (not (= (mod (+ |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.base| |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.offset|) 18446744073709551616) 0)) (= c_~ldv_retval_1~0 0) (<= 1 c_~URB_STATE~0) (= |c_~#usb_acecad_driver~0.offset| 0) (= |c_ULTIMATE.start_usb_register_driver_#res#1| 0) (= |c_~#usb_acecad_id_table~0.offset| 0) (= |c_ULTIMATE.start_main_~ldvarg0~0#1.offset| 0) (<= |c_ULTIMATE.start_usb_make_path_#res#1| 63) (= |c_ULTIMATE.start_usb_acecad_probe_~id#1.offset| 0) (= c_~__mod_usb_device_table~0.bDeviceSubClass 0) (= 0 c_~__mod_usb_device_table~0.bcdDevice_hi)) is different from false [2023-12-02 18:09:56,877 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~bulk_urb~0.base 0) (= c_~bulk_urb~0.offset 0) (= |c_ULTIMATE.start_usb_endpoint_is_int_in_#res#1| 1) (= c_~LDV_IN_INTERRUPT~0 1) (= c_~__mod_usb_device_table~0.bInterfaceProtocol 0) (= 0 |c_ULTIMATE.start_main_~tmp___0~6#1|) (= 0 c_~INTERF_STATE~0) (= |c_ULTIMATE.start_usb_endpoint_dir_in_#res#1| 1) (= |c_ULTIMATE.start_main_~tmp___1~3#1| 0) (= 3 c_~ldv_state_variable_0~0) (= |c_ULTIMATE.start_ldv_usb_register_driver_2_#res#1| 0) (= |c_ULTIMATE.start_usb_endpoint_xfer_int_#res#1| 1) (= c_~__mod_usb_device_table~0.idVendor 0) (= c_~__mod_usb_device_table~0.driver_info 0) (= |c_ULTIMATE.start_usb_acecad_init_#res#1| 0) (= c_~completeFnBulk~0.base 0) (exists ((|v_#memory_$Pointer$.base_93| (Array Int (Array Int Int))) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_94| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_91| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_93| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_196| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_95| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_94| (Array Int (Array Int Int))) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_196| (Array Int (Array Int Int))) (|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_232| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int))) (|v_#memory_int_233| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int))) (|v_#memory_int_150| (Array Int (Array Int Int)))) (let ((.cse42 (select |v_#memory_$Pointer$.offset_196| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse41 (select |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse43 (+ |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset| 208)) (.cse15 (+ 192 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|)) (.cse54 (+ 200 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|))) (let ((.cse12 (select |v_#memory_int_101| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse40 (select |v_#memory_int_231| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse14 (select |v_#memory_int_232| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse18 (select |v_#memory_int_100| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse11 (select |v_#memory_$Pointer$.base_91| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse16 (select |v_#memory_int_150| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|)) (.cse2 (select |v_#memory_$Pointer$.offset_90| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| 802)) (.cse8 (+ |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| 540)) (.cse9 (+ 548 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse6 (select |v_#memory_$Pointer$.base_90| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse1 (+ 30 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse17 (select |v_#memory_int_105| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse49 (select |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse48 (+ 26 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse59 (select |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse0 (select |v_#memory_$Pointer$.offset_94| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse52 (select |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse56 (select |v_#memory_$Pointer$.base_94| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse46 (+ 28 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse5 (store |v_#memory_$Pointer$.base_196| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (store (store .cse41 .cse43 |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.base|) .cse15 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) .cse54 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|))) (.cse51 (select |v_#memory_$Pointer$.base_93| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse3 (store |v_#memory_$Pointer$.offset_196| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (store (store .cse42 .cse43 |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.offset|) .cse15 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset|) .cse54 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|))) (.cse57 (+ 8 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse58 (select |v_#memory_$Pointer$.offset_93| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse50 (+ |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| 24)) (.cse13 (select |v_#memory_int_102| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse10 (+ 32 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|)) (.cse55 (select |v_#memory_$Pointer$.offset_91| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|)) (.cse53 (+ |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| 80))) (and (= (store |v_#memory_$Pointer$.offset_94| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse0 .cse1 (select .cse2 .cse1))) |v_#memory_$Pointer$.offset_90|) (= (mod (let ((.cse4 (+ |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset| 1464))) (+ (select (select .cse3 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) .cse4) (select (select .cse5 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) .cse4))) 18446744073709551616) 0) (= (store |v_#memory_$Pointer$.base_90| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store (store (store .cse6 .cse7 |c_ULTIMATE.start_usb_acecad_probe_~intf#1.base|) .cse8 |#funAddr~usb_acecad_open.base|) .cse9 |#funAddr~usb_acecad_close.base|) .cse10 (select .cse11 .cse10))) |v_#memory_$Pointer$.base_91|) (= (store |v_#memory_int_101| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse12 .cse9 (select .cse13 .cse9))) |v_#memory_int_102|) (= (store |v_#memory_int_232| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store .cse14 .cse15 (select .cse16 .cse15))) |v_#memory_int_150|) (= (store |v_#memory_int_233| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (select |v_#memory_int_233| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| (select .cse17 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset|))) |v_#memory_int_105|) (= (store |v_#memory_int_100| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse18 .cse8 (select .cse12 .cse8))) |v_#memory_int_101|) (let ((.cse39 (+ 216 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|))) (let ((.cse19 (= |c_ULTIMATE.start_usb_acecad_probe_~tmp___4~0#1.offset| |c_ULTIMATE.start_usb_alloc_coherent_#res#1.offset|)) (.cse20 (= |c_ULTIMATE.start_usb_acecad_probe_~tmp___4~0#1.base| |c_ULTIMATE.start_usb_alloc_coherent_#res#1.base|)) (.cse21 (exists ((|v_#memory_$Pointer$.base_195| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (select |v_#memory_$Pointer$.base_195| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse39 |c_ULTIMATE.start_usb_acecad_probe_~tmp___4~0#1.base|)) |v_#memory_$Pointer$.base_196|))) (.cse22 (not (= (mod (+ (select .cse41 .cse39) (select .cse42 .cse39)) 18446744073709551616) 0))) (.cse31 (exists ((|v_#memory_int_230| (Array Int (Array Int Int)))) (= (store |v_#memory_int_230| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (select |v_#memory_int_230| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse39 (select .cse40 .cse39))) |v_#memory_int_231|))) (.cse29 (= 0 |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|)) (.cse24 (= |c_ULTIMATE.start_usb_alloc_urb_#res#1.offset| 0)) (.cse32 (exists ((|v_#memory_$Pointer$.offset_195| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_196| (store |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store (select |v_#memory_$Pointer$.offset_195| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse39 |c_ULTIMATE.start_usb_acecad_probe_~tmp___4~0#1.offset|)))))) (or (and .cse19 .cse20 .cse21 .cse22 (exists ((v_ldv_malloc_~p~0.base_BEFORE_RETURN_48 Int) (v_ldv_malloc_~size_BEFORE_RETURN_48 Int) (v_ldv_malloc_~p~0.offset_BEFORE_RETURN_48 Int) (v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_48 Int) (v_ldv_malloc_~tmp~4.offset_BEFORE_RETURN_48 Int) (v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 Int)) (let ((.cse28 (<= 0 (+ v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_48 2147483648))) (.cse30 (<= v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_48 2147483647)) (.cse25 (= v_ldv_malloc_~p~0.offset_BEFORE_RETURN_48 0)) (.cse26 (= v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_48 0)) (.cse27 (= v_ldv_malloc_~tmp~4.offset_BEFORE_RETURN_48 0))) (and (let ((.cse23 (= 180 v_ldv_malloc_~size_BEFORE_RETURN_48))) (or (and .cse23 (= v_ldv_malloc_~p~0.base_BEFORE_RETURN_48 |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|) (= v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 v_ldv_malloc_~p~0.base_BEFORE_RETURN_48) (exists ((|v_#valid_53| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_53| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 1)) (= (select |v_#valid_53| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48) 0))) .cse24 (not (= (mod v_ldv_malloc_~p~0.base_BEFORE_RETURN_48 18446744073709551616) 0)) .cse25 .cse26 .cse27 (<= (+ v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 1) |c_#StackHeapBarrier|) (exists ((|v_#length_29| (Array Int Int))) (= (store |v_#length_29| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 180) |c_#length|)) (not (= v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_48 0))) (and .cse23 .cse28 (not .cse26) .cse24 .cse29 .cse30))) (or (and .cse28 .cse24 .cse29 .cse30) (and .cse24 .cse25 .cse26 .cse27))))) .cse31 .cse32) (and .cse19 .cse20 .cse21 .cse22 .cse31 (exists ((v_ldv_malloc_~p~0.base_BEFORE_RETURN_47 Int) (v_ldv_malloc_~p~0.offset_BEFORE_RETURN_47 Int) (v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_47 Int) (v_ldv_malloc_~size_BEFORE_RETURN_47 Int) (v_ldv_malloc_~tmp~4.offset_BEFORE_RETURN_47 Int) (v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 Int)) (let ((.cse37 (<= v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_47 2147483647)) (.cse38 (<= 0 (+ v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_47 2147483648))) (.cse33 (= v_ldv_malloc_~p~0.offset_BEFORE_RETURN_47 0)) (.cse34 (= v_ldv_malloc_~tmp___0~2_BEFORE_RETURN_47 0)) (.cse36 (= v_ldv_malloc_~tmp~4.offset_BEFORE_RETURN_47 0))) (and (let ((.cse35 (= 180 v_ldv_malloc_~size_BEFORE_RETURN_47))) (or (and (exists ((|v_#valid_53| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_53| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 1)) (= (select |v_#valid_53| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47) 0))) .cse24 (not (= v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 0)) .cse33 (exists ((|v_#length_29| (Array Int Int))) (= (store |v_#length_29| v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 180) |c_#length|)) .cse34 .cse35 (not (= (mod v_ldv_malloc_~p~0.base_BEFORE_RETURN_47 18446744073709551616) 0)) (= v_ldv_malloc_~p~0.base_BEFORE_RETURN_47 |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|) (= v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 v_ldv_malloc_~p~0.base_BEFORE_RETURN_47) (<= (+ v_ldv_malloc_~tmp~4.base_BEFORE_RETURN_47 1) |c_#StackHeapBarrier|) .cse36) (and .cse24 .cse37 .cse29 .cse35 .cse38 (not .cse34)))) (or (and .cse24 .cse37 .cse29 .cse38) (and .cse24 .cse33 .cse34 .cse36))))) .cse32)))) (= |v_#memory_int_232| (store |v_#memory_int_231| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store .cse40 .cse43 (select .cse14 .cse43)))) (= (store |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (let ((.cse44 (let ((.cse45 (let ((.cse47 (store .cse49 .cse50 3))) (store .cse47 .cse48 (select (select (store |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| .cse47) |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) (+ |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset| 1160)))))) (store .cse45 .cse46 (select (select (store |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| .cse45) |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) (+ 1162 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset|)))))) (store .cse44 .cse1 (select (select (store |v_#memory_int_104| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| .cse44) |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.base|) (+ 1164 |c_ULTIMATE.start_usb_acecad_probe_~dev~1#1.offset|)))) .cse7 (select .cse18 .cse7))) |v_#memory_int_100|) (= |v_#memory_$Pointer$.base_95| (store |v_#memory_$Pointer$.base_93| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse51 .cse48 (select .cse52 .cse48)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_91| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse11 .cse53 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) .cse53)))) (= (store |v_#memory_int_150| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base| (store .cse16 .cse54 (select (select |v_#memory_int_233| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse54))) |v_#memory_int_233|) (= (store |v_#memory_$Pointer$.offset_90| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store (store (store .cse2 .cse7 44) .cse8 |#funAddr~usb_acecad_open.offset|) .cse9 |#funAddr~usb_acecad_close.offset|) .cse10 (select .cse55 .cse10))) |v_#memory_$Pointer$.offset_91|) (= (store |v_#memory_$Pointer$.base_94| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse56 .cse1 (select .cse6 .cse1))) |v_#memory_$Pointer$.base_90|) (= (store |v_#memory_int_105| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse17 .cse57 (select .cse49 .cse57))) |v_#memory_int_104|) (= |v_#memory_$Pointer$.offset_95| (store |v_#memory_$Pointer$.offset_93| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse58 .cse48 (select .cse59 .cse48)))) (= (store |v_#memory_$Pointer$.offset_95| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse59 .cse46 (select .cse0 .cse46))) |v_#memory_$Pointer$.offset_94|) (= |v_#memory_$Pointer$.base_94| (store |v_#memory_$Pointer$.base_95| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse52 .cse46 (select .cse56 .cse46)))) (= |v_#memory_$Pointer$.base_93| (store .cse5 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store (store (select .cse5 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse57 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.base|) .cse50 (select .cse51 .cse50)))) (= (store .cse3 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store (store (select .cse3 |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.offset| |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|) .cse57 (+ 128 |c_ULTIMATE.start_usb_acecad_probe_~acecad~3#1.offset|)) .cse50 (select .cse58 .cse50))) |v_#memory_$Pointer$.offset_93|) (= |c_#memory_int| (store |v_#memory_int_102| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store (store .cse13 .cse10 10) .cse53 7169))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_91| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| (store .cse55 .cse53 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base|) .cse53)))))))) (<= 0 (+ |c_ULTIMATE.start_usb_make_path_#res#1| 2147483648)) (= |c_~#usb_acecad_id_table~0.base| 11) (= |c_ULTIMATE.start_usb_register_#res#1| 0) (= c_~__mod_usb_device_table~0.bInterfaceSubClass 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_usb_acecad_probe_~tmp___0~5#1| 1) (= c_~usb_acecad_driver_group1~0.offset 0) (= c_~__mod_usb_device_table~0.bDeviceProtocol 0) (= |c_ULTIMATE.start_main_~tmp~17#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) 16) |c_ULTIMATE.start_usb_acecad_probe_#t~mem155#1|) (= |c_~#usb_acecad_driver~0.base| 12) (= c_~SERIAL_STATE~0 0) (= |c_ULTIMATE.start_main_~tmp___2~1#1| 1) (= c_~DEV_STATE~0 0) (= c_~completeFnBulk~0.offset 0) (= c_~usb_intfdata~0.base 0) (= c_~__mod_usb_device_table~0.idProduct 0) (= |c_ULTIMATE.start_usb_alloc_urb_#res#1.offset| |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.offset|) (= |c_ULTIMATE.start_usb_acecad_probe_#in~intf#1.offset| 0) (= |c_ULTIMATE.start_usb_acecad_probe_#in~id#1.offset| 0) (= c_~usb_counter~0 0) (= c_~usb_intfdata~0.offset 0) (= c_~ldv_state_variable_1~0 1) (= 0 c_~__mod_usb_device_table~0.bDeviceClass) (= c_~__mod_usb_device_table~0.match_flags 0) (= c_~__mod_usb_device_table~0.bcdDevice_lo 0) (= c_~__mod_usb_device_table~0.bInterfaceClass 0) (= c_~ref_cnt~0 0) (let ((.cse60 (= |c_ULTIMATE.start_usb_acecad_probe_#t~mem155#1| 1))) (or (and |c_ULTIMATE.start_usb_acecad_probe_#t~switch156#1| .cse60) (and (not .cse60) (not |c_ULTIMATE.start_usb_acecad_probe_#t~switch156#1|)))) (= |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.base| |c_ULTIMATE.start_usb_alloc_urb_#res#1.base|) (= |c_ULTIMATE.start_usb_acecad_probe_~intf#1.offset| 0) (not (= (mod (+ |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.base| |c_ULTIMATE.start_ldv_usb_alloc_urb_5_#res#1.offset|) 18446744073709551616) 0)) (= c_~ldv_retval_1~0 0) (<= 1 c_~URB_STATE~0) (= |c_~#usb_acecad_driver~0.offset| 0) (= |c_ULTIMATE.start_usb_register_driver_#res#1| 0) (= |c_~#usb_acecad_id_table~0.offset| 0) (= |c_ULTIMATE.start_main_~ldvarg0~0#1.offset| 0) (not (= |c_ULTIMATE.start_usb_acecad_probe_#t~mem155#1| 0)) (<= |c_ULTIMATE.start_usb_make_path_#res#1| 63) (= |c_ULTIMATE.start_usb_acecad_probe_~id#1.offset| 0) (= c_~__mod_usb_device_table~0.bDeviceSubClass 0) (= 0 c_~__mod_usb_device_table~0.bcdDevice_hi)) is different from false