./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-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 6b4ec56b 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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN --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 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- 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-6b4ec56 [2022-11-20 12:00:10,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:00:10,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:00:10,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:00:10,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:00:10,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:00:10,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:00:10,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:00:10,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:00:10,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:00:10,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:00:10,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:00:10,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:00:10,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:00:10,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:00:10,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:00:10,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:00:10,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:00:10,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:00:10,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:00:10,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:00:10,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:00:10,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:00:10,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:00:10,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:00:10,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:00:10,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:00:10,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:00:10,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:00:10,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:00:10,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:00:10,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:00:10,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:00:10,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:00:10,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:00:10,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:00:10,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:00:10,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:00:10,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:00:10,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:00:10,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:00:10,976 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 12:00:11,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:00:11,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:00:11,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:00:11,007 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:00:11,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:00:11,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:00:11,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:00:11,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:00:11,020 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:00:11,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:00:11,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:00:11,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:00:11,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:00:11,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:00:11,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:00:11,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:00:11,024 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:00:11,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:00:11,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:00:11,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:00:11,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:00:11,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:00:11,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:00:11,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:00:11,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:00:11,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:00:11,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:00:11,028 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:00:11,029 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:00:11,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:00:11,029 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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN 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 -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2022-11-20 12:00:11,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:00:11,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:00:11,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:00:11,464 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:00:11,465 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:00:11,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 12:00:15,479 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:00:16,041 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:00:16,042 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 12:00:16,089 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/data/7a08f57f4/c494fbd2ad964d40a4888b5e2a3f31b7/FLAG944d89394 [2022-11-20 12:00:16,115 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/data/7a08f57f4/c494fbd2ad964d40a4888b5e2a3f31b7 [2022-11-20 12:00:16,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:00:16,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:00:16,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:00:16,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:00:16,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:00:16,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:00:16" (1/1) ... [2022-11-20 12:00:16,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a042fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:16, skipping insertion in model container [2022-11-20 12:00:16,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:00:16" (1/1) ... [2022-11-20 12:00:16,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:00:16,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:00:17,463 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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-11-20 12:00:17,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:00:17,603 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:00:17,903 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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-11-20 12:00:17,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:00:17,976 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:00:17,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17 WrapperNode [2022-11-20 12:00:17,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:00:17,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:00:17,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:00:17,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:00:17,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,149 INFO L138 Inliner]: procedures = 107, calls = 317, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 790 [2022-11-20 12:00:18,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:00:18,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:00:18,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:00:18,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:00:18,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,264 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:00:18,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:00:18,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:00:18,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:00:18,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (1/1) ... [2022-11-20 12:00:18,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:00:18,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:00:18,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:00:18,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:00:18,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-20 12:00:18,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-20 12:00:18,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:00:18,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-20 12:00:18,377 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-20 12:00:18,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 12:00:18,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 12:00:18,378 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-20 12:00:18,378 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-20 12:00:18,379 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-20 12:00:18,379 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-20 12:00:18,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:00:18,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-20 12:00:18,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-20 12:00:18,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-20 12:00:18,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-20 12:00:18,380 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-20 12:00:18,381 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-20 12:00:18,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-20 12:00:18,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-20 12:00:18,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 12:00:18,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 12:00:18,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:00:18,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:00:18,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-20 12:00:18,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-20 12:00:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 12:00:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-20 12:00:18,383 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-20 12:00:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-20 12:00:18,384 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-20 12:00:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-20 12:00:18,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-20 12:00:18,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 12:00:18,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:00:18,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 12:00:18,385 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-20 12:00:18,386 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-20 12:00:18,386 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-20 12:00:18,386 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-20 12:00:18,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:00:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:00:18,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:00:18,837 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:00:18,841 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:00:18,951 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-20 12:00:19,896 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:00:19,920 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:00:19,921 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 12:00:19,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:00:19 BoogieIcfgContainer [2022-11-20 12:00:19,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:00:19,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:00:19,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:00:19,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:00:19,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:00:16" (1/3) ... [2022-11-20 12:00:19,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ee245a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:00:19, skipping insertion in model container [2022-11-20 12:00:19,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:00:17" (2/3) ... [2022-11-20 12:00:19,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ee245a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:00:19, skipping insertion in model container [2022-11-20 12:00:19,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:00:19" (3/3) ... [2022-11-20 12:00:19,948 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 12:00:19,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:00:19,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:00:20,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:00:20,050 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;@655b11e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:00:20,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:00:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 173 states have (on average 1.323699421965318) internal successors, (229), 185 states have internal predecessors, (229), 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-20 12:00:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 12:00:20,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:20,072 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-20 12:00:20,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1049381621, now seen corresponding path program 1 times [2022-11-20 12:00:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:20,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455222594] [2022-11-20 12:00:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:20,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:20,822 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-20 12:00:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:20,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455222594] [2022-11-20 12:00:20,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455222594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:20,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:20,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:00:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78012848] [2022-11-20 12:00:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:20,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:00:20,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:20,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:00:20,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:00:20,898 INFO L87 Difference]: Start difference. First operand has 233 states, 173 states have (on average 1.323699421965318) internal successors, (229), 185 states have internal predecessors, (229), 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-20 12:00:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:21,585 INFO L93 Difference]: Finished difference Result 468 states and 638 transitions. [2022-11-20 12:00:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:00:21,589 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-20 12:00:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:21,619 INFO L225 Difference]: With dead ends: 468 [2022-11-20 12:00:21,619 INFO L226 Difference]: Without dead ends: 229 [2022-11-20 12:00:21,630 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-20 12:00:21,640 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 88 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:21,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 412 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:00:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-20 12:00:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 222. [2022-11-20 12:00:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 168 states have (on average 1.2916666666666667) internal successors, (217), 174 states have internal predecessors, (217), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-20 12:00:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 290 transitions. [2022-11-20 12:00:21,756 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 290 transitions. Word has length 32 [2022-11-20 12:00:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:21,756 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 290 transitions. [2022-11-20 12:00:21,757 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-20 12:00:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 290 transitions. [2022-11-20 12:00:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 12:00:21,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:21,763 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-20 12:00:21,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:00:21,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:21,769 INFO L85 PathProgramCache]: Analyzing trace with hash -626679795, now seen corresponding path program 1 times [2022-11-20 12:00:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:21,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854654354] [2022-11-20 12:00:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:21,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:21,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:21,985 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-20 12:00:21,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:21,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854654354] [2022-11-20 12:00:21,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854654354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:21,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:21,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:00:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540981659] [2022-11-20 12:00:21,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:21,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:00:21,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:21,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:00:21,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:00:21,990 INFO L87 Difference]: Start difference. First operand 222 states and 290 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-20 12:00:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:22,973 INFO L93 Difference]: Finished difference Result 644 states and 848 transitions. [2022-11-20 12:00:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:00:22,974 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-20 12:00:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:22,985 INFO L225 Difference]: With dead ends: 644 [2022-11-20 12:00:22,985 INFO L226 Difference]: Without dead ends: 427 [2022-11-20 12:00:22,988 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-20 12:00:22,996 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 385 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:22,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 614 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 12:00:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-11-20 12:00:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 413. [2022-11-20 12:00:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 313 states have (on average 1.2843450479233227) internal successors, (402), 321 states have internal predecessors, (402), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-20 12:00:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 539 transitions. [2022-11-20 12:00:23,083 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 539 transitions. Word has length 32 [2022-11-20 12:00:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:23,084 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 539 transitions. [2022-11-20 12:00:23,085 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-20 12:00:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 539 transitions. [2022-11-20 12:00:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 12:00:23,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:23,098 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-20 12:00:23,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:00:23,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash -753559176, now seen corresponding path program 1 times [2022-11-20 12:00:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:23,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834290127] [2022-11-20 12:00:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:23,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:23,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:23,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:23,411 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-20 12:00:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:23,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834290127] [2022-11-20 12:00:23,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834290127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:23,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:23,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:00:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603884090] [2022-11-20 12:00:23,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:23,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:00:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:00:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:00:23,415 INFO L87 Difference]: Start difference. First operand 413 states and 539 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-20 12:00:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:24,581 INFO L93 Difference]: Finished difference Result 980 states and 1318 transitions. [2022-11-20 12:00:24,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:00:24,582 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-20 12:00:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:24,587 INFO L225 Difference]: With dead ends: 980 [2022-11-20 12:00:24,587 INFO L226 Difference]: Without dead ends: 582 [2022-11-20 12:00:24,589 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-20 12:00:24,590 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 628 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:24,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1466 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:00:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-20 12:00:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 416. [2022-11-20 12:00:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 316 states have (on average 1.2784810126582278) internal successors, (404), 324 states have internal predecessors, (404), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-20 12:00:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 541 transitions. [2022-11-20 12:00:24,638 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 541 transitions. Word has length 55 [2022-11-20 12:00:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:24,638 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 541 transitions. [2022-11-20 12:00:24,639 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-20 12:00:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 541 transitions. [2022-11-20 12:00:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 12:00:24,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:24,640 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-20 12:00:24,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:00:24,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:24,645 INFO L85 PathProgramCache]: Analyzing trace with hash -16242504, now seen corresponding path program 1 times [2022-11-20 12:00:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:24,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225077837] [2022-11-20 12:00:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:25,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:25,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:25,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:25,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:25,133 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-20 12:00:25,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:25,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225077837] [2022-11-20 12:00:25,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225077837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:25,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:25,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:00:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748523186] [2022-11-20 12:00:25,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:25,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:00:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:25,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:00:25,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:00:25,137 INFO L87 Difference]: Start difference. First operand 416 states and 541 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-20 12:00:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:26,125 INFO L93 Difference]: Finished difference Result 1245 states and 1638 transitions. [2022-11-20 12:00:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:00:26,126 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-20 12:00:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:26,132 INFO L225 Difference]: With dead ends: 1245 [2022-11-20 12:00:26,133 INFO L226 Difference]: Without dead ends: 844 [2022-11-20 12:00:26,134 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-20 12:00:26,135 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 325 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:26,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 766 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 12:00:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-11-20 12:00:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 806. [2022-11-20 12:00:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 617 states have (on average 1.2755267423014587) internal successors, (787), 629 states have internal predecessors, (787), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-20 12:00:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1052 transitions. [2022-11-20 12:00:26,220 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1052 transitions. Word has length 55 [2022-11-20 12:00:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:26,221 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1052 transitions. [2022-11-20 12:00:26,221 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-20 12:00:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1052 transitions. [2022-11-20 12:00:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 12:00:26,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:26,225 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-20 12:00:26,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:00:26,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:26,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash -503512716, now seen corresponding path program 1 times [2022-11-20 12:00:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:26,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967305127] [2022-11-20 12:00:26,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:26,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:26,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:26,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:26,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:26,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:26,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:26,566 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-20 12:00:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:26,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967305127] [2022-11-20 12:00:26,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967305127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:26,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:26,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:00:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127041948] [2022-11-20 12:00:26,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:26,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:00:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:00:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:00:26,570 INFO L87 Difference]: Start difference. First operand 806 states and 1052 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-20 12:00:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:27,211 INFO L93 Difference]: Finished difference Result 836 states and 1097 transitions. [2022-11-20 12:00:27,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:00:27,212 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-20 12:00:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:27,219 INFO L225 Difference]: With dead ends: 836 [2022-11-20 12:00:27,219 INFO L226 Difference]: Without dead ends: 833 [2022-11-20 12:00:27,220 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-20 12:00:27,222 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 279 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:27,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 538 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:00:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2022-11-20 12:00:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 805. [2022-11-20 12:00:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 617 states have (on average 1.273905996758509) internal successors, (786), 628 states have internal predecessors, (786), 133 states have call successors, (133), 55 states have call predecessors, (133), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-20 12:00:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1050 transitions. [2022-11-20 12:00:27,346 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1050 transitions. Word has length 56 [2022-11-20 12:00:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:27,348 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1050 transitions. [2022-11-20 12:00:27,348 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-20 12:00:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1050 transitions. [2022-11-20 12:00:27,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 12:00:27,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:27,352 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-20 12:00:27,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:00:27,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:27,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:27,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1570984763, now seen corresponding path program 1 times [2022-11-20 12:00:27,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:27,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745460553] [2022-11-20 12:00:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:27,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:27,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:27,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:27,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:27,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:27,640 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-20 12:00:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:27,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745460553] [2022-11-20 12:00:27,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745460553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:27,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:27,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:00:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988390817] [2022-11-20 12:00:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:27,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:00:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:27,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:00:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:00:27,645 INFO L87 Difference]: Start difference. First operand 805 states and 1050 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-20 12:00:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:28,288 INFO L93 Difference]: Finished difference Result 835 states and 1095 transitions. [2022-11-20 12:00:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:00:28,290 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-20 12:00:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:28,301 INFO L225 Difference]: With dead ends: 835 [2022-11-20 12:00:28,301 INFO L226 Difference]: Without dead ends: 832 [2022-11-20 12:00:28,303 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-20 12:00:28,306 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 276 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:28,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 534 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:00:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-11-20 12:00:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 804. [2022-11-20 12:00:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 617 states have (on average 1.2722852512155591) internal successors, (785), 627 states have internal predecessors, (785), 132 states have call successors, (132), 55 states have call predecessors, (132), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-20 12:00:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1048 transitions. [2022-11-20 12:00:28,412 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1048 transitions. Word has length 57 [2022-11-20 12:00:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:28,414 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1048 transitions. [2022-11-20 12:00:28,415 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-20 12:00:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1048 transitions. [2022-11-20 12:00:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 12:00:28,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:28,417 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-20 12:00:28,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:00:28,418 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:28,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1455902039, now seen corresponding path program 1 times [2022-11-20 12:00:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:28,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942153113] [2022-11-20 12:00:28,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:28,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:28,642 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-20 12:00:28,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:28,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942153113] [2022-11-20 12:00:28,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942153113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:28,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:28,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:00:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296720521] [2022-11-20 12:00:28,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:28,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:00:28,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:28,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:00:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:00:28,645 INFO L87 Difference]: Start difference. First operand 804 states and 1048 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-20 12:00:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:29,275 INFO L93 Difference]: Finished difference Result 834 states and 1093 transitions. [2022-11-20 12:00:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:00:29,276 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-20 12:00:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:29,281 INFO L225 Difference]: With dead ends: 834 [2022-11-20 12:00:29,281 INFO L226 Difference]: Without dead ends: 831 [2022-11-20 12:00:29,282 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-20 12:00:29,283 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 273 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:29,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 530 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:00:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-20 12:00:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 803. [2022-11-20 12:00:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 617 states have (on average 1.2706645056726094) internal successors, (784), 626 states have internal predecessors, (784), 131 states have call successors, (131), 55 states have call predecessors, (131), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-20 12:00:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1046 transitions. [2022-11-20 12:00:29,383 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1046 transitions. Word has length 58 [2022-11-20 12:00:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:29,383 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1046 transitions. [2022-11-20 12:00:29,384 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-20 12:00:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1046 transitions. [2022-11-20 12:00:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 12:00:29,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:29,385 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, 1] [2022-11-20 12:00:29,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:00:29,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2111657538, now seen corresponding path program 1 times [2022-11-20 12:00:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:29,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219076939] [2022-11-20 12:00:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:29,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:29,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:29,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:29,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:29,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:29,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:29,564 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-20 12:00:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:29,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219076939] [2022-11-20 12:00:29,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219076939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:29,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:29,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:00:29,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069956574] [2022-11-20 12:00:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:29,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:00:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:29,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:00:29,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:00:29,567 INFO L87 Difference]: Start difference. First operand 803 states and 1046 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 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-20 12:00:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:30,146 INFO L93 Difference]: Finished difference Result 833 states and 1091 transitions. [2022-11-20 12:00:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:00:30,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 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 59 [2022-11-20 12:00:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:30,153 INFO L225 Difference]: With dead ends: 833 [2022-11-20 12:00:30,154 INFO L226 Difference]: Without dead ends: 821 [2022-11-20 12:00:30,155 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-20 12:00:30,156 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 307 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:30,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 379 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:00:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-20 12:00:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 793. [2022-11-20 12:00:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 608 states have (on average 1.269736842105263) internal successors, (772), 616 states have internal predecessors, (772), 130 states have call successors, (130), 55 states have call predecessors, (130), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-20 12:00:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1033 transitions. [2022-11-20 12:00:30,254 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1033 transitions. Word has length 59 [2022-11-20 12:00:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:30,255 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1033 transitions. [2022-11-20 12:00:30,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 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-20 12:00:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1033 transitions. [2022-11-20 12:00:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-20 12:00:30,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:30,260 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:00:30,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:00:30,260 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:30,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash 329455673, now seen corresponding path program 1 times [2022-11-20 12:00:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:30,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044025272] [2022-11-20 12:00:30,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 12:00:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:00:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:00:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 12:00:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:00:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 12:00:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:00:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 12:00:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 12:00:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-20 12:00:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 12:00:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,594 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-20 12:00:30,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:30,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044025272] [2022-11-20 12:00:30,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044025272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:30,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:30,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:00:30,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857300440] [2022-11-20 12:00:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:30,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:00:30,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:30,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:00:30,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:00:30,598 INFO L87 Difference]: Start difference. First operand 793 states and 1033 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 12:00:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:31,386 INFO L93 Difference]: Finished difference Result 1663 states and 2181 transitions. [2022-11-20 12:00:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:00:31,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2022-11-20 12:00:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:31,392 INFO L225 Difference]: With dead ends: 1663 [2022-11-20 12:00:31,392 INFO L226 Difference]: Without dead ends: 885 [2022-11-20 12:00:31,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 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-20 12:00:31,396 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 95 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:31,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1040 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 12:00:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-11-20 12:00:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 847. [2022-11-20 12:00:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 661 states have (on average 1.2798789712556733) internal successors, (846), 669 states have internal predecessors, (846), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-20 12:00:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1107 transitions. [2022-11-20 12:00:31,499 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1107 transitions. Word has length 161 [2022-11-20 12:00:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:31,499 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 1107 transitions. [2022-11-20 12:00:31,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 12:00:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1107 transitions. [2022-11-20 12:00:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-20 12:00:31,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:31,505 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, 1, 1, 1, 1, 1] [2022-11-20 12:00:31,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:00:31,506 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:31,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1393720528, now seen corresponding path program 1 times [2022-11-20 12:00:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:31,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641657622] [2022-11-20 12:00:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:31,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:31,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:31,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:00:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:00:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:00:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 12:00:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:00:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 12:00:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 12:00:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-20 12:00:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-20 12:00:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 12:00:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:32,097 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-20 12:00:32,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:32,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641657622] [2022-11-20 12:00:32,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641657622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:32,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:32,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:00:32,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334869930] [2022-11-20 12:00:32,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:32,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:00:32,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:00:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:00:32,102 INFO L87 Difference]: Start difference. First operand 847 states and 1107 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 12:00:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:33,034 INFO L93 Difference]: Finished difference Result 2277 states and 3066 transitions. [2022-11-20 12:00:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:00:33,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 170 [2022-11-20 12:00:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:33,044 INFO L225 Difference]: With dead ends: 2277 [2022-11-20 12:00:33,044 INFO L226 Difference]: Without dead ends: 1449 [2022-11-20 12:00:33,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 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-20 12:00:33,051 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 460 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:33,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1480 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:00:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2022-11-20 12:00:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 859. [2022-11-20 12:00:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 673 states have (on average 1.274888558692422) internal successors, (858), 681 states have internal predecessors, (858), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-20 12:00:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1119 transitions. [2022-11-20 12:00:33,207 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1119 transitions. Word has length 170 [2022-11-20 12:00:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:33,208 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1119 transitions. [2022-11-20 12:00:33,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 12:00:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1119 transitions. [2022-11-20 12:00:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-20 12:00:33,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:33,213 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:00:33,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:00:33,214 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:33,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1466012247, now seen corresponding path program 1 times [2022-11-20 12:00:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:33,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457039223] [2022-11-20 12:00:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:00:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:00:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:00:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-20 12:00:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 12:00:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-20 12:00:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-20 12:00:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 12:00:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 12:00:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 12:00:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:33,783 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-20 12:00:33,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:33,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457039223] [2022-11-20 12:00:33,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457039223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:00:33,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072798399] [2022-11-20 12:00:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:33,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:00:33,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:00:33,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:00:33,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:00:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:34,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:00:34,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:00:34,560 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-20 12:00:34,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:00:34,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072798399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:34,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:00:34,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 12:00:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34428199] [2022-11-20 12:00:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:00:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:00:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:00:34,565 INFO L87 Difference]: Start difference. First operand 859 states and 1119 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 12:00:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:35,044 INFO L93 Difference]: Finished difference Result 2785 states and 3660 transitions. [2022-11-20 12:00:35,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:00:35,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2022-11-20 12:00:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:35,056 INFO L225 Difference]: With dead ends: 2785 [2022-11-20 12:00:35,056 INFO L226 Difference]: Without dead ends: 1945 [2022-11-20 12:00:35,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 204 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-20 12:00:35,060 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 393 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1859 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-20 12:00:35,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1859 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:00:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2022-11-20 12:00:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 895. [2022-11-20 12:00:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 701 states have (on average 1.2639087018544937) internal successors, (886), 709 states have internal predecessors, (886), 138 states have call successors, (138), 56 states have call predecessors, (138), 55 states have return successors, (139), 137 states have call predecessors, (139), 137 states have call successors, (139) [2022-11-20 12:00:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1163 transitions. [2022-11-20 12:00:35,280 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1163 transitions. Word has length 172 [2022-11-20 12:00:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:35,282 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 1163 transitions. [2022-11-20 12:00:35,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 12:00:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1163 transitions. [2022-11-20 12:00:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-20 12:00:35,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:35,287 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:00:35,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:00:35,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 12:00:35,497 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:35,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash 454894997, now seen corresponding path program 1 times [2022-11-20 12:00:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:35,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894697896] [2022-11-20 12:00:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:00:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:00:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:00:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-20 12:00:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 12:00:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-20 12:00:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-20 12:00:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 12:00:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 12:00:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 12:00:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:36,462 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-20 12:00:36,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:36,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894697896] [2022-11-20 12:00:36,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894697896] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:00:36,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360956757] [2022-11-20 12:00:36,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:36,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:00:36,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:00:36,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:00:36,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:00:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:37,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-20 12:00:37,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:00:37,187 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-20 12:00:37,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:00:37,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360956757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:37,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:00:37,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-11-20 12:00:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566453668] [2022-11-20 12:00:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:37,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:00:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:37,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:00:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:00:37,191 INFO L87 Difference]: Start difference. First operand 895 states and 1163 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 12:00:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:37,392 INFO L93 Difference]: Finished difference Result 1787 states and 2335 transitions. [2022-11-20 12:00:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:00:37,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2022-11-20 12:00:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:37,399 INFO L225 Difference]: With dead ends: 1787 [2022-11-20 12:00:37,399 INFO L226 Difference]: Without dead ends: 903 [2022-11-20 12:00:37,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:00:37,403 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:37,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1098 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:00:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-11-20 12:00:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2022-11-20 12:00:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 705 states have (on average 1.2624113475177305) internal successors, (890), 717 states have internal predecessors, (890), 138 states have call successors, (138), 56 states have call predecessors, (138), 59 states have return successors, (151), 137 states have call predecessors, (151), 137 states have call successors, (151) [2022-11-20 12:00:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1179 transitions. [2022-11-20 12:00:37,639 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1179 transitions. Word has length 172 [2022-11-20 12:00:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:37,640 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1179 transitions. [2022-11-20 12:00:37,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 12:00:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1179 transitions. [2022-11-20 12:00:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-20 12:00:37,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:37,645 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:00:37,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:00:37,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:00:37,855 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash 654827607, now seen corresponding path program 1 times [2022-11-20 12:00:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:37,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30316569] [2022-11-20 12:00:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:38,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:38,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:38,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:00:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:00:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:00:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:00:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 12:00:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 12:00:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 12:00:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 12:00:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 12:00:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-20 12:00:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,408 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-20 12:00:39,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:39,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30316569] [2022-11-20 12:00:39,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30316569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:00:39,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652030412] [2022-11-20 12:00:39,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:39,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:00:39,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:00:39,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:00:39,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:00:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:39,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-20 12:00:39,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:00:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-20 12:00:40,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:00:40,543 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-20 12:00:40,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652030412] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:00:40,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:00:40,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2022-11-20 12:00:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504643332] [2022-11-20 12:00:40,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:00:40,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 12:00:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:40,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 12:00:40,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-11-20 12:00:40,546 INFO L87 Difference]: Start difference. First operand 903 states and 1179 transitions. Second operand has 20 states, 20 states have (on average 6.9) internal successors, (138), 12 states have internal predecessors, (138), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-20 12:00:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:42,398 INFO L93 Difference]: Finished difference Result 2021 states and 2668 transitions. [2022-11-20 12:00:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 12:00:42,399 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.9) internal successors, (138), 12 states have internal predecessors, (138), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) Word has length 178 [2022-11-20 12:00:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:42,404 INFO L225 Difference]: With dead ends: 2021 [2022-11-20 12:00:42,404 INFO L226 Difference]: Without dead ends: 1137 [2022-11-20 12:00:42,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 382 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-11-20 12:00:42,407 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 190 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:42,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 3504 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 12:00:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-11-20 12:00:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 943. [2022-11-20 12:00:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 737 states have (on average 1.2510176390773406) internal successors, (922), 745 states have internal predecessors, (922), 142 states have call successors, (142), 56 states have call predecessors, (142), 63 states have return successors, (167), 149 states have call predecessors, (167), 141 states have call successors, (167) [2022-11-20 12:00:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1231 transitions. [2022-11-20 12:00:42,549 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1231 transitions. Word has length 178 [2022-11-20 12:00:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:42,549 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1231 transitions. [2022-11-20 12:00:42,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.9) internal successors, (138), 12 states have internal predecessors, (138), 4 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-20 12:00:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1231 transitions. [2022-11-20 12:00:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-20 12:00:42,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:42,554 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:00:42,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:00:42,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:00:42,763 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:42,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash 87736087, now seen corresponding path program 2 times [2022-11-20 12:00:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:42,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648193623] [2022-11-20 12:00:42,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:42,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:00:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:00:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:00:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:00:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:00:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 12:00:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 12:00:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 12:00:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-20 12:00:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-20 12:00:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-20 12:00:43,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:43,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648193623] [2022-11-20 12:00:43,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648193623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:43,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:43,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:00:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315073955] [2022-11-20 12:00:43,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:43,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:00:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:00:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:00:43,643 INFO L87 Difference]: Start difference. First operand 943 states and 1231 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 4 states have internal predecessors, (110), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-20 12:00:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:44,706 INFO L93 Difference]: Finished difference Result 2513 states and 3396 transitions. [2022-11-20 12:00:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:00:44,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 4 states have internal predecessors, (110), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 190 [2022-11-20 12:00:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:44,715 INFO L225 Difference]: With dead ends: 2513 [2022-11-20 12:00:44,715 INFO L226 Difference]: Without dead ends: 1589 [2022-11-20 12:00:44,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:00:44,719 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 316 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:44,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1687 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 12:00:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2022-11-20 12:00:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 963. [2022-11-20 12:00:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 753 states have (on average 1.250996015936255) internal successors, (942), 757 states have internal predecessors, (942), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (171), 157 states have call predecessors, (171), 145 states have call successors, (171) [2022-11-20 12:00:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1259 transitions. [2022-11-20 12:00:44,881 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1259 transitions. Word has length 190 [2022-11-20 12:00:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:44,882 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1259 transitions. [2022-11-20 12:00:44,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 4 states have internal predecessors, (110), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-20 12:00:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1259 transitions. [2022-11-20 12:00:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-20 12:00:44,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:44,887 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:00:44,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:00:44,888 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1482252947, now seen corresponding path program 3 times [2022-11-20 12:00:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:44,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6479990] [2022-11-20 12:00:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:00:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:00:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:00:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:00:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:45,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:00:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:46,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:46,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-20 12:00:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:46,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 12:00:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:46,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:46,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 12:00:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:46,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-20 12:00:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-20 12:00:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-20 12:00:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6479990] [2022-11-20 12:00:46,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6479990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:00:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92487868] [2022-11-20 12:00:46,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:00:46,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:00:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:00:46,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:00:46,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:00:46,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 12:00:46,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:00:46,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 12:00:46,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:00:47,110 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-20 12:00:47,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:00:47,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92487868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:47,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:00:47,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-11-20 12:00:47,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110823149] [2022-11-20 12:00:47,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:47,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:00:47,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:47,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:00:47,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:00:47,114 INFO L87 Difference]: Start difference. First operand 963 states and 1259 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 12:00:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:48,240 INFO L93 Difference]: Finished difference Result 2743 states and 3676 transitions. [2022-11-20 12:00:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:00:48,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 190 [2022-11-20 12:00:48,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:48,250 INFO L225 Difference]: With dead ends: 2743 [2022-11-20 12:00:48,251 INFO L226 Difference]: Without dead ends: 1789 [2022-11-20 12:00:48,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:00:48,257 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 690 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:48,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1292 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 12:00:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-11-20 12:00:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1201. [2022-11-20 12:00:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 948 states have (on average 1.2373417721518987) internal successors, (1173), 954 states have internal predecessors, (1173), 167 states have call successors, (167), 74 states have call predecessors, (167), 85 states have return successors, (204), 184 states have call predecessors, (204), 166 states have call successors, (204) [2022-11-20 12:00:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1544 transitions. [2022-11-20 12:00:48,557 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1544 transitions. Word has length 190 [2022-11-20 12:00:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:48,557 INFO L495 AbstractCegarLoop]: Abstraction has 1201 states and 1544 transitions. [2022-11-20 12:00:48,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 12:00:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1544 transitions. [2022-11-20 12:00:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-11-20 12:00:48,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:48,563 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:00:48,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:00:48,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 12:00:48,770 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:48,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:48,771 INFO L85 PathProgramCache]: Analyzing trace with hash 964568900, now seen corresponding path program 1 times [2022-11-20 12:00:48,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:48,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557048525] [2022-11-20 12:00:48,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:48,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:00:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:00:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:00:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:00:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:00:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 12:00:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 12:00:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 12:00:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-20 12:00:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-20 12:00:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-11-20 12:00:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:49,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557048525] [2022-11-20 12:00:49,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557048525] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:00:49,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078502497] [2022-11-20 12:00:49,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:49,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:00:49,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:00:49,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:00:49,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:00:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:49,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 1859 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:00:49,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:00:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-20 12:00:50,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:00:50,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078502497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:50,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:00:50,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-20 12:00:50,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598946695] [2022-11-20 12:00:50,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:50,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:00:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:00:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:00:50,224 INFO L87 Difference]: Start difference. First operand 1201 states and 1544 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, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-20 12:00:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:50,960 INFO L93 Difference]: Finished difference Result 3239 states and 4168 transitions. [2022-11-20 12:00:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:00:50,961 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, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 212 [2022-11-20 12:00:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:50,976 INFO L225 Difference]: With dead ends: 3239 [2022-11-20 12:00:50,977 INFO L226 Difference]: Without dead ends: 3231 [2022-11-20 12:00:50,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:00:50,980 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 400 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:50,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1038 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:00:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2022-11-20 12:00:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3215. [2022-11-20 12:00:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3215 states, 2535 states have (on average 1.2402366863905325) internal successors, (3144), 2557 states have internal predecessors, (3144), 450 states have call successors, (450), 196 states have call predecessors, (450), 229 states have return successors, (551), 493 states have call predecessors, (551), 449 states have call successors, (551) [2022-11-20 12:00:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4145 transitions. [2022-11-20 12:00:51,656 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4145 transitions. Word has length 212 [2022-11-20 12:00:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:51,660 INFO L495 AbstractCegarLoop]: Abstraction has 3215 states and 4145 transitions. [2022-11-20 12:00:51,661 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, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-20 12:00:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4145 transitions. [2022-11-20 12:00:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-20 12:00:51,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:51,668 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2022-11-20 12:00:51,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:00:51,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 12:00:51,878 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash 553725376, now seen corresponding path program 1 times [2022-11-20 12:00:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:51,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692956322] [2022-11-20 12:00:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:51,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:00:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:00:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:00:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:00:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:00:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-20 12:00:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 12:00:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 12:00:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-20 12:00:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-20 12:00:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:52,346 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-20 12:00:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:52,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692956322] [2022-11-20 12:00:52,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692956322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:52,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:52,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:00:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611418696] [2022-11-20 12:00:52,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:52,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:00:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:00:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:00:52,351 INFO L87 Difference]: Start difference. First operand 3215 states and 4145 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-20 12:00:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:54,531 INFO L93 Difference]: Finished difference Result 9041 states and 11728 transitions. [2022-11-20 12:00:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 12:00:54,532 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 206 [2022-11-20 12:00:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:54,562 INFO L225 Difference]: With dead ends: 9041 [2022-11-20 12:00:54,562 INFO L226 Difference]: Without dead ends: 5845 [2022-11-20 12:00:54,571 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-20 12:00:54,571 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 554 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:54,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1274 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:00:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5845 states. [2022-11-20 12:00:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5845 to 5331. [2022-11-20 12:00:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 4174 states have (on average 1.24436990896023) internal successors, (5194), 4240 states have internal predecessors, (5194), 767 states have call successors, (767), 334 states have call predecessors, (767), 389 states have return successors, (934), 808 states have call predecessors, (934), 766 states have call successors, (934) [2022-11-20 12:00:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 6895 transitions. [2022-11-20 12:00:55,627 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 6895 transitions. Word has length 206 [2022-11-20 12:00:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:55,628 INFO L495 AbstractCegarLoop]: Abstraction has 5331 states and 6895 transitions. [2022-11-20 12:00:55,629 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-20 12:00:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 6895 transitions. [2022-11-20 12:00:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-20 12:00:55,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:55,639 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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] [2022-11-20 12:00:55,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:00:55,639 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:00:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1626504644, now seen corresponding path program 1 times [2022-11-20 12:00:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:55,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058671005] [2022-11-20 12:00:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:00:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:00:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:00:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:00:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:00:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:00:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:00:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-20 12:00:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 12:00:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 12:00:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-20 12:00:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-20 12:00:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-20 12:00:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-20 12:00:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:57,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058671005] [2022-11-20 12:00:57,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058671005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:00:57,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460297563] [2022-11-20 12:00:57,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:57,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:00:57,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:00:57,325 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:00:57,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:00:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:58,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-20 12:00:58,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:00:58,059 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-20 12:00:58,136 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-20 12:00:58,896 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-20 12:00:58,905 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1129 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1129) |c_#memory_int|)) is different from true [2022-11-20 12:00:59,000 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-20 12:00:59,004 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-20 12:00:59,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:00:59,054 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-20 12:00:59,074 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:00:59,074 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-20 12:00:59,242 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-20 12:00:59,404 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-20 12:00:59,543 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:00:59,544 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-20 12:01:00,115 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-20 12:01:00,849 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 12:01:00,849 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-20 12:01:01,994 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-20 12:01:02,431 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-20 12:01:02,452 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-20 12:01:02,758 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-20 12:01:02,771 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-20 12:01:02,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:01:02,798 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-20 12:01:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 56 refuted. 10 times theorem prover too weak. 27 trivial. 2 not checked. [2022-11-20 12:01:02,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:01:04,876 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (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_1139) |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-20 12:01:04,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460297563] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:01:04,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:01:04,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 50 [2022-11-20 12:01:04,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218875031] [2022-11-20 12:01:04,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:01:04,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-20 12:01:04,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:01:04,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-20 12:01:04,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2176, Unknown=26, NotChecked=190, Total=2550 [2022-11-20 12:01:04,903 INFO L87 Difference]: Start difference. First operand 5331 states and 6895 transitions. Second operand has 50 states, 47 states have (on average 5.48936170212766) internal successors, (258), 36 states have internal predecessors, (258), 15 states have call successors, (40), 11 states have call predecessors, (40), 15 states have return successors, (40), 19 states have call predecessors, (40), 15 states have call successors, (40) [2022-11-20 12:01:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:01:09,925 INFO L93 Difference]: Finished difference Result 14334 states and 19014 transitions. [2022-11-20 12:01:09,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-20 12:01:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 5.48936170212766) internal successors, (258), 36 states have internal predecessors, (258), 15 states have call successors, (40), 11 states have call predecessors, (40), 15 states have return successors, (40), 19 states have call predecessors, (40), 15 states have call successors, (40) Word has length 213 [2022-11-20 12:01:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:01:10,010 INFO L225 Difference]: With dead ends: 14334 [2022-11-20 12:01:10,010 INFO L226 Difference]: Without dead ends: 9022 [2022-11-20 12:01:10,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 248 SyntacticMatches, 17 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=352, Invalid=5778, Unknown=40, NotChecked=310, Total=6480 [2022-11-20 12:01:10,026 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 650 mSDsluCounter, 12303 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 12820 SdHoareTripleChecker+Invalid, 4458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2572 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:01:10,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 12820 Invalid, 4458 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 1774 Invalid, 0 Unknown, 2572 Unchecked, 1.8s Time] [2022-11-20 12:01:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9022 states. [2022-11-20 12:01:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9022 to 5573. [2022-11-20 12:01:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5573 states, 4376 states have (on average 1.2449725776965266) internal successors, (5448), 4446 states have internal predecessors, (5448), 782 states have call successors, (782), 355 states have call predecessors, (782), 414 states have return successors, (955), 823 states have call predecessors, (955), 781 states have call successors, (955) [2022-11-20 12:01:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 7185 transitions. [2022-11-20 12:01:11,282 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 7185 transitions. Word has length 213 [2022-11-20 12:01:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:01:11,283 INFO L495 AbstractCegarLoop]: Abstraction has 5573 states and 7185 transitions. [2022-11-20 12:01:11,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 5.48936170212766) internal successors, (258), 36 states have internal predecessors, (258), 15 states have call successors, (40), 11 states have call predecessors, (40), 15 states have return successors, (40), 19 states have call predecessors, (40), 15 states have call successors, (40) [2022-11-20 12:01:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 7185 transitions. [2022-11-20 12:01:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-11-20 12:01:11,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:01:11,294 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:01:11,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:01:11,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 12:01:11,505 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:01:11,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:01:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash -251431110, now seen corresponding path program 2 times [2022-11-20 12:01:11,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:01:11,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477559845] [2022-11-20 12:01:11,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:01:11,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:01:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:01:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:01:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:01:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:01:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:01:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:01:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:01:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:01:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:01:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:01:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:01:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:01:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 12:01:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 12:01:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:01:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 12:01:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-20 12:01:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-20 12:01:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-20 12:01:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-20 12:01:13,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:01:13,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477559845] [2022-11-20 12:01:13,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477559845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:01:13,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035259883] [2022-11-20 12:01:13,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:01:13,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:01:13,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:01:13,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:01:13,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:02:05,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:02:05,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:02:05,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 1873 conjuncts, 161 conjunts are in the unsatisfiable core [2022-11-20 12:02:05,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:02:05,511 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-20 12:02:05,553 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-20 12:02:06,081 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-20 12:02:06,087 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1432 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1432) |c_#memory_int|)) is different from true [2022-11-20 12:02:06,206 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-20 12:02:06,210 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-20 12:02:06,311 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:02:06,312 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-20 12:02:06,324 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-20 12:02:06,610 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-20 12:02:06,738 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-20 12:02:06,842 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:02:06,842 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-20 12:02:07,297 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-20 12:02:07,497 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-20 12:02:08,096 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 12:02:08,096 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 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 12:02:08,305 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 12:02:08,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 12:02:08,805 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 12:02:08,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 12:02:09,273 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-11-20 12:02:09,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 32 [2022-11-20 12:02:09,292 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 10 treesize of output 9 [2022-11-20 12:02:10,227 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-11-20 12:02:10,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2022-11-20 12:02:10,283 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 10 treesize of output 9 [2022-11-20 12:02:10,553 INFO L321 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2022-11-20 12:02:10,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2022-11-20 12:02:10,622 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 15 treesize of output 19 [2022-11-20 12:02:11,745 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 33 treesize of output 35 [2022-11-20 12:02:11,905 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 33 treesize of output 35 [2022-11-20 12:02:12,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:02:12,224 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 52 treesize of output 46 [2022-11-20 12:02:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 30 proven. 88 refuted. 6 times theorem prover too weak. 15 trivial. 2 not checked. [2022-11-20 12:02:12,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:02:12,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1449) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |c_ULTIMATE.start_usb_acecad_probe_~id#1.offset|)))) is different from false [2022-11-20 12:02:12,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035259883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:02:12,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:02:12,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 49] total 56 [2022-11-20 12:02:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807292897] [2022-11-20 12:02:12,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:02:12,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-20 12:02:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:02:12,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-20 12:02:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2681, Unknown=14, NotChecked=214, Total=3192 [2022-11-20 12:02:12,356 INFO L87 Difference]: Start difference. First operand 5573 states and 7185 transitions. Second operand has 56 states, 53 states have (on average 4.943396226415095) internal successors, (262), 41 states have internal predecessors, (262), 17 states have call successors, (40), 14 states have call predecessors, (40), 17 states have return successors, (40), 21 states have call predecessors, (40), 17 states have call successors, (40) [2022-11-20 12:02:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:02:16,544 INFO L93 Difference]: Finished difference Result 13440 states and 17664 transitions. [2022-11-20 12:02:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-20 12:02:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 4.943396226415095) internal successors, (262), 41 states have internal predecessors, (262), 17 states have call successors, (40), 14 states have call predecessors, (40), 17 states have return successors, (40), 21 states have call predecessors, (40), 17 states have call successors, (40) Word has length 219 [2022-11-20 12:02:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:02:16,581 INFO L225 Difference]: With dead ends: 13440 [2022-11-20 12:02:16,581 INFO L226 Difference]: Without dead ends: 8076 [2022-11-20 12:02:16,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 247 SyntacticMatches, 18 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=555, Invalid=6240, Unknown=19, NotChecked=326, Total=7140 [2022-11-20 12:02:16,595 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 699 mSDsluCounter, 9858 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 10348 SdHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2075 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:02:16,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 10348 Invalid, 3392 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [113 Valid, 1204 Invalid, 0 Unknown, 2075 Unchecked, 1.2s Time] [2022-11-20 12:02:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8076 states. [2022-11-20 12:02:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8076 to 5775. [2022-11-20 12:02:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5775 states, 4548 states have (on average 1.2401055408970976) internal successors, (5640), 4594 states have internal predecessors, (5640), 796 states have call successors, (796), 367 states have call predecessors, (796), 430 states have return successors, (973), 865 states have call predecessors, (973), 795 states have call successors, (973) [2022-11-20 12:02:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 7409 transitions. [2022-11-20 12:02:17,795 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 7409 transitions. Word has length 219 [2022-11-20 12:02:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:02:17,796 INFO L495 AbstractCegarLoop]: Abstraction has 5775 states and 7409 transitions. [2022-11-20 12:02:17,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 4.943396226415095) internal successors, (262), 41 states have internal predecessors, (262), 17 states have call successors, (40), 14 states have call predecessors, (40), 17 states have return successors, (40), 21 states have call predecessors, (40), 17 states have call successors, (40) [2022-11-20 12:02:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 7409 transitions. [2022-11-20 12:02:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-20 12:02:17,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:02:17,808 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 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] [2022-11-20 12:02:17,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 12:02:18,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:02:18,023 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:02:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:02:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1659120452, now seen corresponding path program 1 times [2022-11-20 12:02:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:02:18,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213747979] [2022-11-20 12:02:18,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:02:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:23,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:23,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:02:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:02:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:23,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:02:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:02:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:02:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:02:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:02:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:02:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 12:02:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 12:02:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-20 12:02:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-20 12:02:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-20 12:02:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-20 12:02:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 11 proven. 53 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-20 12:02:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:02:25,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213747979] [2022-11-20 12:02:25,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213747979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:02:25,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240681493] [2022-11-20 12:02:25,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:25,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:02:25,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:02:25,755 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:02:25,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 12:02:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:26,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-20 12:02:26,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:02:26,497 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-20 12:02:26,580 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-20 12:02:27,180 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-20 12:02:27,185 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1746 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1746) |c_#memory_int|)) is different from true [2022-11-20 12:02:27,371 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-20 12:02:27,375 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-20 12:02:27,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:02:27,419 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-20 12:02:27,444 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 12:02:27,445 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-20 12:02:27,590 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-20 12:02:27,789 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-20 12:02:28,123 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:02:28,123 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-20 12:02:29,417 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-20 12:02:29,648 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-20 12:02:30,441 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 12:02:30,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 12:02:30,747 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-20 12:02:31,573 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 12:02:31,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-20 12:02:32,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-20 12:02:32,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-20 12:02:32,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-20 12:02:33,381 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-20 12:02:33,481 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-20 12:02:33,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:02:33,501 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-20 12:02:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 28 proven. 95 refuted. 5 times theorem prover too weak. 43 trivial. 2 not checked. [2022-11-20 12:02:33,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:02:33,607 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (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_1758) |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-20 12:02:33,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240681493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:02:33,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:02:33,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 49] total 86 [2022-11-20 12:02:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592514766] [2022-11-20 12:02:33,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:02:33,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-11-20 12:02:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:02:33,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-11-20 12:02:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=6755, Unknown=13, NotChecked=334, Total=7482 [2022-11-20 12:02:33,637 INFO L87 Difference]: Start difference. First operand 5775 states and 7409 transitions. Second operand has 86 states, 81 states have (on average 3.3333333333333335) internal successors, (270), 68 states have internal predecessors, (270), 28 states have call successors, (44), 13 states have call predecessors, (44), 23 states have return successors, (45), 33 states have call predecessors, (45), 28 states have call successors, (45) [2022-11-20 12:02:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:02:45,307 INFO L93 Difference]: Finished difference Result 13664 states and 17942 transitions. [2022-11-20 12:02:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 12:02:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 81 states have (on average 3.3333333333333335) internal successors, (270), 68 states have internal predecessors, (270), 28 states have call successors, (44), 13 states have call predecessors, (44), 23 states have return successors, (45), 33 states have call predecessors, (45), 28 states have call successors, (45) Word has length 225 [2022-11-20 12:02:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:02:45,339 INFO L225 Difference]: With dead ends: 13664 [2022-11-20 12:02:45,340 INFO L226 Difference]: Without dead ends: 8218 [2022-11-20 12:02:45,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 263 SyntacticMatches, 17 SemanticMatches, 121 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5317 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=777, Invalid=13728, Unknown=23, NotChecked=478, Total=15006 [2022-11-20 12:02:45,357 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 1392 mSDsluCounter, 13782 mSDsCounter, 0 mSdLazyCounter, 7069 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 14156 SdHoareTripleChecker+Invalid, 10715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 7069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3205 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:02:45,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 14156 Invalid, 10715 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [441 Valid, 7069 Invalid, 0 Unknown, 3205 Unchecked, 7.3s Time] [2022-11-20 12:02:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2022-11-20 12:02:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 5946. [2022-11-20 12:02:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5946 states, 4675 states have (on average 1.240427807486631) internal successors, (5799), 4729 states have internal predecessors, (5799), 826 states have call successors, (826), 377 states have call predecessors, (826), 444 states have return successors, (1013), 893 states have call predecessors, (1013), 825 states have call successors, (1013) [2022-11-20 12:02:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5946 states to 5946 states and 7638 transitions. [2022-11-20 12:02:46,563 INFO L78 Accepts]: Start accepts. Automaton has 5946 states and 7638 transitions. Word has length 225 [2022-11-20 12:02:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:02:46,564 INFO L495 AbstractCegarLoop]: Abstraction has 5946 states and 7638 transitions. [2022-11-20 12:02:46,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 81 states have (on average 3.3333333333333335) internal successors, (270), 68 states have internal predecessors, (270), 28 states have call successors, (44), 13 states have call predecessors, (44), 23 states have return successors, (45), 33 states have call predecessors, (45), 28 states have call successors, (45) [2022-11-20 12:02:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5946 states and 7638 transitions. [2022-11-20 12:02:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-11-20 12:02:46,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:02:46,576 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 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] [2022-11-20 12:02:46,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 12:02:46,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:02:46,786 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:02:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:02:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash -218374178, now seen corresponding path program 1 times [2022-11-20 12:02:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:02:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734559852] [2022-11-20 12:02:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:02:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:51,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:51,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:02:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:51,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 12:02:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:51,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:02:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:02:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:02:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:52,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:02:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 12:02:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 12:02:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 12:02:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 12:02:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-20 12:02:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-20 12:02:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-20 12:02:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-20 12:02:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 7 proven. 58 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-20 12:02:53,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:02:53,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734559852] [2022-11-20 12:02:53,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734559852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:02:53,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695904315] [2022-11-20 12:02:53,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:53,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:02:53,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:02:53,592 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:02:53,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 12:02:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:54,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 153 conjunts are in the unsatisfiable core [2022-11-20 12:02:54,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:02:54,365 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-20 12:02:54,462 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-20 12:02:55,072 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-20 12:02:55,078 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2068 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2068) |c_#memory_int|)) is different from true [2022-11-20 12:02:55,264 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-20 12:02:55,267 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-20 12:02:55,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:02:55,302 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-20 12:02:55,328 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 12:02:55,329 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-20 12:02:55,493 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-20 12:02:55,735 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-20 12:02:56,119 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 12:02:56,120 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-20 12:02:57,490 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-20 12:02:57,612 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-20 12:02:58,425 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 12:02:58,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 12:02:58,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 12:02:59,812 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-20 12:02:59,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 12:03:00,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-20 12:03:01,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-20 12:03:01,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-20 12:03:01,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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-20 12:03:01,843 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-20 12:03:01,933 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-20 12:03:01,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:03:01,961 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-20 12:03:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 28 proven. 105 refuted. 0 times theorem prover too weak. 39 trivial. 2 not checked. [2022-11-20 12:03:01,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:03:01,989 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (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_2080) |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-20 12:03:02,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695904315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:03:02,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 12:03:02,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48] total 84 [2022-11-20 12:03:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300037346] [2022-11-20 12:03:02,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 12:03:02,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-20 12:03:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-20 12:03:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=6416, Unknown=15, NotChecked=326, Total=7140 [2022-11-20 12:03:02,019 INFO L87 Difference]: Start difference. First operand 5946 states and 7638 transitions. Second operand has 84 states, 79 states have (on average 3.392405063291139) internal successors, (268), 66 states have internal predecessors, (268), 26 states have call successors, (43), 13 states have call predecessors, (43), 22 states have return successors, (44), 32 states have call predecessors, (44), 26 states have call successors, (44) [2022-11-20 12:03:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:17,807 INFO L93 Difference]: Finished difference Result 14925 states and 19517 transitions. [2022-11-20 12:03:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-20 12:03:17,808 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 79 states have (on average 3.392405063291139) internal successors, (268), 66 states have internal predecessors, (268), 26 states have call successors, (43), 13 states have call predecessors, (43), 22 states have return successors, (44), 32 states have call predecessors, (44), 26 states have call successors, (44) Word has length 226 [2022-11-20 12:03:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:17,840 INFO L225 Difference]: With dead ends: 14925 [2022-11-20 12:03:17,841 INFO L226 Difference]: Without dead ends: 9427 [2022-11-20 12:03:17,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 265 SyntacticMatches, 19 SemanticMatches, 145 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7035 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1142, Invalid=19720, Unknown=26, NotChecked=574, Total=21462 [2022-11-20 12:03:17,860 INFO L413 NwaCegarLoop]: 502 mSDtfsCounter, 2210 mSDsluCounter, 13172 mSDsCounter, 0 mSdLazyCounter, 7734 mSolverCounterSat, 890 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 13674 SdHoareTripleChecker+Invalid, 11923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 890 IncrementalHoareTripleChecker+Valid, 7734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3299 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:17,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2229 Valid, 13674 Invalid, 11923 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [890 Valid, 7734 Invalid, 0 Unknown, 3299 Unchecked, 9.2s Time] [2022-11-20 12:03:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9427 states. [2022-11-20 12:03:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9427 to 6718. [2022-11-20 12:03:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6718 states, 5289 states have (on average 1.2393647192285877) internal successors, (6555), 5351 states have internal predecessors, (6555), 914 states have call successors, (914), 443 states have call predecessors, (914), 514 states have return successors, (1119), 981 states have call predecessors, (1119), 913 states have call successors, (1119) [2022-11-20 12:03:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 8588 transitions. [2022-11-20 12:03:19,403 INFO L78 Accepts]: Start accepts. Automaton has 6718 states and 8588 transitions. Word has length 226 [2022-11-20 12:03:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:19,404 INFO L495 AbstractCegarLoop]: Abstraction has 6718 states and 8588 transitions. [2022-11-20 12:03:19,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 79 states have (on average 3.392405063291139) internal successors, (268), 66 states have internal predecessors, (268), 26 states have call successors, (43), 13 states have call predecessors, (43), 22 states have return successors, (44), 32 states have call predecessors, (44), 26 states have call successors, (44) [2022-11-20 12:03:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6718 states and 8588 transitions. [2022-11-20 12:03:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-20 12:03:19,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:19,419 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:19,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:03:19,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-20 12:03:19,630 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:03:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2072935731, now seen corresponding path program 1 times [2022-11-20 12:03:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:19,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945589467] [2022-11-20 12:03:19,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:19,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:03:20,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:03:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:03:22,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:03:22,115 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 12:03:22,117 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:03:22,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 12:03:22,123 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:22,128 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:03:22,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:03:22 BoogieIcfgContainer [2022-11-20 12:03:22,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:03:22,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:03:22,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:03:22,626 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:03:22,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:00:19" (3/4) ... [2022-11-20 12:03:22,630 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 12:03:22,630 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:03:22,631 INFO L158 Benchmark]: Toolchain (without parser) took 186510.03ms. Allocated memory was 140.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 99.2MB in the beginning and 677.7MB in the end (delta: -578.5MB). Peak memory consumption was 572.8MB. Max. memory is 16.1GB. [2022-11-20 12:03:22,631 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 140.5MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:03:22,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1856.97ms. Allocated memory is still 140.5MB. Free memory was 98.9MB in the beginning and 83.8MB in the end (delta: 15.1MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2022-11-20 12:03:22,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 190.70ms. Allocated memory is still 140.5MB. Free memory was 83.8MB in the beginning and 77.6MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 12:03:22,633 INFO L158 Benchmark]: Boogie Preprocessor took 106.97ms. Allocated memory is still 140.5MB. Free memory was 77.6MB in the beginning and 71.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 12:03:22,633 INFO L158 Benchmark]: RCFGBuilder took 1644.48ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 71.3MB in the beginning and 105.3MB in the end (delta: -34.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2022-11-20 12:03:22,633 INFO L158 Benchmark]: TraceAbstraction took 182696.86ms. Allocated memory was 195.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 104.4MB in the beginning and 677.7MB in the end (delta: -573.3MB). Peak memory consumption was 521.1MB. Max. memory is 16.1GB. [2022-11-20 12:03:22,634 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 1.3GB. Free memory is still 677.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:03:22,644 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.41ms. Allocated memory is still 140.5MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1856.97ms. Allocated memory is still 140.5MB. Free memory was 98.9MB in the beginning and 83.8MB in the end (delta: 15.1MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 190.70ms. Allocated memory is still 140.5MB. Free memory was 83.8MB in the beginning and 77.6MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.97ms. Allocated memory is still 140.5MB. Free memory was 77.6MB in the beginning and 71.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1644.48ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 71.3MB in the beginning and 105.3MB in the end (delta: -34.0MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * TraceAbstraction took 182696.86ms. Allocated memory was 195.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 104.4MB in the beginning and 677.7MB in the end (delta: -573.3MB). Peak memory consumption was 521.1MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 1.3GB. Free memory is still 677.7MB. 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: 4056]: 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 3836, overapproximation of strlen at line 3775, overapproximation of bitwiseOr at line 3798, overapproximation of bitwiseAnd at line 3394, overapproximation of snprintf at line 3349. Possible FailurePath: [L3540] int LDV_IN_INTERRUPT = 1; [L3541] int ref_cnt ; [L3542] int ldv_state_variable_1 ; [L3543] int usb_counter ; [L3544] struct usb_interface *usb_acecad_driver_group1 ; [L3545] int ldv_state_variable_0 ; [L3829-L3833] 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}}; [L3834] struct usb_device_id const __mod_usb_device_table ; [L3835-L3840] 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}; [L3862] int ldv_retval_0 ; [L3863] int ldv_retval_1 ; [L4059] int INTERF_STATE = 0; [L4060] int SERIAL_STATE = 0; [L4061] void *usb_intfdata = (void *)0; [L4062] struct urb *usb_urb = (struct urb *)0; [L4063] struct usb_device *usb_dev = (struct usb_device *)0; [L4064] int dev_counter = 0; [L4065] int completeFnIntCounter = 0; [L4066] int completeFnBulkCounter = 0; [L4067] void (*completeFnInt)(struct urb * ) ; [L4068] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3877] struct usb_device_id *ldvarg0 ; [L3878] void *tmp ; [L3879] int tmp___0 ; [L3880] int tmp___1 ; [L3881] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3494] void *p ; [L3495] void *tmp ; [L3497] 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, calloc(1UL, size)={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3497] tmp = calloc(1UL, size) [L3498] 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, calloc(1UL, size)={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] 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, calloc(1UL, size)={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3500] 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, calloc(1UL, size)={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] tmp = ldv_init_zalloc(24UL) [L3884] ldvarg0 = (struct usb_device_id *)tmp [L3885] FCALL ldv_initialize() [L3886] ldv_state_variable_1 = 0 [L3887] ref_cnt = 0 [L3888] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: [L3922] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3923] COND TRUE ldv_state_variable_0 != 0 [L3924] tmp___2 = __VERIFIER_nondet_int() [L3926] case 0: [L3934] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3935] COND TRUE ldv_state_variable_0 == 1 [L3936] CALL, EXPR usb_acecad_init() [L3843] int result ; [L3844] int tmp ; [L3846] CALL, EXPR usb_register(& usb_acecad_driver) [L3358] int tmp ; [L3360] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3977] ldv_func_ret_type ldv_func_res ; [L3978] int tmp ; [L3980] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4352] return __VERIFIER_nondet_int(); [L3980] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3980] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3981] ldv_func_res = tmp [L3982] ldv_state_variable_1 = 1 [L3983] usb_counter = 0 [L3984] CALL ldv_usb_driver_1() [L3868] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3494] void *p ; [L3495] void *tmp ; [L3497] 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:18446744073709551635}, calloc(1UL, size)={-73786976294838206465:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3497] tmp = calloc(1UL, size) [L3498] 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:18446744073709551635}, calloc(1UL, size)={-73786976294838206465:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-73786976294838206465:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] 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:18446744073709551635}, calloc(1UL, size)={-73786976294838206465:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-73786976294838206465:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3500] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \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:18446744073709551635}, calloc(1UL, size)={-73786976294838206465:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-73786976294838206465:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-73786976294838206465: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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] tmp = ldv_init_zalloc(1248UL) [L3871] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-73786976294838206465:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3984] RET ldv_usb_driver_1() [L3985] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, ldv_func_arg2={18446744073709551618:18446744073709551635}, ldv_func_arg2={18446744073709551618:18446744073709551635}, 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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3360] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3360] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={12:0}, driver={12: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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3846] RET, EXPR usb_register(& usb_acecad_driver) [L3846] tmp = usb_register(& usb_acecad_driver) [L3847] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3848] COND TRUE result == 0 [L3852] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3936] RET, EXPR usb_acecad_init() [L3936] ldv_retval_1 = usb_acecad_init() [L3937] COND TRUE ldv_retval_1 == 0 [L3938] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3941] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3893] COND TRUE ldv_state_variable_1 != 0 [L3894] tmp___1 = __VERIFIER_nondet_int() [L3896] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3897] COND TRUE ldv_state_variable_1 == 1 [L3898] CALL, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3690] struct usb_device *dev ; [L3691] struct usb_device *tmp ; [L3692] struct usb_host_interface *interface ; [L3693] struct usb_endpoint_descriptor *endpoint ; [L3694] struct usb_acecad *acecad ; [L3695] struct input_dev *input_dev ; [L3696] int pipe ; [L3697] int maxp ; [L3698] int err ; [L3699] int tmp___0 ; [L3700] unsigned int tmp___1 ; [L3701] __u16 tmp___2 ; [L3702] void *tmp___3 ; [L3703] void *tmp___4 ; [L3704] size_t tmp___5 ; [L3705] size_t tmp___6 ; [L3707] CALL, EXPR interface_to_usbdev(intf) [L3968] struct usb_device *tmp ; [L3970] CALL, EXPR ldv_interface_to_usbdev() [L4172] void *result ; [L4173] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1822, tmp={-36893488147419103231:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1822, tmp={-36893488147419103231:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=1822, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1822, tmp={-36893488147419103231:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] tmp = ldv_malloc(sizeof(struct usb_device)) [L4176] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-36893488147419103231:0}, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4177] COND FALSE !((unsigned long )result == (unsigned long )((void *)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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-36893488147419103231:0}, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4181] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-36893488147419103231:0}, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3970] RET, EXPR ldv_interface_to_usbdev() [L3970] tmp = ldv_interface_to_usbdev() [L3971] return (tmp); VAL [={0:0}, ={0:0}, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3707] RET, EXPR interface_to_usbdev(intf) [L3707] tmp = interface_to_usbdev(intf) [L3708] dev = tmp [L3709] EXPR intf->cur_altsetting [L3709] interface = intf->cur_altsetting [L3710] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, id={-18446744073709551617:0}, id={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, interface->desc.bNumEndpoints=-255, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3710] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3714] EXPR interface->endpoint [L3714] endpoint = & (interface->endpoint)->desc [L3715] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3313] int tmp ; [L3314] int tmp___0 ; [L3315] int tmp___1 ; [L3317] CALL, EXPR usb_endpoint_xfer_int(epd) [L3308] EXPR epd->bmAttributes [L3308] return (((int )epd->bmAttributes & 3) == 3); [L3317] RET, EXPR usb_endpoint_xfer_int(epd) [L3317] tmp = usb_endpoint_xfer_int(epd) [L3318] COND TRUE tmp != 0 [L3319] CALL, EXPR usb_endpoint_dir_in(epd) [L3302] EXPR epd->bEndpointAddress [L3302] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3319] RET, EXPR usb_endpoint_dir_in(epd) [L3319] tmp___0 = usb_endpoint_dir_in(epd) [L3320] COND TRUE tmp___0 != 0 [L3321] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={-55340232221128654847:19}, epd={-55340232221128654847:19}, 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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3328] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={-55340232221128654847:19}, epd={-55340232221128654847:19}, 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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3715] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3715] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3716] COND FALSE !(tmp___0 == 0) [L3720] EXPR endpoint->bEndpointAddress [L3720] CALL, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3380] EXPR dev->devnum [L3380] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3720] RET, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3720] tmp___1 = __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3721] pipe = (int )(tmp___1 | 1073741952U) [L3722] CALL, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3385] struct usb_host_endpoint *ep ; [L3386] unsigned int epnum ; [L3387] int __ret_warn_on ; [L3388] long tmp ; [L3389] int __ret_warn_on___0 ; [L3390] long tmp___0 ; VAL [={0:0}, ={0:0}, \old(is_out)=1, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, is_out=1, 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={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3392] epnum = (unsigned int )(pipe >> 15) & 15U VAL [={0:0}, ={0:0}, \old(is_out)=1, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=1, 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={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3393] COND TRUE is_out != 0 [L3394] __ret_warn_on = (pipe & 128) != 0 VAL [={0:0}, ={0:0}, \old(is_out)=1, \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, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=1, 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={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3395] CALL, EXPR ldv__builtin_expect(__ret_warn_on != 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3537] 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:18446744073709551635}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3395] RET, EXPR ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=1, \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, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=1, ldv__builtin_expect(__ret_warn_on != 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={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3395] tmp = ldv__builtin_expect(__ret_warn_on != 0, 0L) [L3396] COND FALSE !(tmp != 0L) VAL [={0:0}, ={0:0}, \old(is_out)=1, \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, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=1, 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, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3400] CALL ldv__builtin_expect(__ret_warn_on != 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3537] 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:18446744073709551635}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3400] RET ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=1, \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, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=1, ldv__builtin_expect(__ret_warn_on != 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, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3401] EXPR udev->ep_out[epnum] [L3401] ep = udev->ep_out[epnum] [L3412] COND TRUE (unsigned long )ep == (unsigned long )((struct usb_host_endpoint *)0) [L3413] return (0U); VAL [={0:0}, ={0:0}, \old(is_out)=1, \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, __this_module={18446744073709551618:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, ep={18446744073709551599:17}, epnum=0, INTERF_STATE=0, is_out=1, 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, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3722] RET, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3722] tmp___2 = usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3723] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3724] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3444] void *tmp ; [L3446] CALL, EXPR kmalloc(size, flags | 32768U) [L3435] void *tmp___1 ; [L3437] CALL, EXPR __kmalloc(size, flags) [L3430] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=232, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654847:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-55340232221128654847: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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] return ldv_malloc(size); [L3437] RET, EXPR __kmalloc(size, flags) [L3437] tmp___1 = __kmalloc(size, flags) [L3438] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=232, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32768, 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={-55340232221128654847:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3446] RET, EXPR kmalloc(size, flags | 32768U) [L3446] tmp = kmalloc(size, flags | 32768U) [L3447] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=232, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=208, 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={-55340232221128654847:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3724] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465:0}, kzalloc(232UL, 208U)={-55340232221128654847: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3724] tmp___3 = kzalloc(232UL, 208U) [L3725] acecad = (struct usb_acecad *)tmp___3 [L3726] CALL, EXPR input_allocate_device() [L3548] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3444] void *tmp ; [L3446] CALL, EXPR kmalloc(size, flags | 32768U) [L3435] void *tmp___1 ; [L3437] CALL, EXPR __kmalloc(size, flags) [L3430] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1855, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1855, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=1855, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1855, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-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, size=1855, t=32768, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] return ldv_malloc(size); [L3437] RET, EXPR __kmalloc(size, flags) [L3437] tmp___1 = __kmalloc(size, flags) [L3438] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=1855, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32768, 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={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3446] RET, EXPR kmalloc(size, flags | 32768U) [L3446] tmp = kmalloc(size, flags | 32768U) [L3447] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=128, \old(size)=1855, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=128, 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={-18446744073709551615:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3548] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3548] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L3726] RET, EXPR input_allocate_device() [L3726] input_dev = input_allocate_device() [L3727] COND FALSE !((unsigned long )acecad == (unsigned long )((struct usb_acecad *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L3732] CALL, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L4339] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=0, tmp={-36893488147419103233:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=0, tmp={-36893488147419103233:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=0, tmp={-36893488147419103233:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4339] 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:18446744073709551635}, arg0={-36893488147419103231:0}, arg0={-36893488147419103231:0}, arg1=8, arg2=208, arg3={-55340232221128654847:224}, arg3={-55340232221128654847:224}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4339] return ldv_malloc(0UL); [L3732] RET, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3732] tmp___4 = usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3733] acecad->data = (unsigned char *)tmp___4 [L3734] 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:18446744073709551635}, acecad={-55340232221128654847:0}, acecad->data={-36893488147419103233:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3734] COND FALSE !((unsigned long )acecad->data == (unsigned long )((unsigned char *)0U)) [L3739] CALL, EXPR ldv_usb_alloc_urb_5(0, 208U) [L4006] struct urb *tmp ; [L4008] CALL, EXPR ldv_alloc_urb() [L4091] struct urb *value ; [L4092] void *tmp ; [L4093] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4095] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=180, tmp={-55340232221128654849:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=180, tmp={-55340232221128654849:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=180, tmp={-55340232221128654849:0}, tmp___0=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4095] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4095] tmp = ldv_malloc(sizeof(struct urb)) [L4096] value = (struct urb *)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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-55340232221128654849:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={-55340232221128654849:0}] [L4097] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3513] int tmp ; [L3515] tmp = __VERIFIER_nondet_int() [L3516] return (tmp); 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4097] 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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()=1, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={-55340232221128654849:0}] [L4097] tmp___0 = ldv_undef_int() [L4098] COND TRUE 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-55340232221128654849:0}, tmp___0=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={-55340232221128654849:0}] [L4099] COND TRUE (unsigned long )value != (unsigned long )((struct urb *)0) [L4100] usb_urb = value 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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-55340232221128654849:0}, tmp___0=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}, value={-55340232221128654849:0}] [L4105] return (usb_urb); VAL [={0:0}, ={0:0}, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-55340232221128654849:0}, tmp___0=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}, value={-55340232221128654849:0}] [L4008] RET, EXPR ldv_alloc_urb() [L4008] tmp = ldv_alloc_urb() [L4009] return (tmp); VAL [={0:0}, ={0:0}, \old(iso_packets)=0, \old(mem_flags)=208, \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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, iso_packets=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, mem_flags=208, ref_cnt=0, SERIAL_STATE=0, tmp={-55340232221128654849:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3739] RET, EXPR ldv_usb_alloc_urb_5(0, 208U) [L3739] acecad->irq = ldv_usb_alloc_urb_5(0, 208U) [L3740] 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:18446744073709551635}, acecad={-55340232221128654847:0}, acecad->irq={-55340232221128654849:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3740] COND FALSE !((unsigned long )acecad->irq == (unsigned long )((struct urb *)0)) [L3745] acecad->usbdev = dev [L3746] acecad->input = input_dev [L3747] 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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev->manufacturer={18:18446744073709551598}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3747] COND FALSE !((unsigned long )dev->manufacturer != (unsigned long )((char *)0)) [L3751] 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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev->product={18446744073709551593:23}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3751] COND FALSE !((unsigned long )dev->product != (unsigned long )((char *)0)) [L3759] CALL usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3347] int actual ; [L3349] EXPR dev->bus [L3349] EXPR (dev->bus)->bus_name [L3349] actual = snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [L3350] 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:18446744073709551635}, actual=-1, buf={-55340232221128654847:128}, buf={-55340232221128654847:128}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev={-36893488147419103231:0}, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3759] RET usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3760] 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:18446744073709551635}, arg0={-55340232221128654847:128}, arg1={8:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L4332] return __VERIFIER_nondet_ulong(); [L3760] 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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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)=18446744073709551634, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3761] input_dev->name = (char const *)(& acecad->name) [L3762] input_dev->phys = (char const *)(& acecad->phys) [L3763] CALL usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3597] id->bustype = 3U [L3598] EXPR dev->descriptor.idVendor [L3598] id->vendor = dev->descriptor.idVendor [L3599] EXPR dev->descriptor.idProduct [L3599] id->product = dev->descriptor.idProduct [L3600] EXPR dev->descriptor.bcdDevice [L3600] id->version = dev->descriptor.bcdDevice [L3763] RET usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3764] input_dev->dev.parent = & intf->dev [L3765] CALL input_set_drvdata(input_dev, (void *)acecad) [L3562] FCALL dev_set_drvdata(& dev->dev, data) [L3765] RET input_set_drvdata(input_dev, (void *)acecad) [L3766] input_dev->open = & usb_acecad_open [L3767] input_dev->close = & usb_acecad_close [L3768] input_dev->evbit[0] = 10UL [L3769] input_dev->keybit[5] = 7169UL [L3770] id->driver_info [L3771] 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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3772] 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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3773] 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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3774] 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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3775] tmp___5 = strlen((char const *)(& acecad->name)) [L3776] 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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3795] EXPR acecad->irq [L3795] EXPR acecad->data [L3796] EXPR endpoint->bInterval [L3795-L3796] 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) [L4018] CALL ldv_fill_int_urb(urb, complete_fn) [L4121] COND TRUE (unsigned long )usb_urb == (unsigned long )urb [L4122] completeFnInt = complete_fn [L4123] completeFnIntCounter = completeFnIntCounter + 1 VAL [={-1:2}, ={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:18446744073709551635}, complete_fn={-1:2}, complete_fn={-1:2}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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={-55340232221128654849:0}, urb={-55340232221128654849:0}, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L4018] RET ldv_fill_int_urb(urb, complete_fn) [L3795-L3796] 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) [L3797] EXPR acecad->irq [L3797] EXPR acecad->data_dma [L3797] (acecad->irq)->transfer_dma = acecad->data_dma [L3798] EXPR acecad->irq [L3798] EXPR acecad->irq [L3798] EXPR (acecad->irq)->transfer_flags [L3798] (acecad->irq)->transfer_flags = (acecad->irq)->transfer_flags | 4U [L3799] EXPR acecad->input [L3799] CALL, EXPR input_register_device(acecad->input) [L4315] return __VERIFIER_nondet_int(); [L3799] RET, EXPR input_register_device(acecad->input) [L3799] err = input_register_device(acecad->input) [L3800] COND TRUE err != 0 VAL [={-1:2}, ={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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3807] EXPR acecad->data [L3807] EXPR acecad->data_dma VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551635}, acecad={-55340232221128654847:0}, acecad->data={-36893488147419103233:0}, acecad->data_dma=18446744073709551623, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3807] FCALL usb_free_coherent(dev, 8UL, (void *)acecad->data, acecad->data_dma) VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551635}, acecad={-55340232221128654847:0}, acecad->data={-36893488147419103233:0}, acecad->data_dma=18446744073709551623, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3809] FCALL input_free_device(input_dev) [L3810] CALL kfree((void const *)acecad) VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3810] RET kfree((void const *)acecad) VAL [={-1:2}, ={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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3811] return (err); VAL [={-1:2}, ={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:18446744073709551635}, acecad={-55340232221128654847:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-55340232221128654847:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={18446744073709551629:-11}, intf={-73786976294838206465:0}, intf={-73786976294838206465: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={-36893488147419103231:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654847:0}, tmp___4={-36893488147419103233:0}, tmp___5=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3898] RET, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3898] ldv_retval_0 = usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3899] COND FALSE !(ldv_retval_0 == 0) VAL [={-1:2}, ={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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: [L3922] case 1: VAL [={-1:2}, ={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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3923] COND TRUE ldv_state_variable_0 != 0 [L3924] tmp___2 = __VERIFIER_nondet_int() [L3926] case 0: VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3927] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L3928] CALL usb_acecad_exit() [L3858] CALL ldv_usb_deregister_11(& usb_acecad_driver) [L4047] FCALL usb_deregister(arg) [L4048] ldv_state_variable_1 = 0 VAL [={-1:2}, ={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:18446744073709551635}, arg={12:0}, arg={12:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3858] RET ldv_usb_deregister_11(& usb_acecad_driver) [L3928] RET usb_acecad_exit() [L3929] ldv_state_variable_0 = 2 VAL [={-1:2}, ={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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L3962] CALL ldv_check_final_state() [L4278] COND TRUE (unsigned long )usb_urb != (unsigned long )((struct urb *)0) VAL [={-1:2}, ={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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L4279] CALL ldv_error() VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] [L4056] reach_error() VAL [={-1:2}, ={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:18446744073709551635}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-73786976294838206465:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={-55340232221128654849:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 234 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 182.1s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 53.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10986 SdHoareTripleChecker+Valid, 29.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10610 mSDsluCounter, 70509 SdHoareTripleChecker+Invalid, 25.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11151 IncrementalHoareTripleChecker+Unchecked, 63219 mSDsCounter, 3147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23204 IncrementalHoareTripleChecker+Invalid, 37502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3147 mSolverCounterUnsat, 7290 mSDtfsCounter, 23204 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3202 GetRequests, 2546 SyntacticMatches, 75 SemanticMatches, 581 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 16739 ImplicationChecksByTransitivity, 36.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6718occurred in iteration=21, InterpolantAutomatonStates: 385, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 14684 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 56.2s SatisfiabilityAnalysisTime, 56.2s InterpolantComputationTime, 4982 NumberOfCodeBlocks, 4849 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 4892 ConstructedInterpolants, 366 QuantifiedInterpolants, 22859 SizeOfPredicates, 198 NumberOfNonLiveVariables, 14054 ConjunctsInSsa, 719 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 2161/2706 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-20 12:03:22,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN --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 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- 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-6b4ec56 [2022-11-20 12:03:25,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:03:25,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:03:25,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:03:25,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:03:25,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:03:25,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:03:25,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:03:25,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:03:25,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:03:25,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:03:25,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:03:25,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:03:25,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:03:25,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:03:25,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:03:25,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:03:25,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:03:25,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:03:25,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:03:25,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:03:25,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:03:25,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:03:25,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:03:25,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:03:25,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:03:25,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:03:25,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:03:25,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:03:25,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:03:25,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:03:25,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:03:25,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:03:25,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:03:25,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:03:25,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:03:25,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:03:25,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:03:25,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:03:25,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:03:25,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:03:25,362 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-20 12:03:25,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:03:25,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:03:25,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:03:25,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:03:25,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:03:25,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:03:25,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:03:25,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:03:25,414 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:03:25,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:03:25,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:03:25,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:03:25,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:03:25,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:03:25,417 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 12:03:25,417 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 12:03:25,417 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 12:03:25,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:03:25,418 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:03:25,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:03:25,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:03:25,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:03:25,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:03:25,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:03:25,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:03:25,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:03:25,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:03:25,420 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 12:03:25,420 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 12:03:25,421 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:03:25,421 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:03:25,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:03:25,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 12:03:25,422 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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/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_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN 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 -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2022-11-20 12:03:25,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:03:25,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:03:25,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:03:25,800 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:03:25,800 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:03:25,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 12:03:29,018 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:03:29,490 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:03:29,490 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 12:03:29,529 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/data/252064828/2479200f60aa4e6d840fe2a4c0faec84/FLAGd758d08de [2022-11-20 12:03:29,576 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08aa3dcd-bfef-496d-9ab8-b0dbe544b142/bin/uautomizer-ug76WZFUDN/data/252064828/2479200f60aa4e6d840fe2a4c0faec84 [2022-11-20 12:03:29,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:03:29,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:03:29,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:03:29,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:03:29,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:03:29,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:03:29" (1/1) ... [2022-11-20 12:03:29,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a647a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:29, skipping insertion in model container [2022-11-20 12:03:29,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:03:29" (1/1) ... [2022-11-20 12:03:29,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:03:29,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:03:30,337 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)) [3349] 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:959) 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-20 12:03:30,346 INFO L158 Benchmark]: Toolchain (without parser) took 761.24ms. Allocated memory is still 83.9MB. Free memory was 63.5MB in the beginning and 49.1MB in the end (delta: 14.4MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-11-20 12:03:30,346 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 65.0MB. Free memory is still 43.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:03:30,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 754.43ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 49.1MB in the end (delta: 14.1MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-11-20 12:03:30,349 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.31ms. Allocated memory is still 65.0MB. Free memory is still 43.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 754.43ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 49.1MB in the end (delta: 14.1MB). Peak memory consumption was 25.6MB. 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)) [3349] 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)) [3349]: 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)) [3349]