./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 b5237d83 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_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.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_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:48:17,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:48:17,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:48:18,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:48:18,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:48:18,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:48:18,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:48:18,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:48:18,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:48:18,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:48:18,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:48:18,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:48:18,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:48:18,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:48:18,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:48:18,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:48:18,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:48:18,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:48:18,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:48:18,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:48:18,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:48:18,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:48:18,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:48:18,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:48:18,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:48:18,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:48:18,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:48:18,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:48:18,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:48:18,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:48:18,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:48:18,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:48:18,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:48:18,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:48:18,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:48:18,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:48:18,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:48:18,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:48:18,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:48:18,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:48:18,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:48:18,101 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 16:48:18,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:48:18,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:48:18,152 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:48:18,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:48:18,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:48:18,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:48:18,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:48:18,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:48:18,155 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:48:18,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:48:18,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:48:18,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:48:18,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:48:18,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:48:18,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:48:18,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:48:18,158 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:48:18,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:48:18,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:48:18,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:48:18,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:48:18,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:48:18,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:48:18,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:48:18,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:48:18,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:48:18,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:48:18,161 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:48:18,162 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:48:18,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:48:18,162 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/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_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-11-21 16:48:18,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:48:18,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:48:18,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:48:18,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:48:18,598 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:48:18,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/../../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 [2022-11-21 16:48:21,864 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:48:22,400 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:48:22,401 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/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 [2022-11-21 16:48:22,444 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/data/8fe4e809f/2b24239f9278470d9c5410da57c071aa/FLAGb357a7f13 [2022-11-21 16:48:22,467 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/data/8fe4e809f/2b24239f9278470d9c5410da57c071aa [2022-11-21 16:48:22,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:48:22,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:48:22,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:48:22,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:48:22,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:48:22,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:48:22" (1/1) ... [2022-11-21 16:48:22,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6740f05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:22, skipping insertion in model container [2022-11-21 16:48:22,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:48:22" (1/1) ... [2022-11-21 16:48:22,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:48:22,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:48:23,620 WARN L237 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_041c7370-c8b8-4156-9eb2-11c60546ddb8/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] [2022-11-21 16:48:23,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:48:23,774 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:48:24,016 WARN L237 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_041c7370-c8b8-4156-9eb2-11c60546ddb8/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] [2022-11-21 16:48:24,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:48:24,082 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:48:24,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24 WrapperNode [2022-11-21 16:48:24,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:48:24,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:48:24,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:48:24,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:48:24,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,232 INFO L138 Inliner]: procedures = 109, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 800 [2022-11-21 16:48:24,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:48:24,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:48:24,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:48:24,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:48:24,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,303 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:48:24,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:48:24,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:48:24,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:48:24,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (1/1) ... [2022-11-21 16:48:24,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:48:24,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:48:24,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:48:24,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:48:24,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-21 16:48:24,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-21 16:48:24,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:48:24,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-21 16:48:24,428 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-21 16:48:24,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-21 16:48:24,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-21 16:48:24,429 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-21 16:48:24,430 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-21 16:48:24,430 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-21 16:48:24,430 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-21 16:48:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:48:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-21 16:48:24,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-21 16:48:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-21 16:48:24,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-21 16:48:24,432 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-21 16:48:24,432 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-21 16:48:24,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-21 16:48:24,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-21 16:48:24,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-21 16:48:24,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-21 16:48:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:48:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:48:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-21 16:48:24,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-21 16:48:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:48:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-21 16:48:24,434 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-21 16:48:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-21 16:48:24,434 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-21 16:48:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-21 16:48:24,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-21 16:48:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:48:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:48:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:48:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-21 16:48:24,437 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-21 16:48:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-21 16:48:24,438 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-21 16:48:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:48:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:48:24,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:48:24,914 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:48:24,917 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:48:25,024 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-21 16:48:25,830 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:48:25,847 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:48:25,848 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 16:48:25,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:48:25 BoogieIcfgContainer [2022-11-21 16:48:25,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:48:25,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:48:25,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:48:25,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:48:25,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:48:22" (1/3) ... [2022-11-21 16:48:25,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d76fca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:48:25, skipping insertion in model container [2022-11-21 16:48:25,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:24" (2/3) ... [2022-11-21 16:48:25,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d76fca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:48:25, skipping insertion in model container [2022-11-21 16:48:25,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:48:25" (3/3) ... [2022-11-21 16:48:25,870 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 [2022-11-21 16:48:25,894 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:48:25,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:48:25,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:48:25,966 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@340b6915, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:48:25,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:48:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 186 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-11-21 16:48:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 16:48:25,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:25,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:25,985 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash -914963392, now seen corresponding path program 1 times [2022-11-21 16:48:26,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:26,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877982293] [2022-11-21 16:48:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:26,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:48:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877982293] [2022-11-21 16:48:26,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877982293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:26,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:48:26,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831962624] [2022-11-21 16:48:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:26,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:48:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:26,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:48:26,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:48:26,695 INFO L87 Difference]: Start difference. First operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 186 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:48:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:27,410 INFO L93 Difference]: Finished difference Result 472 states and 646 transitions. [2022-11-21 16:48:27,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:48:27,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-21 16:48:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:27,437 INFO L225 Difference]: With dead ends: 472 [2022-11-21 16:48:27,438 INFO L226 Difference]: Without dead ends: 231 [2022-11-21 16:48:27,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:48:27,458 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 94 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:27,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 413 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:48:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-21 16:48:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-11-21 16:48:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 175 states have internal predecessors, (220), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-21 16:48:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 294 transitions. [2022-11-21 16:48:27,576 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 294 transitions. Word has length 32 [2022-11-21 16:48:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:27,577 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 294 transitions. [2022-11-21 16:48:27,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:48:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 294 transitions. [2022-11-21 16:48:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 16:48:27,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:27,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:27,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:48:27,588 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash -492261566, now seen corresponding path program 1 times [2022-11-21 16:48:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:27,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784965298] [2022-11-21 16:48:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:27,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:27,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:48:27,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:27,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784965298] [2022-11-21 16:48:27,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784965298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:27,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:27,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:48:27,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870838138] [2022-11-21 16:48:27,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:27,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:48:27,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:27,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:48:27,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:48:27,899 INFO L87 Difference]: Start difference. First operand 224 states and 294 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:48:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:28,835 INFO L93 Difference]: Finished difference Result 652 states and 865 transitions. [2022-11-21 16:48:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:48:28,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 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 32 [2022-11-21 16:48:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:28,840 INFO L225 Difference]: With dead ends: 652 [2022-11-21 16:48:28,840 INFO L226 Difference]: Without dead ends: 433 [2022-11-21 16:48:28,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:48:28,843 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 326 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:28,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 772 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:48:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-21 16:48:28,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 419. [2022-11-21 16:48:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 318 states have (on average 1.2893081761006289) internal successors, (410), 325 states have internal predecessors, (410), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-21 16:48:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 550 transitions. [2022-11-21 16:48:28,887 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 550 transitions. Word has length 32 [2022-11-21 16:48:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:28,888 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 550 transitions. [2022-11-21 16:48:28,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 16:48:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 550 transitions. [2022-11-21 16:48:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-21 16:48:28,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:28,891 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:28,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:48:28,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:28,892 INFO L85 PathProgramCache]: Analyzing trace with hash 453727969, now seen corresponding path program 1 times [2022-11-21 16:48:28,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:28,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644956850] [2022-11-21 16:48:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:29,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:29,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:29,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:29,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:29,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:48:29,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:29,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644956850] [2022-11-21 16:48:29,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644956850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:29,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:29,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:48:29,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907294195] [2022-11-21 16:48:29,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:29,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:48:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:48:29,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:48:29,128 INFO L87 Difference]: Start difference. First operand 419 states and 550 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 16:48:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:30,123 INFO L93 Difference]: Finished difference Result 990 states and 1341 transitions. [2022-11-21 16:48:30,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:48:30,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-21 16:48:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:30,129 INFO L225 Difference]: With dead ends: 990 [2022-11-21 16:48:30,129 INFO L226 Difference]: Without dead ends: 586 [2022-11-21 16:48:30,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:48:30,132 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 672 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:30,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1183 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:48:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-11-21 16:48:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 422. [2022-11-21 16:48:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 321 states have (on average 1.2834890965732086) internal successors, (412), 328 states have internal predecessors, (412), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-21 16:48:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 552 transitions. [2022-11-21 16:48:30,186 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 552 transitions. Word has length 55 [2022-11-21 16:48:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:30,187 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 552 transitions. [2022-11-21 16:48:30,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-21 16:48:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 552 transitions. [2022-11-21 16:48:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-21 16:48:30,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:30,190 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:30,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:48:30,190 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:30,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:30,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1191044641, now seen corresponding path program 1 times [2022-11-21 16:48:30,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:30,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907120427] [2022-11-21 16:48:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:30,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:30,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:30,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:48:30,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:30,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907120427] [2022-11-21 16:48:30,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907120427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:30,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:30,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:48:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386027812] [2022-11-21 16:48:30,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:30,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:48:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:30,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:48:30,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:48:30,427 INFO L87 Difference]: Start difference. First operand 422 states and 552 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:48:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:31,268 INFO L93 Difference]: Finished difference Result 1257 states and 1665 transitions. [2022-11-21 16:48:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:48:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 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 55 [2022-11-21 16:48:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:31,275 INFO L225 Difference]: With dead ends: 1257 [2022-11-21 16:48:31,275 INFO L226 Difference]: Without dead ends: 850 [2022-11-21 16:48:31,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:48:31,278 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 401 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:31,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 714 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:48:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-11-21 16:48:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 820. [2022-11-21 16:48:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 628 states have (on average 1.2786624203821657) internal successors, (803), 639 states have internal predecessors, (803), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-21 16:48:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1073 transitions. [2022-11-21 16:48:31,409 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1073 transitions. Word has length 55 [2022-11-21 16:48:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:31,410 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1073 transitions. [2022-11-21 16:48:31,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:48:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1073 transitions. [2022-11-21 16:48:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 16:48:31,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:31,413 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:31,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:48:31,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1732311739, now seen corresponding path program 1 times [2022-11-21 16:48:31,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:31,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250253869] [2022-11-21 16:48:31,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:31,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:31,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:48:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:31,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250253869] [2022-11-21 16:48:31,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250253869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:31,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:31,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:48:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314291986] [2022-11-21 16:48:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:31,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:48:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:48:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:48:31,625 INFO L87 Difference]: Start difference. First operand 820 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:48:32,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:32,230 INFO L93 Difference]: Finished difference Result 850 states and 1122 transitions. [2022-11-21 16:48:32,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:48:32,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 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 56 [2022-11-21 16:48:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:32,236 INFO L225 Difference]: With dead ends: 850 [2022-11-21 16:48:32,237 INFO L226 Difference]: Without dead ends: 847 [2022-11-21 16:48:32,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:48:32,238 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 285 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:32,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 539 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:48:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-11-21 16:48:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 819. [2022-11-21 16:48:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 628 states have (on average 1.2770700636942676) internal successors, (802), 638 states have internal predecessors, (802), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-21 16:48:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1071 transitions. [2022-11-21 16:48:32,364 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1071 transitions. Word has length 56 [2022-11-21 16:48:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:32,366 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1071 transitions. [2022-11-21 16:48:32,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:48:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1071 transitions. [2022-11-21 16:48:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 16:48:32,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:32,372 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:32,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:48:32,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:32,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:32,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2132925860, now seen corresponding path program 1 times [2022-11-21 16:48:32,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:32,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131578345] [2022-11-21 16:48:32,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:32,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:32,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:32,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:48:32,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:32,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131578345] [2022-11-21 16:48:32,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131578345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:32,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:32,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:48:32,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680236869] [2022-11-21 16:48:32,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:32,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:48:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:32,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:48:32,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:48:32,594 INFO L87 Difference]: Start difference. First operand 819 states and 1071 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:48:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:33,109 INFO L93 Difference]: Finished difference Result 849 states and 1120 transitions. [2022-11-21 16:48:33,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:48:33,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 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 57 [2022-11-21 16:48:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:33,117 INFO L225 Difference]: With dead ends: 849 [2022-11-21 16:48:33,117 INFO L226 Difference]: Without dead ends: 846 [2022-11-21 16:48:33,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:48:33,120 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 322 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:33,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 384 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:48:33,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-11-21 16:48:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 818. [2022-11-21 16:48:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 628 states have (on average 1.2754777070063694) internal successors, (801), 637 states have internal predecessors, (801), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-21 16:48:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1069 transitions. [2022-11-21 16:48:33,217 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1069 transitions. Word has length 57 [2022-11-21 16:48:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:33,218 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1069 transitions. [2022-11-21 16:48:33,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:48:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1069 transitions. [2022-11-21 16:48:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 16:48:33,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:33,219 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:48:33,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:48:33,220 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1696212008, now seen corresponding path program 1 times [2022-11-21 16:48:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:33,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135303951] [2022-11-21 16:48:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:33,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:33,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:33,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 16:48:33,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:33,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135303951] [2022-11-21 16:48:33,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135303951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:33,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:33,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:48:33,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392375465] [2022-11-21 16:48:33,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:33,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:48:33,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:48:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:48:33,376 INFO L87 Difference]: Start difference. First operand 818 states and 1069 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:48:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:33,832 INFO L93 Difference]: Finished difference Result 848 states and 1118 transitions. [2022-11-21 16:48:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:48:33,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 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 58 [2022-11-21 16:48:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:33,838 INFO L225 Difference]: With dead ends: 848 [2022-11-21 16:48:33,838 INFO L226 Difference]: Without dead ends: 837 [2022-11-21 16:48:33,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:48:33,840 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 319 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:33,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 383 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:48:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-11-21 16:48:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 809. [2022-11-21 16:48:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 620 states have (on average 1.2741935483870968) internal successors, (790), 628 states have internal predecessors, (790), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-21 16:48:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1057 transitions. [2022-11-21 16:48:33,923 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1057 transitions. Word has length 58 [2022-11-21 16:48:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:33,924 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1057 transitions. [2022-11-21 16:48:33,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 16:48:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1057 transitions. [2022-11-21 16:48:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-21 16:48:33,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:33,928 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:33,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:48:33,929 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:33,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:33,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1715867054, now seen corresponding path program 1 times [2022-11-21 16:48:33,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:33,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734233573] [2022-11-21 16:48:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:33,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 16:48:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 16:48:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 16:48:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:48:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 16:48:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-21 16:48:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-21 16:48:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 16:48:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-21 16:48:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:48:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-21 16:48:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:34,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734233573] [2022-11-21 16:48:34,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734233573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:34,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:34,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:48:34,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231359496] [2022-11-21 16:48:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:34,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:48:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:48:34,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:48:34,220 INFO L87 Difference]: Start difference. First operand 809 states and 1057 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 16:48:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:34,848 INFO L93 Difference]: Finished difference Result 1695 states and 2233 transitions. [2022-11-21 16:48:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:48:34,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 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 154 [2022-11-21 16:48:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:34,853 INFO L225 Difference]: With dead ends: 1695 [2022-11-21 16:48:34,854 INFO L226 Difference]: Without dead ends: 901 [2022-11-21 16:48:34,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:48:34,857 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 147 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:34,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 734 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:48:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-11-21 16:48:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 863. [2022-11-21 16:48:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 673 states have (on average 1.2838038632986628) internal successors, (864), 681 states have internal predecessors, (864), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-21 16:48:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1131 transitions. [2022-11-21 16:48:34,933 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1131 transitions. Word has length 154 [2022-11-21 16:48:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:34,933 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1131 transitions. [2022-11-21 16:48:34,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 16:48:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1131 transitions. [2022-11-21 16:48:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-21 16:48:34,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:34,937 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:34,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:48:34,938 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash 281231005, now seen corresponding path program 1 times [2022-11-21 16:48:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:34,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002005595] [2022-11-21 16:48:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:48:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-21 16:48:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-21 16:48:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:48:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-21 16:48:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 16:48:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-21 16:48:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-21 16:48:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-21 16:48:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-21 16:48:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:35,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002005595] [2022-11-21 16:48:35,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002005595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:35,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:35,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:48:35,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475940723] [2022-11-21 16:48:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:35,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:48:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:48:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:48:35,460 INFO L87 Difference]: Start difference. First operand 863 states and 1131 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 16:48:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:36,256 INFO L93 Difference]: Finished difference Result 2305 states and 3112 transitions. [2022-11-21 16:48:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:48:36,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 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 163 [2022-11-21 16:48:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:36,264 INFO L225 Difference]: With dead ends: 2305 [2022-11-21 16:48:36,264 INFO L226 Difference]: Without dead ends: 1461 [2022-11-21 16:48:36,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:48:36,272 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 455 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:36,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1773 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:48:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2022-11-21 16:48:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 875. [2022-11-21 16:48:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 685 states have (on average 1.2788321167883212) internal successors, (876), 693 states have internal predecessors, (876), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-21 16:48:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1143 transitions. [2022-11-21 16:48:36,381 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1143 transitions. Word has length 163 [2022-11-21 16:48:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:36,382 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1143 transitions. [2022-11-21 16:48:36,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 16:48:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1143 transitions. [2022-11-21 16:48:36,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-21 16:48:36,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:36,387 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:36,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:48:36,388 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:36,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:36,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1992328740, now seen corresponding path program 1 times [2022-11-21 16:48:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:36,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078750660] [2022-11-21 16:48:36,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:36,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:48:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:48:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:48:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-21 16:48:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 16:48:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-21 16:48:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:48:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-21 16:48:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-21 16:48:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:36,848 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-21 16:48:36,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:36,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078750660] [2022-11-21 16:48:36,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078750660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:48:36,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621651929] [2022-11-21 16:48:36,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:48:36,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:48:36,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:48:36,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:48:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:37,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:48:37,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-21 16:48:37,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:37,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621651929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:37,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:48:37,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-21 16:48:37,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204583844] [2022-11-21 16:48:37,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:37,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:48:37,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:48:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:48:37,573 INFO L87 Difference]: Start difference. First operand 875 states and 1143 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 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) [2022-11-21 16:48:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:37,983 INFO L93 Difference]: Finished difference Result 2833 states and 3730 transitions. [2022-11-21 16:48:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:48:37,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 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 165 [2022-11-21 16:48:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:37,994 INFO L225 Difference]: With dead ends: 2833 [2022-11-21 16:48:37,994 INFO L226 Difference]: Without dead ends: 1977 [2022-11-21 16:48:37,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:48:37,998 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 400 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:37,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1908 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:48:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2022-11-21 16:48:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 911. [2022-11-21 16:48:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.2678821879382889) internal successors, (904), 721 states have internal predecessors, (904), 142 states have call successors, (142), 56 states have call predecessors, (142), 55 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-11-21 16:48:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1187 transitions. [2022-11-21 16:48:38,177 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1187 transitions. Word has length 165 [2022-11-21 16:48:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:38,179 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1187 transitions. [2022-11-21 16:48:38,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 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) [2022-11-21 16:48:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1187 transitions. [2022-11-21 16:48:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-21 16:48:38,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:38,185 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:38,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:38,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:48:38,394 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:38,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:38,395 INFO L85 PathProgramCache]: Analyzing trace with hash 981211490, now seen corresponding path program 1 times [2022-11-21 16:48:38,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:38,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634744299] [2022-11-21 16:48:38,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:38,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:38,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:38,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:48:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:48:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:48:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-21 16:48:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 16:48:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-21 16:48:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-21 16:48:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-21 16:48:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-21 16:48:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-21 16:48:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:39,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634744299] [2022-11-21 16:48:39,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634744299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:48:39,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122280970] [2022-11-21 16:48:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:39,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:48:39,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:48:39,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:48:39,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:48:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:39,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 16:48:39,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-21 16:48:39,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:39,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122280970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:39,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:48:39,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-11-21 16:48:39,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958065360] [2022-11-21 16:48:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:39,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:48:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:39,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:48:39,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:48:39,761 INFO L87 Difference]: Start difference. First operand 911 states and 1187 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 16:48:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:39,959 INFO L93 Difference]: Finished difference Result 1831 states and 2411 transitions. [2022-11-21 16:48:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:48:39,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 165 [2022-11-21 16:48:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:39,966 INFO L225 Difference]: With dead ends: 1831 [2022-11-21 16:48:39,967 INFO L226 Difference]: Without dead ends: 939 [2022-11-21 16:48:39,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:48:39,970 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 1 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:39,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:48:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-11-21 16:48:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 927. [2022-11-21 16:48:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 725 states have (on average 1.2634482758620689) internal successors, (916), 733 states have internal predecessors, (916), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 145 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-21 16:48:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1219 transitions. [2022-11-21 16:48:40,097 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1219 transitions. Word has length 165 [2022-11-21 16:48:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:40,098 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1219 transitions. [2022-11-21 16:48:40,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 16:48:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1219 transitions. [2022-11-21 16:48:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-21 16:48:40,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:40,104 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:40,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-21 16:48:40,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:48:40,313 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:40,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1506840738, now seen corresponding path program 1 times [2022-11-21 16:48:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:40,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081008279] [2022-11-21 16:48:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:48:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:48:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:48:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:48:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 16:48:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-21 16:48:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:48:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-21 16:48:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-21 16:48:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 16:48:41,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:41,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081008279] [2022-11-21 16:48:41,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081008279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:48:41,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803242363] [2022-11-21 16:48:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:41,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:48:41,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:48:41,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:48:41,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:48:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:42,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-21 16:48:42,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-21 16:48:42,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:42,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803242363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:42,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:48:42,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2022-11-21 16:48:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191919741] [2022-11-21 16:48:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:42,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:48:42,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:48:42,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-21 16:48:42,733 INFO L87 Difference]: Start difference. First operand 927 states and 1219 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:48:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:43,844 INFO L93 Difference]: Finished difference Result 3347 states and 4705 transitions. [2022-11-21 16:48:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 16:48:43,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-11-21 16:48:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:43,858 INFO L225 Difference]: With dead ends: 3347 [2022-11-21 16:48:43,859 INFO L226 Difference]: Without dead ends: 2889 [2022-11-21 16:48:43,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-11-21 16:48:43,862 INFO L413 NwaCegarLoop]: 575 mSDtfsCounter, 841 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:43,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 3554 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:48:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2022-11-21 16:48:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 939. [2022-11-21 16:48:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 737 states have (on average 1.2591587516960652) internal successors, (928), 741 states have internal predecessors, (928), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-21 16:48:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1231 transitions. [2022-11-21 16:48:44,126 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1231 transitions. Word has length 171 [2022-11-21 16:48:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:44,127 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1231 transitions. [2022-11-21 16:48:44,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:48:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1231 transitions. [2022-11-21 16:48:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-21 16:48:44,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:44,133 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:44,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:44,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:48:44,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1514027366, now seen corresponding path program 2 times [2022-11-21 16:48:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:44,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643477638] [2022-11-21 16:48:44,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:48:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:48:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:48:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:48:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 16:48:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-21 16:48:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:48:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-21 16:48:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-21 16:48:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-21 16:48:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:45,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643477638] [2022-11-21 16:48:45,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643477638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:48:45,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219285467] [2022-11-21 16:48:45,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:48:45,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:48:45,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:48:45,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:48:45,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:48:46,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:48:46,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:48:46,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 16:48:46,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-21 16:48:46,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:46,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219285467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:46,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:48:46,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-11-21 16:48:46,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381419489] [2022-11-21 16:48:46,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:46,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:48:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:46,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:48:46,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:48:46,266 INFO L87 Difference]: Start difference. First operand 939 states and 1231 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:48:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:46,907 INFO L93 Difference]: Finished difference Result 1903 states and 2581 transitions. [2022-11-21 16:48:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:48:46,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 177 [2022-11-21 16:48:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:46,914 INFO L225 Difference]: With dead ends: 1903 [2022-11-21 16:48:46,914 INFO L226 Difference]: Without dead ends: 1439 [2022-11-21 16:48:46,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-21 16:48:46,917 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 572 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:46,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1976 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:48:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2022-11-21 16:48:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 945. [2022-11-21 16:48:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 743 states have (on average 1.2570659488559892) internal successors, (934), 747 states have internal predecessors, (934), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-21 16:48:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1237 transitions. [2022-11-21 16:48:47,158 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1237 transitions. Word has length 177 [2022-11-21 16:48:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:47,159 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1237 transitions. [2022-11-21 16:48:47,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 16:48:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1237 transitions. [2022-11-21 16:48:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-21 16:48:47,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:47,165 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:47,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:47,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 16:48:47,373 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:47,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1738426959, now seen corresponding path program 1 times [2022-11-21 16:48:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:47,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725416058] [2022-11-21 16:48:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:48:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:48:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:48:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:48:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 16:48:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-21 16:48:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:48:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 16:48:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-21 16:48:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-21 16:48:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-21 16:48:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-21 16:48:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:47,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725416058] [2022-11-21 16:48:47,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725416058] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:48:47,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944559671] [2022-11-21 16:48:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:47,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:48:47,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:48:48,000 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:48:48,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:48:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:48,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 1823 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:48:48,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-21 16:48:49,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:48:49,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944559671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:49,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:48:49,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-21 16:48:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787003783] [2022-11-21 16:48:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:49,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:48:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:49,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:48:49,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:48:49,033 INFO L87 Difference]: Start difference. First operand 945 states and 1237 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 16:48:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:49,889 INFO L93 Difference]: Finished difference Result 2799 states and 3674 transitions. [2022-11-21 16:48:49,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:48:49,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 205 [2022-11-21 16:48:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:49,904 INFO L225 Difference]: With dead ends: 2799 [2022-11-21 16:48:49,904 INFO L226 Difference]: Without dead ends: 2791 [2022-11-21 16:48:49,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:48:49,907 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 412 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:49,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1065 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:48:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-11-21 16:48:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2777. [2022-11-21 16:48:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2187 states have (on average 1.2610882487425696) internal successors, (2758), 2203 states have internal predecessors, (2758), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 437 states have call predecessors, (477), 417 states have call successors, (477) [2022-11-21 16:48:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3653 transitions. [2022-11-21 16:48:50,513 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3653 transitions. Word has length 205 [2022-11-21 16:48:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:50,514 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 3653 transitions. [2022-11-21 16:48:50,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 16:48:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3653 transitions. [2022-11-21 16:48:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-21 16:48:50,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:50,521 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:50,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:48:50,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 16:48:50,730 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash 727309709, now seen corresponding path program 1 times [2022-11-21 16:48:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:50,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431782068] [2022-11-21 16:48:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:48:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:48:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:48:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:48:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 16:48:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-21 16:48:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:48:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 16:48:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-21 16:48:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-21 16:48:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-21 16:48:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-21 16:48:51,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:51,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431782068] [2022-11-21 16:48:51,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431782068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:51,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:51,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 16:48:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801302542] [2022-11-21 16:48:51,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:51,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:48:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:51,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:48:51,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:48:51,154 INFO L87 Difference]: Start difference. First operand 2777 states and 3653 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-21 16:48:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:53,528 INFO L93 Difference]: Finished difference Result 8919 states and 11788 transitions. [2022-11-21 16:48:53,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 16:48:53,529 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 205 [2022-11-21 16:48:53,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:53,563 INFO L225 Difference]: With dead ends: 8919 [2022-11-21 16:48:53,563 INFO L226 Difference]: Without dead ends: 6161 [2022-11-21 16:48:53,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-11-21 16:48:53,574 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 572 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:48:53,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1291 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:48:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6161 states. [2022-11-21 16:48:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6161 to 2789. [2022-11-21 16:48:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2199 states have (on average 1.259663483401546) internal successors, (2770), 2219 states have internal predecessors, (2770), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 433 states have call predecessors, (477), 417 states have call successors, (477) [2022-11-21 16:48:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3665 transitions. [2022-11-21 16:48:54,468 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3665 transitions. Word has length 205 [2022-11-21 16:48:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:54,473 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 3665 transitions. [2022-11-21 16:48:54,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-21 16:48:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3665 transitions. [2022-11-21 16:48:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-11-21 16:48:54,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:54,481 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:48:54,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:48:54,482 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:48:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:54,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1660857439, now seen corresponding path program 1 times [2022-11-21 16:48:54,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:54,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345004903] [2022-11-21 16:48:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:54,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:48:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:48:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:48:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:48:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:48:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:48:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 16:48:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:48:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:55,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-21 16:48:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:48:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:48:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 16:48:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-21 16:48:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-21 16:48:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-21 16:48:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-21 16:48:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-21 16:48:56,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:56,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345004903] [2022-11-21 16:48:56,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345004903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:48:56,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163737686] [2022-11-21 16:48:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:56,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:48:56,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:48:56,062 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:48:56,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:48:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:56,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-21 16:48:56,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:48:56,721 INFO L350 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 [2022-11-21 16:48:56,826 INFO L350 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 [2022-11-21 16:48:57,502 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1036 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1036))) is different from true [2022-11-21 16:48:57,582 INFO L350 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 6 treesize of output 5 [2022-11-21 16:48:57,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:57,629 INFO L350 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 13 treesize of output 15 [2022-11-21 16:48:57,642 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:48:57,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 16:48:59,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:48:59,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:48:59,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:48:59,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:48:59,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:48:59,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:48:59,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-21 16:48:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 40 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-11-21 16:48:59,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:48:59,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1047 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-21 16:49:01,981 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1047 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-21 16:49:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163737686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:49:01,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:49:01,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-11-21 16:49:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225466573] [2022-11-21 16:49:01,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:49:02,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 16:49:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 16:49:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1425, Unknown=12, NotChecked=234, Total=1806 [2022-11-21 16:49:02,005 INFO L87 Difference]: Start difference. First operand 2789 states and 3665 transitions. Second operand has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-11-21 16:49:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:17,960 INFO L93 Difference]: Finished difference Result 15250 states and 20682 transitions. [2022-11-21 16:49:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-21 16:49:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) Word has length 212 [2022-11-21 16:49:17,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:18,024 INFO L225 Difference]: With dead ends: 15250 [2022-11-21 16:49:18,024 INFO L226 Difference]: Without dead ends: 12480 [2022-11-21 16:49:18,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 281 SyntacticMatches, 14 SemanticMatches, 102 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=951, Invalid=9132, Unknown=29, NotChecked=600, Total=10712 [2022-11-21 16:49:18,038 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 2233 mSDsluCounter, 11962 mSDsCounter, 0 mSdLazyCounter, 7942 mSolverCounterSat, 798 mSolverCounterUnsat, 162 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 12456 SdHoareTripleChecker+Invalid, 9736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 7942 IncrementalHoareTripleChecker+Invalid, 162 IncrementalHoareTripleChecker+Unknown, 834 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:18,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2261 Valid, 12456 Invalid, 9736 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [798 Valid, 7942 Invalid, 162 Unknown, 834 Unchecked, 10.1s Time] [2022-11-21 16:49:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12480 states. [2022-11-21 16:49:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12480 to 6541. [2022-11-21 16:49:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6541 states, 5231 states have (on average 1.2735614605238004) internal successors, (6662), 5315 states have internal predecessors, (6662), 862 states have call successors, (862), 388 states have call predecessors, (862), 447 states have return successors, (1125), 909 states have call predecessors, (1125), 861 states have call successors, (1125) [2022-11-21 16:49:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 8649 transitions. [2022-11-21 16:49:20,110 INFO L78 Accepts]: Start accepts. Automaton has 6541 states and 8649 transitions. Word has length 212 [2022-11-21 16:49:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:20,111 INFO L495 AbstractCegarLoop]: Abstraction has 6541 states and 8649 transitions. [2022-11-21 16:49:20,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-11-21 16:49:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6541 states and 8649 transitions. [2022-11-21 16:49:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-11-21 16:49:20,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:20,125 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:20,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:49:20,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 16:49:20,342 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:49:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1154314915, now seen corresponding path program 2 times [2022-11-21 16:49:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:20,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848667967] [2022-11-21 16:49:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:49:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:49:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:49:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:49:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:49:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:49:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:49:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:49:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:49:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:49:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:49:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:49:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:49:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-21 16:49:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:21,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:49:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:22,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-21 16:49:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-21 16:49:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:49:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:22,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-21 16:49:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-21 16:49:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:22,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-21 16:49:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-21 16:49:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-21 16:49:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-21 16:49:22,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:22,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848667967] [2022-11-21 16:49:22,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848667967] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:49:22,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296513135] [2022-11-21 16:49:22,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:49:22,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:49:22,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:49:22,097 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:49:22,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:49:22,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:49:22,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:49:22,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 1863 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-21 16:49:22,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:49:22,819 INFO L350 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 [2022-11-21 16:49:22,882 INFO L350 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 [2022-11-21 16:49:23,512 INFO L350 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 12 treesize of output 9 [2022-11-21 16:49:23,520 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1330 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1330))) is different from true [2022-11-21 16:49:23,663 INFO L350 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 12 treesize of output 9 [2022-11-21 16:49:23,668 INFO L350 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 6 treesize of output 5 [2022-11-21 16:49:23,773 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:49:23,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-11-21 16:49:23,803 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:49:23,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:49:24,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:49:24,265 INFO L350 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 [2022-11-21 16:49:24,541 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:49:24,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-21 16:49:25,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:49:26,175 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:49:26,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 16:49:27,445 INFO L350 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 13 treesize of output 15 [2022-11-21 16:49:27,738 INFO L350 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 13 treesize of output 15 [2022-11-21 16:49:27,762 INFO L350 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 13 treesize of output 15 [2022-11-21 16:49:28,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:49:28,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:49:28,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:28,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-21 16:49:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 42 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 2 not checked. [2022-11-21 16:49:28,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:49:28,300 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-21 16:49:28,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296513135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:49:28,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:49:28,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 48] total 59 [2022-11-21 16:49:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085135689] [2022-11-21 16:49:28,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:49:28,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-21 16:49:28,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:28,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-21 16:49:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3211, Unknown=3, NotChecked=230, Total=3660 [2022-11-21 16:49:28,326 INFO L87 Difference]: Start difference. First operand 6541 states and 8649 transitions. Second operand has 59 states, 56 states have (on average 4.678571428571429) internal successors, (262), 42 states have internal predecessors, (262), 15 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 15 states have call successors, (42) [2022-11-21 16:49:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:58,834 INFO L93 Difference]: Finished difference Result 21984 states and 29881 transitions. [2022-11-21 16:49:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-21 16:49:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 4.678571428571429) internal successors, (262), 42 states have internal predecessors, (262), 15 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 15 states have call successors, (42) Word has length 218 [2022-11-21 16:49:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:58,895 INFO L225 Difference]: With dead ends: 21984 [2022-11-21 16:49:58,895 INFO L226 Difference]: Without dead ends: 15462 [2022-11-21 16:49:58,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 273 SyntacticMatches, 15 SemanticMatches, 136 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5308 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1318, Invalid=17044, Unknown=6, NotChecked=538, Total=18906 [2022-11-21 16:49:58,917 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 2313 mSDsluCounter, 24219 mSDsCounter, 0 mSdLazyCounter, 15437 mSolverCounterSat, 791 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2346 SdHoareTripleChecker+Valid, 24865 SdHoareTripleChecker+Invalid, 17425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 15437 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 1193 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:58,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2346 Valid, 24865 Invalid, 17425 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [791 Valid, 15437 Invalid, 4 Unknown, 1193 Unchecked, 21.2s Time] [2022-11-21 16:49:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15462 states. [2022-11-21 16:50:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15462 to 7099. [2022-11-21 16:50:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7099 states, 5692 states have (on average 1.2749472944483486) internal successors, (7257), 5784 states have internal predecessors, (7257), 931 states have call successors, (931), 414 states have call predecessors, (931), 475 states have return successors, (1218), 980 states have call predecessors, (1218), 930 states have call successors, (1218) [2022-11-21 16:50:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7099 states to 7099 states and 9406 transitions. [2022-11-21 16:50:00,683 INFO L78 Accepts]: Start accepts. Automaton has 7099 states and 9406 transitions. Word has length 218 [2022-11-21 16:50:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:50:00,683 INFO L495 AbstractCegarLoop]: Abstraction has 7099 states and 9406 transitions. [2022-11-21 16:50:00,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 4.678571428571429) internal successors, (262), 42 states have internal predecessors, (262), 15 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 15 states have call successors, (42) [2022-11-21 16:50:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 7099 states and 9406 transitions. [2022-11-21 16:50:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-11-21 16:50:00,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:50:00,697 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:00,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:00,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 16:50:00,908 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:50:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -789994785, now seen corresponding path program 3 times [2022-11-21 16:50:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:00,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301120844] [2022-11-21 16:50:00,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:50:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:50:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:50:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:50:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:50:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:50:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:50:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-21 16:50:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-21 16:50:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-21 16:50:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-21 16:50:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-21 16:50:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-21 16:50:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-21 16:50:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-21 16:50:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-21 16:50:02,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:02,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301120844] [2022-11-21 16:50:02,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301120844] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:50:02,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008387251] [2022-11-21 16:50:02,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:50:02,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:50:02,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:02,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:50:02,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:50:03,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-21 16:50:03,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:50:03,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 16:50:03,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-21 16:50:03,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:50:03,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008387251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:03,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:50:03,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2022-11-21 16:50:03,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853742365] [2022-11-21 16:50:03,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:03,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:50:03,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:03,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:50:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:50:03,449 INFO L87 Difference]: Start difference. First operand 7099 states and 9406 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-21 16:50:04,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:04,981 INFO L93 Difference]: Finished difference Result 13645 states and 18060 transitions. [2022-11-21 16:50:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:50:04,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 224 [2022-11-21 16:50:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:50:05,008 INFO L225 Difference]: With dead ends: 13645 [2022-11-21 16:50:05,008 INFO L226 Difference]: Without dead ends: 7099 [2022-11-21 16:50:05,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:50:05,026 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 0 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:50:05,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1125 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:50:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7099 states. [2022-11-21 16:50:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7099 to 7099. [2022-11-21 16:50:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7099 states, 5692 states have (on average 1.2749472944483486) internal successors, (7257), 5784 states have internal predecessors, (7257), 931 states have call successors, (931), 414 states have call predecessors, (931), 475 states have return successors, (1206), 980 states have call predecessors, (1206), 930 states have call successors, (1206) [2022-11-21 16:50:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7099 states to 7099 states and 9394 transitions. [2022-11-21 16:50:06,743 INFO L78 Accepts]: Start accepts. Automaton has 7099 states and 9394 transitions. Word has length 224 [2022-11-21 16:50:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:50:06,744 INFO L495 AbstractCegarLoop]: Abstraction has 7099 states and 9394 transitions. [2022-11-21 16:50:06,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-21 16:50:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 7099 states and 9394 transitions. [2022-11-21 16:50:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-11-21 16:50:06,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:50:06,772 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:06,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:06,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 16:50:06,981 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:50:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash 962005083, now seen corresponding path program 4 times [2022-11-21 16:50:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:06,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589417279] [2022-11-21 16:50:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:50:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:50:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:50:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:50:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:50:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:50:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:50:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-21 16:50:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-21 16:50:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-21 16:50:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-21 16:50:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-21 16:50:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-21 16:50:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-21 16:50:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-21 16:50:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-11-21 16:50:08,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:08,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589417279] [2022-11-21 16:50:08,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589417279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:50:08,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025057488] [2022-11-21 16:50:08,443 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:50:08,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:50:08,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:08,445 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:50:08,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 16:50:09,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:50:09,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:50:09,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-21 16:50:09,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:09,164 INFO L350 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 [2022-11-21 16:50:09,197 INFO L350 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 [2022-11-21 16:50:09,659 INFO L350 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 12 treesize of output 9 [2022-11-21 16:50:09,665 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1926 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1926))) is different from true [2022-11-21 16:50:09,733 INFO L350 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 12 treesize of output 9 [2022-11-21 16:50:09,736 INFO L350 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 6 treesize of output 5 [2022-11-21 16:50:09,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:50:09,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:09,825 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:50:09,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:50:09,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:50:10,053 INFO L350 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 12 treesize of output 9 [2022-11-21 16:50:10,139 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:50:10,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:50:10,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:50:10,626 INFO L350 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 12 treesize of output 9 [2022-11-21 16:50:11,050 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:50:11,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:50:11,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:50:11,706 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:50:11,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 16:50:12,015 INFO L350 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 13 treesize of output 15 [2022-11-21 16:50:12,215 INFO L350 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 13 treesize of output 15 [2022-11-21 16:50:12,226 INFO L350 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 13 treesize of output 15 [2022-11-21 16:50:12,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:12,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:12,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:50:12,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-21 16:50:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 80 proven. 52 refuted. 19 times theorem prover too weak. 40 trivial. 2 not checked. [2022-11-21 16:50:12,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:50:12,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1938 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1938) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-21 16:50:12,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025057488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:50:12,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:50:12,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 40] total 47 [2022-11-21 16:50:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44598322] [2022-11-21 16:50:12,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:50:12,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-21 16:50:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:12,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-21 16:50:12,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1879, Unknown=30, NotChecked=178, Total=2256 [2022-11-21 16:50:12,567 INFO L87 Difference]: Start difference. First operand 7099 states and 9394 transitions. Second operand has 47 states, 44 states have (on average 5.863636363636363) internal successors, (258), 34 states have internal predecessors, (258), 16 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (43), 19 states have call predecessors, (43), 16 states have call successors, (43) [2022-11-21 16:50:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:35,454 INFO L93 Difference]: Finished difference Result 22426 states and 30516 transitions. [2022-11-21 16:50:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-21 16:50:35,455 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 5.863636363636363) internal successors, (258), 34 states have internal predecessors, (258), 16 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (43), 19 states have call predecessors, (43), 16 states have call successors, (43) Word has length 230 [2022-11-21 16:50:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:50:35,516 INFO L225 Difference]: With dead ends: 22426 [2022-11-21 16:50:35,516 INFO L226 Difference]: Without dead ends: 15514 [2022-11-21 16:50:35,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 309 SyntacticMatches, 14 SemanticMatches, 104 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3344 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=874, Invalid=9792, Unknown=54, NotChecked=410, Total=11130 [2022-11-21 16:50:35,540 INFO L413 NwaCegarLoop]: 660 mSDtfsCounter, 2035 mSDsluCounter, 15941 mSDsCounter, 0 mSdLazyCounter, 11239 mSolverCounterSat, 868 mSolverCounterUnsat, 163 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 16601 SdHoareTripleChecker+Invalid, 13093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 11239 IncrementalHoareTripleChecker+Invalid, 163 IncrementalHoareTripleChecker+Unknown, 823 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:50:35,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2064 Valid, 16601 Invalid, 13093 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [868 Valid, 11239 Invalid, 163 Unknown, 823 Unchecked, 15.9s Time] [2022-11-21 16:50:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15514 states. [2022-11-21 16:50:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15514 to 6993. [2022-11-21 16:50:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6993 states, 5600 states have (on average 1.27125) internal successors, (7119), 5676 states have internal predecessors, (7119), 921 states have call successors, (921), 410 states have call predecessors, (921), 471 states have return successors, (1182), 982 states have call predecessors, (1182), 920 states have call successors, (1182) [2022-11-21 16:50:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 9222 transitions. [2022-11-21 16:50:37,507 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 9222 transitions. Word has length 230 [2022-11-21 16:50:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:50:37,507 INFO L495 AbstractCegarLoop]: Abstraction has 6993 states and 9222 transitions. [2022-11-21 16:50:37,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 5.863636363636363) internal successors, (258), 34 states have internal predecessors, (258), 16 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (43), 19 states have call predecessors, (43), 16 states have call successors, (43) [2022-11-21 16:50:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 9222 transitions. [2022-11-21 16:50:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-21 16:50:37,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:50:37,521 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:37,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:37,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:50:37,732 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:50:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash -835442034, now seen corresponding path program 1 times [2022-11-21 16:50:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:37,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135637709] [2022-11-21 16:50:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:37,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:43,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:50:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:43,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 16:50:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 16:50:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:43,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 16:50:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:43,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:50:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:44,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:50:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:50:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:44,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:44,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-21 16:50:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:50:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-21 16:50:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-21 16:50:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-21 16:50:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-21 16:50:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 16:50:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-21 16:50:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-21 16:50:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-21 16:50:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 11 proven. 69 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-21 16:50:45,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:45,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135637709] [2022-11-21 16:50:45,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135637709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:50:45,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290793511] [2022-11-21 16:50:45,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:45,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:50:45,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:45,448 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:50:45,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 16:50:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:46,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 1956 conjuncts, 149 conjunts are in the unsatisfiable core [2022-11-21 16:50:46,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:46,260 INFO L350 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 [2022-11-21 16:50:46,349 INFO L350 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 [2022-11-21 16:50:47,000 INFO L350 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 [2022-11-21 16:50:47,007 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2254 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2254) |c_#memory_int|)) is different from true [2022-11-21 16:50:47,210 INFO L350 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 6 treesize of output 5 [2022-11-21 16:50:47,217 INFO L350 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 [2022-11-21 16:50:47,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:50:47,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:47,284 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-21 16:50:47,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-21 16:50:47,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:50:47,697 INFO L350 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 12 treesize of output 9 [2022-11-21 16:50:47,957 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:50:47,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:50:49,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 16:50:49,360 INFO L350 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 12 treesize of output 9 [2022-11-21 16:50:50,327 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 16:50:50,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 16:50:50,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 16:50:51,616 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 16:50:51,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 16:50:52,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:52,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:52,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:52,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:53,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:53,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-21 16:50:53,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:50:53,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-21 16:50:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 94 proven. 90 refuted. 4 times theorem prover too weak. 42 trivial. 2 not checked. [2022-11-21 16:50:53,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:50:55,404 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_2268 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)))) is different from false [2022-11-21 16:50:55,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)))) is different from false [2022-11-21 16:50:55,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290793511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:50:55,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 16:50:55,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48] total 84 [2022-11-21 16:50:55,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041498441] [2022-11-21 16:50:55,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 16:50:55,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-21 16:50:55,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:55,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-21 16:50:55,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=6420, Unknown=19, NotChecked=492, Total=7310 [2022-11-21 16:50:55,440 INFO L87 Difference]: Start difference. First operand 6993 states and 9222 transitions. Second operand has 84 states, 80 states have (on average 3.45) internal successors, (276), 66 states have internal predecessors, (276), 26 states have call successors, (47), 12 states have call predecessors, (47), 22 states have return successors, (48), 33 states have call predecessors, (48), 26 states have call successors, (48) [2022-11-21 16:51:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:51:24,407 INFO L93 Difference]: Finished difference Result 17435 states and 23152 transitions. [2022-11-21 16:51:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-21 16:51:24,408 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 80 states have (on average 3.45) internal successors, (276), 66 states have internal predecessors, (276), 26 states have call successors, (47), 12 states have call predecessors, (47), 22 states have return successors, (48), 33 states have call predecessors, (48), 26 states have call successors, (48) Word has length 237 [2022-11-21 16:51:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:51:24,446 INFO L225 Difference]: With dead ends: 17435 [2022-11-21 16:51:24,446 INFO L226 Difference]: Without dead ends: 10869 [2022-11-21 16:51:24,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 299 SyntacticMatches, 16 SemanticMatches, 150 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7243 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1648, Invalid=20376, Unknown=40, NotChecked=888, Total=22952 [2022-11-21 16:51:24,465 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 3609 mSDsluCounter, 17611 mSDsCounter, 0 mSdLazyCounter, 15544 mSolverCounterSat, 1559 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3640 SdHoareTripleChecker+Valid, 18099 SdHoareTripleChecker+Invalid, 18278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1559 IncrementalHoareTripleChecker+Valid, 15544 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 1144 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:51:24,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3640 Valid, 18099 Invalid, 18278 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1559 Valid, 15544 Invalid, 31 Unknown, 1144 Unchecked, 18.6s Time] [2022-11-21 16:51:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10869 states. [2022-11-21 16:51:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10869 to 7017. [2022-11-21 16:51:26,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7017 states, 5616 states have (on average 1.2711894586894588) internal successors, (7139), 5696 states have internal predecessors, (7139), 925 states have call successors, (925), 414 states have call predecessors, (925), 475 states have return successors, (1186), 982 states have call predecessors, (1186), 924 states have call successors, (1186) [2022-11-21 16:51:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7017 states to 7017 states and 9250 transitions. [2022-11-21 16:51:26,168 INFO L78 Accepts]: Start accepts. Automaton has 7017 states and 9250 transitions. Word has length 237 [2022-11-21 16:51:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:51:26,169 INFO L495 AbstractCegarLoop]: Abstraction has 7017 states and 9250 transitions. [2022-11-21 16:51:26,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 80 states have (on average 3.45) internal successors, (276), 66 states have internal predecessors, (276), 26 states have call successors, (47), 12 states have call predecessors, (47), 22 states have return successors, (48), 33 states have call predecessors, (48), 26 states have call successors, (48) [2022-11-21 16:51:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 7017 states and 9250 transitions. [2022-11-21 16:51:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-11-21 16:51:26,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:51:26,180 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:26,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 16:51:26,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:26,391 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:51:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1440317130, now seen corresponding path program 1 times [2022-11-21 16:51:26,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:26,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408841692] [2022-11-21 16:51:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:51:27,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:51:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:51:28,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:51:28,405 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:51:28,406 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 16:51:28,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 16:51:28,410 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:28,414 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:51:28,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:51:28 BoogieIcfgContainer [2022-11-21 16:51:28,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:51:28,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:51:28,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:51:28,809 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:51:28,810 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:48:25" (3/4) ... [2022-11-21 16:51:28,813 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:51:28,813 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:51:28,814 INFO L158 Benchmark]: Toolchain (without parser) took 186340.70ms. Allocated memory was 146.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 96.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 271.6MB. Max. memory is 16.1GB. [2022-11-21 16:51:28,815 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:51:28,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1608.10ms. Allocated memory is still 146.8MB. Free memory was 96.3MB in the beginning and 81.8MB in the end (delta: 14.5MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2022-11-21 16:51:28,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.62ms. Allocated memory is still 146.8MB. Free memory was 81.8MB in the beginning and 74.9MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:51:28,816 INFO L158 Benchmark]: Boogie Preprocessor took 73.10ms. Allocated memory is still 146.8MB. Free memory was 74.9MB in the beginning and 69.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:51:28,816 INFO L158 Benchmark]: RCFGBuilder took 1534.98ms. Allocated memory is still 146.8MB. Free memory was 69.2MB in the beginning and 93.2MB in the end (delta: -24.0MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2022-11-21 16:51:28,817 INFO L158 Benchmark]: TraceAbstraction took 182953.88ms. Allocated memory was 146.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 92.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-21 16:51:28,817 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 1.6GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:51:28,820 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1608.10ms. Allocated memory is still 146.8MB. Free memory was 96.3MB in the beginning and 81.8MB in the end (delta: 14.5MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 156.62ms. Allocated memory is still 146.8MB. Free memory was 81.8MB in the beginning and 74.9MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.10ms. Allocated memory is still 146.8MB. Free memory was 74.9MB in the beginning and 69.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1534.98ms. Allocated memory is still 146.8MB. Free memory was 69.2MB in the beginning and 93.2MB in the end (delta: -24.0MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 182953.88ms. Allocated memory was 146.8MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 92.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 1.6GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4063]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 3839, overapproximation of strlen at line 3778, overapproximation of bitwiseOr at line 3801, overapproximation of bitwiseAnd at line 3406, overapproximation of snprintf at line 3350. Possible FailurePath: [L3543] int LDV_IN_INTERRUPT = 1; [L3544] int ref_cnt ; [L3545] int ldv_state_variable_1 ; [L3546] int usb_counter ; [L3547] struct usb_interface *usb_acecad_driver_group1 ; [L3548] int ldv_state_variable_0 ; [L3832-L3836] static struct usb_device_id usb_acecad_id_table[3U] = { {3U, 1120U, 4U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1120U, 8U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 1UL}}; [L3837] struct usb_device_id const __mod_usb_device_table ; [L3838-L3843] static struct usb_driver usb_acecad_driver = {"usb_acecad", & usb_acecad_probe, & usb_acecad_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& usb_acecad_id_table), {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L3865] int ldv_retval_0 ; [L3866] int ldv_retval_1 ; [L4066] int URB_STATE = 0; [L4067] int DEV_STATE = 0; [L4068] int INTERF_STATE = 0; [L4069] int SERIAL_STATE = 0; [L4070] void *usb_intfdata = (void *)0; [L4071] struct urb *int_urb = (struct urb *)0; [L4072] struct urb *bulk_urb = (struct urb *)0; [L4073] void (*completeFnInt)(struct urb * ) ; [L4074] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3880] struct usb_device_id *ldvarg0 ; [L3881] void *tmp ; [L3882] int tmp___0 ; [L3883] int tmp___1 ; [L3884] int tmp___2 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] CALL, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, size=24, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] RET, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] tmp = ldv_init_zalloc(24UL) [L3887] ldvarg0 = (struct usb_device_id *)tmp [L3888] FCALL ldv_initialize() [L3889] ldv_state_variable_1 = 0 [L3890] ref_cnt = 0 [L3891] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: [L3937] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3938] COND TRUE ldv_state_variable_0 == 1 [L3939] CALL, EXPR usb_acecad_init() [L3846] int result ; [L3847] int tmp ; [L3849] CALL, EXPR usb_register(& usb_acecad_driver) [L3359] int tmp ; [L3361] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3980] ldv_func_ret_type ldv_func_res ; [L3981] int tmp ; [L3983] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4343] return __VERIFIER_nondet_int(); [L3983] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3983] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3984] ldv_func_res = tmp [L3985] ldv_state_variable_1 = 1 [L3986] usb_counter = 0 [L3987] CALL ldv_usb_driver_1() [L3871] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] CALL, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-110680464442257309697:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1248, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-110680464442257309697:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-110680464442257309697:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-110680464442257309697:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-110680464442257309697:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \result={-110680464442257309697:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-110680464442257309697:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-110680464442257309697:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] RET, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-110680464442257309697:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] tmp = ldv_init_zalloc(1248UL) [L3874] usb_acecad_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309697:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3987] RET ldv_usb_driver_1() [L3988] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, ldv_func_arg2={18446744073709551618:18446744073709551644}, ldv_func_arg2={18446744073709551618:18446744073709551644}, ldv_func_arg3={3:0}, ldv_func_arg3={3:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3361] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3362] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, driver={12:0}, driver={12:0}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3849] RET, EXPR usb_register(& usb_acecad_driver) [L3849] tmp = usb_register(& usb_acecad_driver) [L3850] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3851] COND TRUE result == 0 [L3855] return (result); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3939] RET, EXPR usb_acecad_init() [L3939] ldv_retval_1 = usb_acecad_init() [L3940] COND TRUE ldv_retval_1 == 0 [L3941] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3944] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3896] COND TRUE ldv_state_variable_1 != 0 [L3897] tmp___1 = __VERIFIER_nondet_int() [L3899] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3900] COND TRUE ldv_state_variable_1 == 1 [L3901] CALL, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3693] struct usb_device *dev ; [L3694] struct usb_device *tmp ; [L3695] struct usb_host_interface *interface ; [L3696] struct usb_endpoint_descriptor *endpoint ; [L3697] struct usb_acecad *acecad ; [L3698] struct input_dev *input_dev ; [L3699] int pipe ; [L3700] int maxp ; [L3701] int err ; [L3702] int tmp___0 ; [L3703] unsigned int tmp___1 ; [L3704] __u16 tmp___2 ; [L3705] void *tmp___3 ; [L3706] void *tmp___4 ; [L3707] size_t tmp___5 ; [L3708] size_t tmp___6 ; [L3710] CALL, EXPR interface_to_usbdev(intf) [L3971] struct usb_device *tmp ; [L3973] CALL, EXPR ldv_interface_to_usbdev() [L4189] void *result ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1822, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] RET, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-36893488147419103233:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] result = ldv_malloc(sizeof(struct usb_device)) [L4195] COND FALSE !((unsigned long )result == (unsigned long )((void *)0)) [L4199] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-36893488147419103233:0}, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3973] RET, EXPR ldv_interface_to_usbdev() [L3973] tmp = ldv_interface_to_usbdev() [L3974] return (tmp); VAL [={0:0}, ={0:0}, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3710] RET, EXPR interface_to_usbdev(intf) [L3710] tmp = interface_to_usbdev(intf) [L3711] dev = tmp [L3712] EXPR intf->cur_altsetting [L3712] interface = intf->cur_altsetting [L3713] EXPR interface->desc.bNumEndpoints VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, interface->desc.bNumEndpoints=-255, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3713] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3717] EXPR interface->endpoint [L3717] endpoint = & (interface->endpoint)->desc [L3718] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3314] int tmp ; [L3315] int tmp___0 ; [L3316] int tmp___1 ; [L3318] CALL, EXPR usb_endpoint_xfer_int(epd) [L3309] EXPR epd->bmAttributes [L3309] return (((int )epd->bmAttributes & 3) == 3); [L3318] RET, EXPR usb_endpoint_xfer_int(epd) [L3318] tmp = usb_endpoint_xfer_int(epd) [L3319] COND TRUE tmp != 0 [L3320] CALL, EXPR usb_endpoint_dir_in(epd) [L3303] EXPR epd->bEndpointAddress [L3303] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3320] RET, EXPR usb_endpoint_dir_in(epd) [L3320] tmp___0 = usb_endpoint_dir_in(epd) [L3321] COND TRUE tmp___0 != 0 [L3322] tmp___1 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epd={18446744073709551621:19}, epd={18446744073709551621:19}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3329] return (tmp___1); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epd={18446744073709551621:19}, epd={18446744073709551621:19}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3718] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3718] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3719] COND FALSE !(tmp___0 == 0) [L3723] EXPR endpoint->bEndpointAddress [L3723] CALL, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3383] EXPR dev->devnum [L3383] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3723] RET, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3723] tmp___1 = __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3724] pipe = (int )(tmp___1 | 1073741952U) [L3725] CALL, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3388] struct usb_host_endpoint *ep ; [L3389] unsigned int epnum ; [L3390] int __ret_warn_on ; [L3391] long tmp ; [L3392] int __ret_warn_on___0 ; [L3393] long tmp___0 ; VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3395] epnum = (unsigned int )(pipe >> 15) & 15U VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3396] COND FALSE !(is_out != 0) [L3406] __ret_warn_on___0 = (pipe & 128) == 0 VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3407] CALL, EXPR ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3407] RET, EXPR ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3407] tmp___0 = ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) [L3408] COND FALSE !(tmp___0 != 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3412] CALL ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3412] RET ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3413] EXPR udev->ep_in[epnum] [L3413] ep = udev->ep_in[epnum] [L3415] COND TRUE (unsigned long )ep == (unsigned long )((struct usb_host_endpoint *)0) [L3416] return (0U); VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, ep={18446744073709551599:17}, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3725] RET, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3725] tmp___2 = usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3726] maxp = (int )tmp___2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] CALL, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=232, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-55340232221128654849:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, t=32768, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=232, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp___1={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=232, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=208, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] RET, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, kzalloc(232UL, 208U)={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] tmp___3 = kzalloc(232UL, 208U) [L3728] acecad = (struct usb_acecad *)tmp___3 [L3729] CALL, EXPR input_allocate_device() [L3551] CALL, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1855, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, t=32768, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=1855, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp___1={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=128, \old(size)=1855, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=128, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] RET, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-36893488147419103231:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L3729] RET, EXPR input_allocate_device() [L3729] input_dev = input_allocate_device() [L3730] COND FALSE !((unsigned long )acecad == (unsigned long )((struct usb_acecad *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L3735] CALL, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L4324] CALL, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=0, \result={-73786976294838206465:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] RET, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(arg1)=8, \old(arg2)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg0={-36893488147419103233:0}, arg0={-36893488147419103233:0}, arg1=8, arg2=208, arg3={-55340232221128654849:224}, arg3={-55340232221128654849:224}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-73786976294838206465:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] return ldv_malloc(0UL); [L3735] RET, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3735] tmp___4 = usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3736] acecad->data = (unsigned char *)tmp___4 [L3737] EXPR acecad->data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->data={-73786976294838206465:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3737] COND FALSE !((unsigned long )acecad->data == (unsigned long )((unsigned char *)0U)) [L3742] CALL, EXPR ldv_usb_alloc_urb_5(0, 208U) [L4009] ldv_func_ret_type___0 ldv_func_res ; [L4010] struct urb *tmp ; [L4012] CALL, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4327] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(arg0)=0, \old(arg1)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg0=0, arg1=208, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] return ldv_malloc(sizeof(struct urb)); [L4012] RET, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4012] tmp = usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4013] ldv_func_res = tmp [L4014] CALL ldv_alloc_urb(ldv_func_res) [L4098] COND TRUE (unsigned long )res != (unsigned long )((struct urb *)0) [L4099] URB_STATE = URB_STATE + 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, res={-18446744073709551615:0}, res={-18446744073709551615:0}, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4014] RET ldv_alloc_urb(ldv_func_res) [L4015] return (ldv_func_res); VAL [={0:0}, ={0:0}, \old(ldv_func_arg1)=0, \old(ldv_func_arg2)=208, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1=0, ldv_func_arg2=208, ldv_func_res={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3742] RET, EXPR ldv_usb_alloc_urb_5(0, 208U) [L3742] acecad->irq = ldv_usb_alloc_urb_5(0, 208U) [L3743] EXPR acecad->irq VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->irq={-18446744073709551615:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3743] COND FALSE !((unsigned long )acecad->irq == (unsigned long )((struct urb *)0)) [L3748] acecad->usbdev = dev [L3749] acecad->input = input_dev [L3750] EXPR dev->manufacturer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev->manufacturer={18446744073709551598:18}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3750] COND FALSE !((unsigned long )dev->manufacturer != (unsigned long )((char *)0)) [L3754] EXPR dev->product VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev->product={18446744073709551593:23}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3754] COND FALSE !((unsigned long )dev->product != (unsigned long )((char *)0)) [L3762] CALL usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3348] int actual ; [L3350] EXPR dev->bus [L3350] EXPR (dev->bus)->bus_name [L3350] actual = snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [L3351] return ((int )size > actual ? actual : -1); VAL [={0:0}, ={0:0}, \old(size)=64, \result=-1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, actual=-1, buf={-55340232221128654849:128}, buf={-55340232221128654849:128}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev={-36893488147419103233:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=64, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3762] RET usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3763] CALL strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, \old(arg2)=64, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg0={-55340232221128654849:128}, arg1={8:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4317] return __VERIFIER_nondet_ulong(); [L3763] RET strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, strlcat((char *)(& acecad->phys), "/input0", 64UL)=18446744073709551643, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3764] input_dev->name = (char const *)(& acecad->name) [L3765] input_dev->phys = (char const *)(& acecad->phys) [L3766] CALL usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3600] id->bustype = 3U [L3601] EXPR dev->descriptor.idVendor [L3601] id->vendor = dev->descriptor.idVendor [L3602] EXPR dev->descriptor.idProduct [L3602] id->product = dev->descriptor.idProduct [L3603] EXPR dev->descriptor.bcdDevice [L3603] id->version = dev->descriptor.bcdDevice [L3766] RET usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3767] input_dev->dev.parent = & intf->dev [L3768] CALL input_set_drvdata(input_dev, (void *)acecad) [L3565] FCALL dev_set_drvdata(& dev->dev, data) [L3768] RET input_set_drvdata(input_dev, (void *)acecad) [L3769] input_dev->open = & usb_acecad_open [L3770] input_dev->close = & usb_acecad_close [L3771] input_dev->evbit[0] = 10UL [L3772] input_dev->keybit[5] = 7169UL [L3773] id->driver_info [L3774] case 0UL: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3775] FCALL input_set_abs_params(input_dev, 0U, 0, 5000, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3776] FCALL input_set_abs_params(input_dev, 1U, 0, 3750, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3777] FCALL input_set_abs_params(input_dev, 24U, 0, 512, 0, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3778] tmp___5 = strlen((char const *)(& acecad->name)) [L3779] COND FALSE !(tmp___5 == 0UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3798] EXPR acecad->irq [L3798] EXPR acecad->data [L3799] EXPR endpoint->bInterval [L3798-L3799] CALL ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L4024] CALL ldv_fill_int_urb(complete_fn) [L4120] struct urb *value ; [L4121] int tmp___0 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-92233720368547758081:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-92233720368547758081:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] value = ldv_malloc(sizeof(struct urb)) [L4124] COND FALSE !((unsigned long )value == (unsigned long )((struct urb *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-92233720368547758081:0}] [L4128] CALL, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3516] int tmp ; [L3518] tmp = __VERIFIER_nondet_int() [L3519] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4128] RET, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_undef_int()=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-92233720368547758081:0}] [L4128] tmp___0 = ldv_undef_int() [L4129] COND FALSE !(tmp___0 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-92233720368547758081:0}] [L4024] RET ldv_fill_int_urb(complete_fn) [L3798-L3799] RET ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L3800] EXPR acecad->irq [L3800] EXPR acecad->data_dma [L3800] (acecad->irq)->transfer_dma = acecad->data_dma [L3801] EXPR acecad->irq [L3801] EXPR acecad->irq [L3801] EXPR (acecad->irq)->transfer_flags [L3801] (acecad->irq)->transfer_flags = (acecad->irq)->transfer_flags | 4U [L3802] EXPR acecad->input [L3802] CALL, EXPR input_register_device(acecad->input) [L4300] return __VERIFIER_nondet_int(); [L3802] RET, EXPR input_register_device(acecad->input) [L3802] err = input_register_device(acecad->input) [L3803] COND TRUE err != 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] EXPR acecad->data [L3810] EXPR acecad->data_dma VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->data={-73786976294838206465:0}, acecad->data_dma=18446744073709551632, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] FCALL usb_free_coherent(dev, 8UL, (void *)acecad->data, acecad->data_dma) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->data={-73786976294838206465:0}, acecad->data_dma=18446744073709551632, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3812] FCALL input_free_device(input_dev) [L3813] CALL kfree((void const *)acecad) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3813] RET kfree((void const *)acecad) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3814] return (err); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-36893488147419103231:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-110680464442257309697:0}, intf={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-73786976294838206465:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3901] RET, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3901] ldv_retval_0 = usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3902] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3930] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L3931] CALL usb_acecad_exit() [L3861] CALL ldv_usb_deregister_11(& usb_acecad_driver) [L4054] FCALL usb_deregister(arg) [L4055] ldv_state_variable_1 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg={12:0}, arg={12:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3861] RET ldv_usb_deregister_11(& usb_acecad_driver) [L3931] RET usb_acecad_exit() [L3932] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ldvarg0={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3965] CALL ldv_check_final_state() [L4267] COND TRUE URB_STATE != 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4268] CALL ldv_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4063] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-110680464442257309697:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 182.5s, OverallIterations: 21, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 112.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 360 mSolverCounterUnknown, 16432 SdHoareTripleChecker+Valid, 72.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16009 mSDsluCounter, 90967 SdHoareTripleChecker+Invalid, 65.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3994 IncrementalHoareTripleChecker+Unchecked, 83079 mSDsCounter, 5506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53391 IncrementalHoareTripleChecker+Invalid, 63251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5506 mSolverCounterUnsat, 7888 mSDtfsCounter, 53391 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3372 GetRequests, 2667 SyntacticMatches, 64 SemanticMatches, 641 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 19144 ImplicationChecksByTransitivity, 40.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7099occurred in iteration=17, InterpolantAutomatonStates: 434, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 34506 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 44.8s InterpolantComputationTime, 5123 NumberOfCodeBlocks, 4898 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 4845 ConstructedInterpolants, 314 QuantifiedInterpolants, 17887 SizeOfPredicates, 178 NumberOfNonLiveVariables, 15322 ConjunctsInSsa, 623 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 2454/2870 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-21 16:51:28,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.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_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:51:31,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:51:31,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:51:31,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:51:31,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:51:31,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:51:31,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:51:31,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:51:31,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:51:31,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:51:31,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:51:31,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:51:31,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:51:31,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:51:31,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:51:31,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:51:31,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:51:31,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:51:31,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:51:31,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:51:31,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:51:31,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:51:31,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:51:31,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:51:31,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:51:31,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:51:31,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:51:31,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:51:31,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:51:31,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:51:31,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:51:31,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:51:31,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:51:31,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:51:31,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:51:31,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:51:31,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:51:31,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:51:31,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:51:31,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:51:31,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:51:31,606 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-21 16:51:31,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:51:31,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:51:31,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:51:31,651 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:51:31,652 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:51:31,653 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:51:31,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:51:31,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:51:31,654 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:51:31,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:51:31,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:51:31,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:51:31,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:51:31,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:51:31,657 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:51:31,657 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 16:51:31,657 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 16:51:31,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:51:31,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:51:31,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:51:31,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:51:31,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:51:31,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:51:31,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:51:31,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:51:31,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:51:31,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:51:31,660 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 16:51:31,660 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 16:51:31,660 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:51:31,661 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:51:31,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:51:31,661 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 16:51:31,662 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/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_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-11-21 16:51:32,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:51:32,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:51:32,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:51:32,082 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:51:32,083 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:51:32,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/../../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 [2022-11-21 16:51:35,305 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:51:35,770 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:51:35,774 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/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 [2022-11-21 16:51:35,815 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/data/f67e290c0/ab31af4ecfc0484b8f0f7d13b94676a8/FLAG9e27a73f4 [2022-11-21 16:51:35,842 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_041c7370-c8b8-4156-9eb2-11c60546ddb8/bin/uautomizer-vX5HgA9Q3a/data/f67e290c0/ab31af4ecfc0484b8f0f7d13b94676a8 [2022-11-21 16:51:35,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:51:35,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:51:35,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:51:35,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:51:35,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:51:35,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:51:35" (1/1) ... [2022-11-21 16:51:35,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fedf436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:51:35, skipping insertion in model container [2022-11-21 16:51:35,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:51:35" (1/1) ... [2022-11-21 16:51:35,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:51:35,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:51:36,601 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: de.uni_freiburg.informatik.ultimate.boogie.typechecker.TypeCheckException: Type check failed for C: snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [3350] at de.uni_freiburg.informatik.ultimate.boogie.TypeErrorReporter.report(TypeErrorReporter.java:52) at de.uni_freiburg.informatik.ultimate.boogie.typechecker.TypeCheckHelper.typeCheckBinaryExpression(TypeCheckHelper.java:207) at de.uni_freiburg.informatik.ultimate.boogie.ExpressionFactory.constructBinaryExpression(ExpressionFactory.java:617) at de.uni_freiburg.informatik.ultimate.boogie.ExpressionFactory.newBinaryExpression(ExpressionFactory.java:132) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleSnPrintF(StandardFunctionHandler.java:971) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.lambda$21(StandardFunctionHandler.java:305) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1463) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:728) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1413) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1087) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1087) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1489) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3314) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2388) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:600) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-21 16:51:36,610 INFO L158 Benchmark]: Toolchain (without parser) took 761.86ms. Allocated memory is still 69.2MB. Free memory was 44.4MB in the beginning and 42.7MB in the end (delta: 1.7MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2022-11-21 16:51:36,610 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 56.6MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:51:36,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 757.65ms. Allocated memory is still 69.2MB. Free memory was 44.2MB in the beginning and 42.7MB in the end (delta: 1.5MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2022-11-21 16:51:36,613 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 56.6MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 757.65ms. Allocated memory is still 69.2MB. Free memory was 44.2MB in the beginning and 42.7MB in the end (delta: 1.5MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: TypeCheckException: Type check failed for C: snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [3350] de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: TypeCheckException: Type check failed for C: snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [3350]: de.uni_freiburg.informatik.ultimate.boogie.TypeErrorReporter.report(TypeErrorReporter.java:52) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: TypeCheckException: Type check failed for C: snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [3350]