./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 8393723b 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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 20:01:39,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:01:39,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:01:39,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:01:39,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:01:39,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:01:39,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:01:39,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:01:39,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:01:39,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:01:39,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:01:39,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:01:39,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:01:39,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:01:39,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:01:39,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:01:39,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:01:39,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:01:39,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:01:39,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:01:39,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:01:39,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:01:39,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:01:39,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:01:39,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:01:39,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:01:39,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:01:39,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:01:39,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:01:39,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:01:39,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:01:39,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:01:39,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:01:39,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:01:39,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:01:39,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:01:39,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:01:39,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:01:39,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:01:39,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:01:39,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:01:39,841 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:01:39,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:01:39,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:01:39,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:01:39,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:01:39,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:01:39,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:01:39,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:01:39,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:01:39,890 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:01:39,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:01:39,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:01:39,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:01:39,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:01:39,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:01:39,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:01:39,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:01:39,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:01:39,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:01:39,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:01:39,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:01:39,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:01:39,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:01:39,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:01:39,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:01:39,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:01:39,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:01:39,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:01:39,897 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:01:39,897 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:01:39,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:01:39,898 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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro 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-18 20:01:40,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:01:40,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:01:40,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:01:40,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:01:40,274 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:01:40,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/../../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-18 20:01:40,345 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data/ae8c239f9/9a0b7e9144fa40a5bc002790c74c70be/FLAGb15e82eb3 [2022-11-18 20:01:41,202 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:01:41,203 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/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-18 20:01:41,240 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data/ae8c239f9/9a0b7e9144fa40a5bc002790c74c70be/FLAGb15e82eb3 [2022-11-18 20:01:41,287 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data/ae8c239f9/9a0b7e9144fa40a5bc002790c74c70be [2022-11-18 20:01:41,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:01:41,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:01:41,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:01:41,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:01:41,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:01:41,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b4bb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:41, skipping insertion in model container [2022-11-18 20:01:41,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:01:41" (1/1) ... [2022-11-18 20:01:41,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:01:41,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:01:42,441 WARN L234 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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/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-18 20:01:42,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:01:42,579 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:01:42,820 WARN L234 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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/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-18 20:01:42,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:01:42,884 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:01:42,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42 WrapperNode [2022-11-18 20:01:42,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:01:42,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:01:42,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:01:42,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:01:42,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:42,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,041 INFO L138 Inliner]: procedures = 107, calls = 317, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 767 [2022-11-18 20:01:43,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:01:43,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:01:43,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:01:43,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:01:43,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,115 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:01:43,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:01:43,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:01:43,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:01:43,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (1/1) ... [2022-11-18 20:01:43,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:01:43,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:43,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:01:43,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:01:43,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 20:01:43,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 20:01:43,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:01:43,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-18 20:01:43,250 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-18 20:01:43,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:01:43,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:01:43,250 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-18 20:01:43,251 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-18 20:01:43,251 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-18 20:01:43,251 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-18 20:01:43,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:01:43,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-18 20:01:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-18 20:01:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-18 20:01:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-18 20:01:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-18 20:01:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-18 20:01:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-18 20:01:43,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-18 20:01:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:01:43,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:01:43,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:01:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:01:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-18 20:01:43,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-18 20:01:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:01:43,254 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-18 20:01:43,255 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-18 20:01:43,255 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-18 20:01:43,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-18 20:01:43,255 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-18 20:01:43,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-18 20:01:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:01:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:01:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:01:43,256 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-18 20:01:43,257 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-18 20:01:43,257 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-18 20:01:43,257 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-18 20:01:43,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:01:43,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:01:43,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:01:43,666 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:01:43,668 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:01:43,824 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 20:01:44,734 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:01:44,748 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:01:44,751 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:01:44,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:44 BoogieIcfgContainer [2022-11-18 20:01:44,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:01:44,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:01:44,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:01:44,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:01:44,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:01:41" (1/3) ... [2022-11-18 20:01:44,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a15e820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:01:44, skipping insertion in model container [2022-11-18 20:01:44,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:01:42" (2/3) ... [2022-11-18 20:01:44,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a15e820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:01:44, skipping insertion in model container [2022-11-18 20:01:44,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:44" (3/3) ... [2022-11-18 20:01:44,769 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-18 20:01:44,796 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:01:44,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:01:44,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:01:44,887 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;@64213965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:01:44,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:01:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 181 states have internal predecessors, (222), 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-18 20:01:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:01:44,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:44,909 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-18 20:01:44,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash -60492226, now seen corresponding path program 1 times [2022-11-18 20:01:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:44,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748208422] [2022-11-18 20:01:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:45,381 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-18 20:01:45,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:45,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748208422] [2022-11-18 20:01:45,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748208422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:45,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:45,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:01:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473045059] [2022-11-18 20:01:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:45,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:01:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:01:45,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:01:45,450 INFO L87 Difference]: Start difference. First operand has 229 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 181 states have internal predecessors, (222), 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-18 20:01:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:46,151 INFO L93 Difference]: Finished difference Result 460 states and 624 transitions. [2022-11-18 20:01:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:01:46,154 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-18 20:01:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:46,167 INFO L225 Difference]: With dead ends: 460 [2022-11-18 20:01:46,167 INFO L226 Difference]: Without dead ends: 225 [2022-11-18 20:01:46,172 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-18 20:01:46,176 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 49 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:46,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 563 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:01:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-18 20:01:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2022-11-18 20:01:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 164 states have (on average 1.2804878048780488) internal successors, (210), 170 states have internal predecessors, (210), 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-18 20:01:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2022-11-18 20:01:46,244 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 32 [2022-11-18 20:01:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:46,244 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2022-11-18 20:01:46,245 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-18 20:01:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2022-11-18 20:01:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:01:46,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:46,247 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-18 20:01:46,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:01:46,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:46,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:46,249 INFO L85 PathProgramCache]: Analyzing trace with hash 362209600, now seen corresponding path program 1 times [2022-11-18 20:01:46,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:46,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180284031] [2022-11-18 20:01:46,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:46,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:46,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:46,460 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-18 20:01:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:46,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180284031] [2022-11-18 20:01:46,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180284031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:46,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:46,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:01:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435974957] [2022-11-18 20:01:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:46,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:01:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:46,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:01:46,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:01:46,464 INFO L87 Difference]: Start difference. First operand 218 states and 283 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-18 20:01:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:47,276 INFO L93 Difference]: Finished difference Result 632 states and 827 transitions. [2022-11-18 20:01:47,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:01:47,277 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-18 20:01:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:47,281 INFO L225 Difference]: With dead ends: 632 [2022-11-18 20:01:47,281 INFO L226 Difference]: Without dead ends: 419 [2022-11-18 20:01:47,282 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-18 20:01:47,283 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 307 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:47,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 752 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:01:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-18 20:01:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 405. [2022-11-18 20:01:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 305 states have (on average 1.2721311475409836) internal successors, (388), 313 states have internal predecessors, (388), 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-18 20:01:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 525 transitions. [2022-11-18 20:01:47,353 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 525 transitions. Word has length 32 [2022-11-18 20:01:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:47,354 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 525 transitions. [2022-11-18 20:01:47,354 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-18 20:01:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 525 transitions. [2022-11-18 20:01:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:01:47,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:47,364 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-18 20:01:47,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:01:47,365 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash 409172293, now seen corresponding path program 1 times [2022-11-18 20:01:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:47,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035918] [2022-11-18 20:01:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:47,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:47,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:01:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:47,704 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-18 20:01:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:47,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035918] [2022-11-18 20:01:47,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:47,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:47,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:01:47,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995850773] [2022-11-18 20:01:47,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:47,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:01:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:47,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:01:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:01:47,708 INFO L87 Difference]: Start difference. First operand 405 states and 525 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-18 20:01:48,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:48,690 INFO L93 Difference]: Finished difference Result 960 states and 1283 transitions. [2022-11-18 20:01:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:01:48,691 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-18 20:01:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:48,699 INFO L225 Difference]: With dead ends: 960 [2022-11-18 20:01:48,700 INFO L226 Difference]: Without dead ends: 570 [2022-11-18 20:01:48,702 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-18 20:01:48,711 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 607 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:48,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1430 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 20:01:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-11-18 20:01:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 408. [2022-11-18 20:01:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 308 states have (on average 1.2662337662337662) internal successors, (390), 316 states have internal predecessors, (390), 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-18 20:01:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 527 transitions. [2022-11-18 20:01:48,780 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 527 transitions. Word has length 55 [2022-11-18 20:01:48,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:48,781 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 527 transitions. [2022-11-18 20:01:48,781 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-18 20:01:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 527 transitions. [2022-11-18 20:01:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:01:48,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:48,786 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-18 20:01:48,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:01:48,788 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1146488965, now seen corresponding path program 1 times [2022-11-18 20:01:48,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:48,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168959552] [2022-11-18 20:01:48,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:49,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:49,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:49,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:01:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:49,219 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-18 20:01:49,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:49,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168959552] [2022-11-18 20:01:49,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168959552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:49,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:49,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:01:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537625068] [2022-11-18 20:01:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:49,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:01:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:01:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:01:49,222 INFO L87 Difference]: Start difference. First operand 408 states and 527 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-18 20:01:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:50,141 INFO L93 Difference]: Finished difference Result 1221 states and 1596 transitions. [2022-11-18 20:01:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:01:50,142 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-18 20:01:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:50,153 INFO L225 Difference]: With dead ends: 1221 [2022-11-18 20:01:50,153 INFO L226 Difference]: Without dead ends: 828 [2022-11-18 20:01:50,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:01:50,164 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 318 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:50,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 751 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 20:01:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-11-18 20:01:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 790. [2022-11-18 20:01:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 601 states have (on average 1.2628951747088186) internal successors, (759), 613 states have internal predecessors, (759), 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-18 20:01:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1024 transitions. [2022-11-18 20:01:50,290 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1024 transitions. Word has length 55 [2022-11-18 20:01:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:50,292 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 1024 transitions. [2022-11-18 20:01:50,292 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-18 20:01:50,293 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1024 transitions. [2022-11-18 20:01:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 20:01:50,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:50,296 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-18 20:01:50,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:01:50,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:50,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1181423866, now seen corresponding path program 1 times [2022-11-18 20:01:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:50,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601508680] [2022-11-18 20:01:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:50,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:50,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:50,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:01:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:50,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:50,602 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-18 20:01:50,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:50,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601508680] [2022-11-18 20:01:50,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601508680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:50,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:50,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:01:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104475647] [2022-11-18 20:01:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:50,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:01:50,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:50,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:01:50,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:01:50,605 INFO L87 Difference]: Start difference. First operand 790 states and 1024 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-18 20:01:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:51,112 INFO L93 Difference]: Finished difference Result 820 states and 1069 transitions. [2022-11-18 20:01:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:01:51,113 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-18 20:01:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:51,118 INFO L225 Difference]: With dead ends: 820 [2022-11-18 20:01:51,118 INFO L226 Difference]: Without dead ends: 817 [2022-11-18 20:01:51,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:01:51,120 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 309 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:51,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 377 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:01:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-11-18 20:01:51,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 789. [2022-11-18 20:01:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 601 states have (on average 1.2612312811980033) internal successors, (758), 612 states have internal predecessors, (758), 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-18 20:01:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1022 transitions. [2022-11-18 20:01:51,216 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1022 transitions. Word has length 56 [2022-11-18 20:01:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:51,217 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1022 transitions. [2022-11-18 20:01:51,217 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-18 20:01:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1022 transitions. [2022-11-18 20:01:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 20:01:51,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:51,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:01:51,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:01:51,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2030556632, now seen corresponding path program 1 times [2022-11-18 20:01:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:51,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432921582] [2022-11-18 20:01:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:51,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:51,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:01:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:01:51,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:51,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432921582] [2022-11-18 20:01:51,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432921582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:51,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:51,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:01:51,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881925426] [2022-11-18 20:01:51,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:51,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:01:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:01:51,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:01:51,376 INFO L87 Difference]: Start difference. First operand 789 states and 1022 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-18 20:01:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:51,861 INFO L93 Difference]: Finished difference Result 819 states and 1067 transitions. [2022-11-18 20:01:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:01:51,862 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-18 20:01:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:51,868 INFO L225 Difference]: With dead ends: 819 [2022-11-18 20:01:51,868 INFO L226 Difference]: Without dead ends: 816 [2022-11-18 20:01:51,869 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-18 20:01:51,870 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 306 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:51,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 374 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:01:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-11-18 20:01:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 788. [2022-11-18 20:01:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 601 states have (on average 1.259567387687188) internal successors, (757), 611 states have internal predecessors, (757), 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-18 20:01:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1020 transitions. [2022-11-18 20:01:51,989 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1020 transitions. Word has length 57 [2022-11-18 20:01:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:51,990 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1020 transitions. [2022-11-18 20:01:51,990 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-18 20:01:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1020 transitions. [2022-11-18 20:01:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:01:51,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:51,992 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-18 20:01:51,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:01:51,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:51,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1477267901, now seen corresponding path program 1 times [2022-11-18 20:01:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:51,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840510779] [2022-11-18 20:01:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:01:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,208 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-18 20:01:52,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:52,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840510779] [2022-11-18 20:01:52,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840510779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:52,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:52,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:01:52,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417016345] [2022-11-18 20:01:52,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:52,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:01:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:52,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:01:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:01:52,212 INFO L87 Difference]: Start difference. First operand 788 states and 1020 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-18 20:01:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:52,723 INFO L93 Difference]: Finished difference Result 818 states and 1065 transitions. [2022-11-18 20:01:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:01:52,724 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-18 20:01:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:52,729 INFO L225 Difference]: With dead ends: 818 [2022-11-18 20:01:52,729 INFO L226 Difference]: Without dead ends: 815 [2022-11-18 20:01:52,730 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-18 20:01:52,731 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 266 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:52,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 519 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:01:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-11-18 20:01:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 787. [2022-11-18 20:01:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 601 states have (on average 1.2579034941763727) internal successors, (756), 610 states have internal predecessors, (756), 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-18 20:01:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1018 transitions. [2022-11-18 20:01:52,808 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1018 transitions. Word has length 58 [2022-11-18 20:01:52,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:52,809 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1018 transitions. [2022-11-18 20:01:52,809 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-18 20:01:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1018 transitions. [2022-11-18 20:01:52,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:01:52,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:52,811 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-18 20:01:52,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:01:52,811 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1449316405, now seen corresponding path program 1 times [2022-11-18 20:01:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:52,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713666375] [2022-11-18 20:01:52,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:52,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:01:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:52,989 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-18 20:01:52,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:52,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713666375] [2022-11-18 20:01:52,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713666375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:52,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:52,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:01:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136398617] [2022-11-18 20:01:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:52,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:01:52,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:01:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:01:52,993 INFO L87 Difference]: Start difference. First operand 787 states and 1018 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-18 20:01:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:53,464 INFO L93 Difference]: Finished difference Result 817 states and 1063 transitions. [2022-11-18 20:01:53,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:01:53,465 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-18 20:01:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:53,469 INFO L225 Difference]: With dead ends: 817 [2022-11-18 20:01:53,469 INFO L226 Difference]: Without dead ends: 805 [2022-11-18 20:01:53,470 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-18 20:01:53,471 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 300 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:53,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 370 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:01:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-11-18 20:01:53,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 777. [2022-11-18 20:01:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 592 states have (on average 1.2567567567567568) internal successors, (744), 600 states have internal predecessors, (744), 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-18 20:01:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1005 transitions. [2022-11-18 20:01:53,529 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1005 transitions. Word has length 59 [2022-11-18 20:01:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:53,530 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1005 transitions. [2022-11-18 20:01:53,530 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-18 20:01:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1005 transitions. [2022-11-18 20:01:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-18 20:01:53,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:53,534 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] [2022-11-18 20:01:53,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:01:53,534 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:53,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1923515038, now seen corresponding path program 1 times [2022-11-18 20:01:53,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743155509] [2022-11-18 20:01:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:01:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 20:01:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 20:01:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:01:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:01:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-18 20:01:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-18 20:01:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 20:01:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-18 20:01:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:01:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-18 20:01:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:53,981 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-18 20:01:53,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:53,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743155509] [2022-11-18 20:01:53,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743155509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:53,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:53,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:01:53,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616523022] [2022-11-18 20:01:53,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:53,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:01:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:01:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:01:53,986 INFO L87 Difference]: Start difference. First operand 777 states and 1005 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 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-18 20:01:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:54,615 INFO L93 Difference]: Finished difference Result 1631 states and 2125 transitions. [2022-11-18 20:01:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:01:54,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 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 160 [2022-11-18 20:01:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:54,622 INFO L225 Difference]: With dead ends: 1631 [2022-11-18 20:01:54,622 INFO L226 Difference]: Without dead ends: 869 [2022-11-18 20:01:54,624 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-18 20:01:54,627 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 140 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:54,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 700 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:01:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-11-18 20:01:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 831. [2022-11-18 20:01:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 645 states have (on average 1.2682170542635658) internal successors, (818), 653 states have internal predecessors, (818), 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-18 20:01:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1079 transitions. [2022-11-18 20:01:54,718 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1079 transitions. Word has length 160 [2022-11-18 20:01:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:54,719 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1079 transitions. [2022-11-18 20:01:54,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 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-18 20:01:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1079 transitions. [2022-11-18 20:01:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-18 20:01:54,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:54,723 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] [2022-11-18 20:01:54,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:01:54,723 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1579044611, now seen corresponding path program 1 times [2022-11-18 20:01:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:54,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880891239] [2022-11-18 20:01:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:01:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:01:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-18 20:01:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-18 20:01:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:01:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-18 20:01:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-18 20:01:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 20:01:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:01:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:01:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-18 20:01:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:55,158 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-18 20:01:55,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:55,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880891239] [2022-11-18 20:01:55,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880891239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:55,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:01:55,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:01:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467074990] [2022-11-18 20:01:55,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:55,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:01:55,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:55,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:01:55,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:01:55,161 INFO L87 Difference]: Start difference. First operand 831 states and 1079 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 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-18 20:01:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:55,937 INFO L93 Difference]: Finished difference Result 2245 states and 3010 transitions. [2022-11-18 20:01:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:01:55,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 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 169 [2022-11-18 20:01:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:55,945 INFO L225 Difference]: With dead ends: 2245 [2022-11-18 20:01:55,945 INFO L226 Difference]: Without dead ends: 1433 [2022-11-18 20:01:55,948 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-18 20:01:55,948 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 460 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:55,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1443 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:01:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-11-18 20:01:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 843. [2022-11-18 20:01:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 657 states have (on average 1.2633181126331812) internal successors, (830), 665 states have internal predecessors, (830), 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-18 20:01:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1091 transitions. [2022-11-18 20:01:56,104 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1091 transitions. Word has length 169 [2022-11-18 20:01:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:56,105 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1091 transitions. [2022-11-18 20:01:56,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 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-18 20:01:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1091 transitions. [2022-11-18 20:01:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-18 20:01:56,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:56,111 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] [2022-11-18 20:01:56,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:01:56,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash 376998294, now seen corresponding path program 1 times [2022-11-18 20:01:56,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:56,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113107456] [2022-11-18 20:01:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:01:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:01:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:01:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:01:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 20:01:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:01:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-18 20:01:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:01:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-18 20:01:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:01:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 20:01:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:56,568 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-18 20:01:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:56,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113107456] [2022-11-18 20:01:56,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113107456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:56,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832975876] [2022-11-18 20:01:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:56,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:56,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:56,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:56,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:01:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:57,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:01:57,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:57,164 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-18 20:01:57,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:01:57,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832975876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:57,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:01:57,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-18 20:01:57,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475583268] [2022-11-18 20:01:57,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:57,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:01:57,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:57,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:01:57,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:01:57,201 INFO L87 Difference]: Start difference. First operand 843 states and 1091 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-18 20:01:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:57,613 INFO L93 Difference]: Finished difference Result 2737 states and 3576 transitions. [2022-11-18 20:01:57,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:01:57,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 171 [2022-11-18 20:01:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:57,645 INFO L225 Difference]: With dead ends: 2737 [2022-11-18 20:01:57,645 INFO L226 Difference]: Without dead ends: 1913 [2022-11-18 20:01:57,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 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-18 20:01:57,649 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 386 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1816 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-18 20:01:57,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1816 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:01:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-11-18 20:01:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 879. [2022-11-18 20:01:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 685 states have (on average 1.2525547445255474) internal successors, (858), 693 states have internal predecessors, (858), 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-18 20:01:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1135 transitions. [2022-11-18 20:01:57,808 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1135 transitions. Word has length 171 [2022-11-18 20:01:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:57,808 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1135 transitions. [2022-11-18 20:01:57,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-18 20:01:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1135 transitions. [2022-11-18 20:01:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-18 20:01:57,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:57,813 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] [2022-11-18 20:01:57,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:01:58,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:58,022 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:01:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:01:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash -634118956, now seen corresponding path program 1 times [2022-11-18 20:01:58,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:01:58,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854066041] [2022-11-18 20:01:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:01:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:01:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:01:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:01:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:01:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:01:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:01:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 20:01:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:01:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:01:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-18 20:01:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-18 20:01:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-18 20:01:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:01:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 20:01:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:58,871 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-18 20:01:58,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:01:58,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854066041] [2022-11-18 20:01:58,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854066041] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:01:58,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30726775] [2022-11-18 20:01:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:01:58,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:01:58,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:01:58,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:01:58,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:01:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:01:59,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:01:59,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:01:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-18 20:01:59,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:01:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30726775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:01:59,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:01:59,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2022-11-18 20:01:59,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134586736] [2022-11-18 20:01:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:01:59,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:01:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:01:59,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:01:59,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:01:59,553 INFO L87 Difference]: Start difference. First operand 879 states and 1135 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 5 states have internal predecessors, (110), 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-18 20:01:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:01:59,794 INFO L93 Difference]: Finished difference Result 2117 states and 2808 transitions. [2022-11-18 20:01:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:01:59,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 5 states have internal predecessors, (110), 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 171 [2022-11-18 20:01:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:01:59,801 INFO L225 Difference]: With dead ends: 2117 [2022-11-18 20:01:59,801 INFO L226 Difference]: Without dead ends: 1257 [2022-11-18 20:01:59,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:01:59,804 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 96 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:01:59,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1821 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:01:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-11-18 20:01:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 899. [2022-11-18 20:01:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 701 states have (on average 1.24679029957204) internal successors, (874), 709 states have internal predecessors, (874), 138 states have call successors, (138), 56 states have call predecessors, (138), 59 states have return successors, (155), 141 states have call predecessors, (155), 137 states have call successors, (155) [2022-11-18 20:01:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1167 transitions. [2022-11-18 20:01:59,967 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1167 transitions. Word has length 171 [2022-11-18 20:01:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:01:59,968 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 1167 transitions. [2022-11-18 20:01:59,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 5 states have internal predecessors, (110), 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-18 20:01:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1167 transitions. [2022-11-18 20:01:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-18 20:01:59,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:01:59,974 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] [2022-11-18 20:01:59,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 20:02:00,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:02:00,181 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:02:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:00,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1303152264, now seen corresponding path program 1 times [2022-11-18 20:02:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:00,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175560962] [2022-11-18 20:02:00,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:02:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:02:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-18 20:02:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:02:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-18 20:02:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:02:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-18 20:02:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-18 20:02:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:02:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 20:02:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 20:02:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-18 20:02:01,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:01,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175560962] [2022-11-18 20:02:01,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175560962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:01,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738072432] [2022-11-18 20:02:01,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:01,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:01,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:01,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:01,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:02:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:01,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:02:01,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-18 20:02:01,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:01,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738072432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:01,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:02:01,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-11-18 20:02:01,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709359789] [2022-11-18 20:02:01,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:01,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:02:01,715 INFO L87 Difference]: Start difference. First operand 899 states and 1167 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:02:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:01,889 INFO L93 Difference]: Finished difference Result 1787 states and 2323 transitions. [2022-11-18 20:02:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:02:01,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 177 [2022-11-18 20:02:01,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:01,895 INFO L225 Difference]: With dead ends: 1787 [2022-11-18 20:02:01,895 INFO L226 Difference]: Without dead ends: 899 [2022-11-18 20:02:01,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 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-18 20:02:01,899 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1070 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-18 20:02:01,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1070 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:02:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-11-18 20:02:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-11-18 20:02:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 701 states have (on average 1.24679029957204) internal successors, (874), 709 states have internal predecessors, (874), 138 states have call successors, (138), 56 states have call predecessors, (138), 59 states have return successors, (151), 141 states have call predecessors, (151), 137 states have call successors, (151) [2022-11-18 20:02:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1163 transitions. [2022-11-18 20:02:02,055 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1163 transitions. Word has length 177 [2022-11-18 20:02:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:02,056 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 1163 transitions. [2022-11-18 20:02:02,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:02:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1163 transitions. [2022-11-18 20:02:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-11-18 20:02:02,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:02,061 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:02,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:02,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:02:02,271 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:02:02,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1520619492, now seen corresponding path program 2 times [2022-11-18 20:02:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:02,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898599830] [2022-11-18 20:02:02,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:02:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:02:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:02:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:02:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:02:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:02:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 20:02:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:02:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:02:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-18 20:02:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-18 20:02:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-18 20:02:03,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:03,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898599830] [2022-11-18 20:02:03,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898599830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:03,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982525462] [2022-11-18 20:02:03,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:02:03,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:03,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:03,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:03,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:02:04,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:02:04,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:02:04,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:02:04,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-18 20:02:04,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:04,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982525462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:04,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:02:04,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-11-18 20:02:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144897854] [2022-11-18 20:02:04,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:04,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:02:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:04,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:02:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:02:04,327 INFO L87 Difference]: Start difference. First operand 899 states and 1163 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-18 20:02:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:05,321 INFO L93 Difference]: Finished difference Result 2577 states and 3418 transitions. [2022-11-18 20:02:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:02:05,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 183 [2022-11-18 20:02:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:05,330 INFO L225 Difference]: With dead ends: 2577 [2022-11-18 20:02:05,330 INFO L226 Difference]: Without dead ends: 1687 [2022-11-18 20:02:05,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:02:05,334 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 673 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1267 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-18 20:02:05,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1267 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:02:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2022-11-18 20:02:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1117. [2022-11-18 20:02:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 882 states have (on average 1.2414965986394557) internal successors, (1095), 894 states have internal predecessors, (1095), 155 states have call successors, (155), 74 states have call predecessors, (155), 79 states have return successors, (174), 160 states have call predecessors, (174), 154 states have call successors, (174) [2022-11-18 20:02:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1424 transitions. [2022-11-18 20:02:05,647 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1424 transitions. Word has length 183 [2022-11-18 20:02:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:05,648 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1424 transitions. [2022-11-18 20:02:05,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-18 20:02:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1424 transitions. [2022-11-18 20:02:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-18 20:02:05,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:05,654 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:05,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 20:02:05,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:05,867 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:02:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash 596352549, now seen corresponding path program 1 times [2022-11-18 20:02:05,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:05,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210443706] [2022-11-18 20:02:05,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:02:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:02:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:02:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:02:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:02:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:02:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 20:02:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:02:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:02:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-18 20:02:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 20:02:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-18 20:02:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:06,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210443706] [2022-11-18 20:02:06,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210443706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:06,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837789894] [2022-11-18 20:02:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:06,460 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:06,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:02:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:07,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 1807 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:02:07,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-18 20:02:07,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:02:07,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837789894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:07,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:02:07,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-18 20:02:07,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493343808] [2022-11-18 20:02:07,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:07,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:02:07,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:07,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:02:07,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:02:07,444 INFO L87 Difference]: Start difference. First operand 1117 states and 1424 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-18 20:02:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:08,105 INFO L93 Difference]: Finished difference Result 3013 states and 3844 transitions. [2022-11-18 20:02:08,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:02:08,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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 198 [2022-11-18 20:02:08,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:08,119 INFO L225 Difference]: With dead ends: 3013 [2022-11-18 20:02:08,119 INFO L226 Difference]: Without dead ends: 3005 [2022-11-18 20:02:08,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 234 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-18 20:02:08,124 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 386 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:08,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1043 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2022-11-18 20:02:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2989. [2022-11-18 20:02:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2357 states have (on average 1.243954179041154) internal successors, (2932), 2395 states have internal predecessors, (2932), 418 states have call successors, (418), 196 states have call predecessors, (418), 213 states have return successors, (471), 429 states have call predecessors, (471), 417 states have call successors, (471) [2022-11-18 20:02:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 3821 transitions. [2022-11-18 20:02:08,652 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 3821 transitions. Word has length 198 [2022-11-18 20:02:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:08,652 INFO L495 AbstractCegarLoop]: Abstraction has 2989 states and 3821 transitions. [2022-11-18 20:02:08,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-18 20:02:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 3821 transitions. [2022-11-18 20:02:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-18 20:02:08,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:08,658 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:08,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:08,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:02:08,872 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:02:08,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash -414764701, now seen corresponding path program 1 times [2022-11-18 20:02:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:08,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510428522] [2022-11-18 20:02:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:08,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:02:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:02:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:02:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:02:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:02:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:02:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 20:02:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:02:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:02:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-18 20:02:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 20:02:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-18 20:02:09,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:09,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510428522] [2022-11-18 20:02:09,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510428522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:09,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:09,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:02:09,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349457199] [2022-11-18 20:02:09,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:09,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:02:09,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:09,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:02:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:02:09,308 INFO L87 Difference]: Start difference. First operand 2989 states and 3821 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 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-18 20:02:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:11,534 INFO L93 Difference]: Finished difference Result 8571 states and 11020 transitions. [2022-11-18 20:02:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:02:11,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 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 198 [2022-11-18 20:02:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:11,563 INFO L225 Difference]: With dead ends: 8571 [2022-11-18 20:02:11,563 INFO L226 Difference]: Without dead ends: 5601 [2022-11-18 20:02:11,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:02:11,573 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 474 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:11,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1424 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 20:02:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5601 states. [2022-11-18 20:02:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5601 to 4957. [2022-11-18 20:02:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4957 states, 3878 states have (on average 1.2470345538937597) internal successors, (4836), 3970 states have internal predecessors, (4836), 715 states have call successors, (715), 334 states have call predecessors, (715), 363 states have return successors, (804), 704 states have call predecessors, (804), 714 states have call successors, (804) [2022-11-18 20:02:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4957 states to 4957 states and 6355 transitions. [2022-11-18 20:02:12,690 INFO L78 Accepts]: Start accepts. Automaton has 4957 states and 6355 transitions. Word has length 198 [2022-11-18 20:02:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:12,695 INFO L495 AbstractCegarLoop]: Abstraction has 4957 states and 6355 transitions. [2022-11-18 20:02:12,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 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-18 20:02:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4957 states and 6355 transitions. [2022-11-18 20:02:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-18 20:02:12,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:12,725 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:02:12,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:02:12,725 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:02:12,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2110494111, now seen corresponding path program 1 times [2022-11-18 20:02:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:12,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926702770] [2022-11-18 20:02:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:13,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:02:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:13,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:02:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:02:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:02:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:02:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-18 20:02:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-18 20:02:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-18 20:02:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:02:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-18 20:02:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:02:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-18 20:02:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-18 20:02:14,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:14,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926702770] [2022-11-18 20:02:14,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926702770] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:14,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55811332] [2022-11-18 20:02:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:14,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:14,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:02:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:15,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-18 20:02:15,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:15,144 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-18 20:02:15,236 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-18 20:02:15,824 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1050 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1050) |c_#memory_int|)) is different from true [2022-11-18 20:02:15,895 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-18 20:02:15,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:15,936 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-18 20:02:15,948 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:02:15,949 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-18 20:02:17,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:02:18,162 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-18 20:02:18,184 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-18 20:02:18,420 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-18 20:02:18,435 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-18 20:02:18,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:18,465 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-18 20:02:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-11-18 20:02:18,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:02:20,551 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1061 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1061) |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-18 20:02:20,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55811332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:20,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:02:20,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-11-18 20:02:20,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333485028] [2022-11-18 20:02:20,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:02:20,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-18 20:02:20,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:20,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-18 20:02:20,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1423, Unknown=12, NotChecked=154, Total=1722 [2022-11-18 20:02:20,583 INFO L87 Difference]: Start difference. First operand 4957 states and 6355 transitions. Second operand has 41 states, 38 states have (on average 6.394736842105263) internal successors, (243), 28 states have internal predecessors, (243), 13 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (37), 17 states have call predecessors, (37), 13 states have call successors, (37) [2022-11-18 20:02:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:24,834 INFO L93 Difference]: Finished difference Result 13154 states and 17242 transitions. [2022-11-18 20:02:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-18 20:02:24,835 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 6.394736842105263) internal successors, (243), 28 states have internal predecessors, (243), 13 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (37), 17 states have call predecessors, (37), 13 states have call successors, (37) Word has length 205 [2022-11-18 20:02:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:24,898 INFO L225 Difference]: With dead ends: 13154 [2022-11-18 20:02:24,902 INFO L226 Difference]: Without dead ends: 8216 [2022-11-18 20:02:24,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 248 SyntacticMatches, 16 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=291, Invalid=3858, Unknown=19, NotChecked=254, Total=4422 [2022-11-18 20:02:24,916 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 725 mSDsluCounter, 7593 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 8039 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1897 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:24,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 8039 Invalid, 3643 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 1540 Invalid, 0 Unknown, 1897 Unchecked, 1.7s Time] [2022-11-18 20:02:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8216 states. [2022-11-18 20:02:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8216 to 5888. [2022-11-18 20:02:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5888 states, 4639 states have (on average 1.2440181073507222) internal successors, (5771), 4727 states have internal predecessors, (5771), 812 states have call successors, (812), 375 states have call predecessors, (812), 436 states have return successors, (995), 849 states have call predecessors, (995), 811 states have call successors, (995) [2022-11-18 20:02:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5888 states to 5888 states and 7578 transitions. [2022-11-18 20:02:26,143 INFO L78 Accepts]: Start accepts. Automaton has 5888 states and 7578 transitions. Word has length 205 [2022-11-18 20:02:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:26,143 INFO L495 AbstractCegarLoop]: Abstraction has 5888 states and 7578 transitions. [2022-11-18 20:02:26,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 6.394736842105263) internal successors, (243), 28 states have internal predecessors, (243), 13 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (37), 17 states have call predecessors, (37), 13 states have call successors, (37) [2022-11-18 20:02:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5888 states and 7578 transitions. [2022-11-18 20:02:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-11-18 20:02:26,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:26,156 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] [2022-11-18 20:02:26,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:26,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:02:26,367 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:02:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1569918211, now seen corresponding path program 2 times [2022-11-18 20:02:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:26,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514234582] [2022-11-18 20:02:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:26,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:02:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:02:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:02:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:02:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:02:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-18 20:02:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-18 20:02:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:02:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 20:02:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:28,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-18 20:02:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:28,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-18 20:02:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:28,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:02:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:28,163 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-18 20:02:28,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:28,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514234582] [2022-11-18 20:02:28,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514234582] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:28,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269549831] [2022-11-18 20:02:28,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:02:28,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:28,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:28,166 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:28,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:02:46,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:02:46,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:02:46,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-18 20:02:46,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:46,744 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-18 20:02:46,805 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-18 20:02:47,293 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-18 20:02:47,298 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1344 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1344))) is different from true [2022-11-18 20:02:47,382 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-18 20:02:47,387 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-18 20:02:47,439 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:02:47,439 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-18 20:02:47,444 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-18 20:02:47,589 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-18 20:02:47,727 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-18 20:02:47,839 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:02:47,839 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-18 20:02:48,274 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-18 20:02:48,742 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:02:48,743 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-18 20:02:49,754 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-18 20:02:50,101 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-18 20:02:50,116 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-18 20:02:50,343 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-18 20:02:50,355 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-18 20:02:50,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:50,388 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-18 20:02:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 54 refuted. 12 times theorem prover too weak. 27 trivial. 2 not checked. [2022-11-18 20:02:50,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:02:52,534 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 (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_1356) |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-18 20:02:52,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269549831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:52,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:02:52,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 38] total 49 [2022-11-18 20:02:52,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27423376] [2022-11-18 20:02:52,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:02:52,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-18 20:02:52,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:52,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-18 20:02:52,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2268, Unknown=34, NotChecked=194, Total=2652 [2022-11-18 20:02:52,559 INFO L87 Difference]: Start difference. First operand 5888 states and 7578 transitions. Second operand has 49 states, 46 states have (on average 5.521739130434782) internal successors, (254), 35 states have internal predecessors, (254), 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-18 20:02:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:56,941 INFO L93 Difference]: Finished difference Result 15246 states and 20190 transitions. [2022-11-18 20:02:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-18 20:02:56,942 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 5.521739130434782) internal successors, (254), 35 states have internal predecessors, (254), 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 211 [2022-11-18 20:02:56,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:56,976 INFO L225 Difference]: With dead ends: 15246 [2022-11-18 20:02:56,976 INFO L226 Difference]: Without dead ends: 9996 [2022-11-18 20:02:56,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 248 SyntacticMatches, 17 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1666 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=322, Invalid=5336, Unknown=50, NotChecked=298, Total=6006 [2022-11-18 20:02:56,990 INFO L413 NwaCegarLoop]: 498 mSDtfsCounter, 586 mSDsluCounter, 13561 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 14059 SdHoareTripleChecker+Invalid, 4900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3129 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:56,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 14059 Invalid, 4900 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 1671 Invalid, 0 Unknown, 3129 Unchecked, 1.6s Time] [2022-11-18 20:02:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9996 states. [2022-11-18 20:02:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9996 to 6134. [2022-11-18 20:02:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 4838 states have (on average 1.2455560148821827) internal successors, (6026), 4932 states have internal predecessors, (6026), 837 states have call successors, (837), 391 states have call predecessors, (837), 458 states have return successors, (1032), 872 states have call predecessors, (1032), 836 states have call successors, (1032) [2022-11-18 20:02:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 7895 transitions. [2022-11-18 20:02:58,225 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 7895 transitions. Word has length 211 [2022-11-18 20:02:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:58,225 INFO L495 AbstractCegarLoop]: Abstraction has 6134 states and 7895 transitions. [2022-11-18 20:02:58,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 5.521739130434782) internal successors, (254), 35 states have internal predecessors, (254), 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-18 20:02:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 7895 transitions. [2022-11-18 20:02:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-11-18 20:02:58,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:58,242 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] [2022-11-18 20:02:58,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:02:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:02:58,459 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:02:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 358947423, now seen corresponding path program 3 times [2022-11-18 20:02:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:58,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802461354] [2022-11-18 20:02:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:02:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:02:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:02:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:02:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:02:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:02:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-18 20:02:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:02:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-18 20:02:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:02:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 20:02:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-18 20:02:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-18 20:02:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:02:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-18 20:02:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-18 20:02:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:59,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802461354] [2022-11-18 20:02:59,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802461354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:59,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:59,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:02:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251699957] [2022-11-18 20:02:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:59,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:02:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:02:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:02:59,264 INFO L87 Difference]: Start difference. First operand 6134 states and 7895 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 4 states have internal predecessors, (128), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:03:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:01,654 INFO L93 Difference]: Finished difference Result 14782 states and 19589 transitions. [2022-11-18 20:03:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:03:01,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 4 states have internal predecessors, (128), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 217 [2022-11-18 20:03:01,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:01,688 INFO L225 Difference]: With dead ends: 14782 [2022-11-18 20:03:01,688 INFO L226 Difference]: Without dead ends: 9532 [2022-11-18 20:03:01,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 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-18 20:03:01,768 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 233 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:01,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 2167 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 20:03:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9532 states. [2022-11-18 20:03:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9532 to 6264. [2022-11-18 20:03:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6264 states, 4942 states have (on average 1.245649534601376) internal successors, (6156), 5010 states have internal predecessors, (6156), 863 states have call successors, (863), 391 states have call predecessors, (863), 458 states have return successors, (1058), 924 states have call predecessors, (1058), 862 states have call successors, (1058) [2022-11-18 20:03:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6264 states to 6264 states and 8077 transitions. [2022-11-18 20:03:02,927 INFO L78 Accepts]: Start accepts. Automaton has 6264 states and 8077 transitions. Word has length 217 [2022-11-18 20:03:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:02,928 INFO L495 AbstractCegarLoop]: Abstraction has 6264 states and 8077 transitions. [2022-11-18 20:03:02,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 4 states have internal predecessors, (128), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:03:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6264 states and 8077 transitions. [2022-11-18 20:03:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-11-18 20:03:02,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:02,940 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] [2022-11-18 20:03:02,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:03:02,941 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:02,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:02,941 INFO L85 PathProgramCache]: Analyzing trace with hash -576159613, now seen corresponding path program 1 times [2022-11-18 20:03:02,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:02,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821491160] [2022-11-18 20:03:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:03:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:07,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:03:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:03:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:03:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:03:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:03:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 20:03:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:08,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-18 20:03:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:03:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-18 20:03:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 20:03:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:03:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 20:03:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:03:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-18 20:03:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-18 20:03:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:09,636 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-18 20:03:09,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:09,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821491160] [2022-11-18 20:03:09,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821491160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:09,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061285989] [2022-11-18 20:03:09,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:09,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:09,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:09,639 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:09,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:03:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:10,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 1899 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-18 20:03:10,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:10,307 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-18 20:03:10,390 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-18 20:03:10,948 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-18 20:03:10,955 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1807 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1807) |c_#memory_int|)) is different from true [2022-11-18 20:03:11,124 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-18 20:03:11,127 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-18 20:03:11,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:11,163 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-18 20:03:11,186 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-18 20:03:11,189 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-18 20:03:11,331 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-18 20:03:11,542 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-18 20:03:11,676 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:03:11,676 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-18 20:03:12,263 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-18 20:03:12,473 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-18 20:03:13,282 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:03:13,283 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-18 20:03:13,512 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-18 20:03:14,375 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 20:03:14,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:03:14,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:03:15,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:03:15,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:03:15,614 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-18 20:03:15,622 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-18 20:03:15,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:15,641 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-18 20:03:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 36 proven. 81 refuted. 12 times theorem prover too weak. 42 trivial. 2 not checked. [2022-11-18 20:03:15,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:15,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1820 (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_1820) |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-18 20:03:15,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061285989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:15,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:03:15,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 41] total 77 [2022-11-18 20:03:15,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269757250] [2022-11-18 20:03:15,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:15,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-18 20:03:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:15,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-18 20:03:15,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=5360, Unknown=26, NotChecked=298, Total=6006 [2022-11-18 20:03:15,684 INFO L87 Difference]: Start difference. First operand 6264 states and 8077 transitions. Second operand has 77 states, 72 states have (on average 3.6944444444444446) internal successors, (266), 60 states have internal predecessors, (266), 27 states have call successors, (44), 12 states have call predecessors, (44), 22 states have return successors, (45), 32 states have call predecessors, (45), 27 states have call successors, (45) [2022-11-18 20:03:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:29,388 INFO L93 Difference]: Finished difference Result 15339 states and 20154 transitions. [2022-11-18 20:03:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-18 20:03:29,389 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 72 states have (on average 3.6944444444444446) internal successors, (266), 60 states have internal predecessors, (266), 27 states have call successors, (44), 12 states have call predecessors, (44), 22 states have return successors, (45), 32 states have call predecessors, (45), 27 states have call successors, (45) Word has length 223 [2022-11-18 20:03:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:29,421 INFO L225 Difference]: With dead ends: 15339 [2022-11-18 20:03:29,421 INFO L226 Difference]: Without dead ends: 9927 [2022-11-18 20:03:29,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 268 SyntacticMatches, 20 SemanticMatches, 121 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5074 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=808, Invalid=13680, Unknown=40, NotChecked=478, Total=15006 [2022-11-18 20:03:29,437 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 1417 mSDsluCounter, 15839 mSDsCounter, 0 mSdLazyCounter, 8219 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 16333 SdHoareTripleChecker+Invalid, 12811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 8219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4206 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:29,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 16333 Invalid, 12811 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [386 Valid, 8219 Invalid, 0 Unknown, 4206 Unchecked, 8.9s Time] [2022-11-18 20:03:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9927 states. [2022-11-18 20:03:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9927 to 7564. [2022-11-18 20:03:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7564 states, 6074 states have (on average 1.2614422127099112) internal successors, (7662), 6158 states have internal predecessors, (7662), 975 states have call successors, (975), 439 states have call predecessors, (975), 514 states have return successors, (1194), 1030 states have call predecessors, (1194), 974 states have call successors, (1194) [2022-11-18 20:03:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 9831 transitions. [2022-11-18 20:03:30,604 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 9831 transitions. Word has length 223 [2022-11-18 20:03:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:30,605 INFO L495 AbstractCegarLoop]: Abstraction has 7564 states and 9831 transitions. [2022-11-18 20:03:30,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 72 states have (on average 3.6944444444444446) internal successors, (266), 60 states have internal predecessors, (266), 27 states have call successors, (44), 12 states have call predecessors, (44), 22 states have return successors, (45), 32 states have call predecessors, (45), 27 states have call successors, (45) [2022-11-18 20:03:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 9831 transitions. [2022-11-18 20:03:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-11-18 20:03:30,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:30,621 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] [2022-11-18 20:03:30,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:30,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:30,831 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:30,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:30,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1571744360, now seen corresponding path program 1 times [2022-11-18 20:03:30,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:30,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331424017] [2022-11-18 20:03:30,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:30,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:03:31,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:03:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:03:32,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:03:32,712 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:03:32,713 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:03:32,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 20:03:32,719 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:32,723 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:03:33,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:03:33 BoogieIcfgContainer [2022-11-18 20:03:33,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:03:33,012 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:03:33,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:03:33,013 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:03:33,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:01:44" (3/4) ... [2022-11-18 20:03:33,017 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:03:33,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:03:33,020 INFO L158 Benchmark]: Toolchain (without parser) took 111728.10ms. Allocated memory was 104.9MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 64.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 186.5MB. Max. memory is 16.1GB. [2022-11-18 20:03:33,021 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 58.1MB in the beginning and 58.1MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:03:33,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1588.04ms. Allocated memory is still 104.9MB. Free memory was 63.9MB in the beginning and 46.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-11-18 20:03:33,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.62ms. Allocated memory was 104.9MB in the beginning and 146.8MB in the end (delta: 41.9MB). Free memory was 46.7MB in the beginning and 108.1MB in the end (delta: -61.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-11-18 20:03:33,026 INFO L158 Benchmark]: Boogie Preprocessor took 86.53ms. Allocated memory is still 146.8MB. Free memory was 108.1MB in the beginning and 101.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:03:33,026 INFO L158 Benchmark]: RCFGBuilder took 1615.46ms. Allocated memory is still 146.8MB. Free memory was 101.8MB in the beginning and 96.9MB in the end (delta: 4.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-11-18 20:03:33,027 INFO L158 Benchmark]: TraceAbstraction took 108251.58ms. Allocated memory was 146.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 96.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 896.3MB. Max. memory is 16.1GB. [2022-11-18 20:03:33,027 INFO L158 Benchmark]: Witness Printer took 7.32ms. Allocated memory is still 1.5GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:03:33,028 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.16ms. Allocated memory is still 79.7MB. Free memory was 58.1MB in the beginning and 58.1MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1588.04ms. Allocated memory is still 104.9MB. Free memory was 63.9MB in the beginning and 46.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 153.62ms. Allocated memory was 104.9MB in the beginning and 146.8MB in the end (delta: 41.9MB). Free memory was 46.7MB in the beginning and 108.1MB in the end (delta: -61.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.53ms. Allocated memory is still 146.8MB. Free memory was 108.1MB in the beginning and 101.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1615.46ms. Allocated memory is still 146.8MB. Free memory was 101.8MB in the beginning and 96.9MB in the end (delta: 4.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 108251.58ms. Allocated memory was 146.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 96.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 896.3MB. Max. memory is 16.1GB. * Witness Printer took 7.32ms. Allocated memory is still 1.5GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 3349, overapproximation of strlen at line 3775, overapproximation of bitwiseOr at line 3798, overapproximation of bitwiseAnd at line 3403. Possible FailurePath: [L4062] struct urb *usb_urb = (struct urb *)0; [L4060] int SERIAL_STATE = 0; [L3540] int LDV_IN_INTERRUPT = 1; [L3834] struct usb_device_id const __mod_usb_device_table ; [L4061] void *usb_intfdata = (void *)0; [L4067] void (*completeFnInt)(struct urb * ) ; [L3862] int ldv_retval_0 ; [L4063] struct usb_device *usb_dev = (struct usb_device *)0; [L3863] int ldv_retval_1 ; [L4064] int dev_counter = 0; [L4068] void (*completeFnBulk)(struct urb * ) ; [L3541] int ref_cnt ; [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}; [L4059] int INTERF_STATE = 0; [L4065] int completeFnIntCounter = 0; [L4066] int completeFnBulkCounter = 0; [L3545] int ldv_state_variable_0 ; [L3542] int ldv_state_variable_1 ; [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}}; [L3543] int usb_counter ; [L3544] struct usb_interface *usb_acecad_driver_group1 ; 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, calloc(1UL, size)={-36893488147419103233: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, calloc(1UL, size)={-36893488147419103233: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={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, calloc(1UL, size)={-36893488147419103233: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={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, calloc(1UL, size)={-36893488147419103233: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={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-36893488147419103233: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ldv_func_arg1={14:0}, ldv_func_arg1={14:0}, ldv_func_arg2={1073741953:1073741973}, ldv_func_arg2={1073741953:1073741973}, ldv_func_arg3={4:0}, ldv_func_arg3={4: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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={14:0}, driver={14: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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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=1822, tmp={-55340232221128654849:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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=1822, tmp={-55340232221128654849:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, 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=1822, tmp={-55340232221128654849:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={-55340232221128654849:0}, SERIAL_STATE=0, tmp={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={-55340232221128654849:0}, SERIAL_STATE=0, tmp={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, 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={-55340232221128654849:0}, SERIAL_STATE=0, tmp={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, id={-18446744073709551617:0}, id={-18446744073709551617:0}, INTERF_STATE=0, interface={1073741959:-11}, interface->desc.bNumEndpoints=-255, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={1073741985:0}, epd={1073741985:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={1073741985:0}, epd={1073741985:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-55340232221128654849:0}, udev={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-55340232221128654849:0}, udev={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3393] COND FALSE !(is_out != 0) [L3403] __ret_warn_on___0 = (pipe & 128) == 0 VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-55340232221128654849:0}, udev={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3404] CALL, EXPR ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3404] RET, EXPR ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-55340232221128654849:0}, udev={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3404] tmp___0 = ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) [L3405] COND FALSE !(tmp___0 != 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-55340232221128654849:0}, udev={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3409] CALL ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3409] RET ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-55340232221128654849:0}, udev={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3410] EXPR udev->ep_in[epnum] [L3410] ep = udev->ep_in[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)=0, \old(pipe)=32767, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, ep={0:0}, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-55340232221128654849:0}, udev={-55340232221128654849:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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=232, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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=232, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, 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=232, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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=232, t=32768, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, 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={-18446744073709551615:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, 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={-18446744073709551615:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233:0}, kzalloc(232UL, 208U)={-18446744073709551615: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206465:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206465:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, 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={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206465:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-73786976294838206465:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, t=32768, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, 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={-73786976294838206465:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-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={1073741953:1073741973}, 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={-73786976294838206465:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-92233720368547758081:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-92233720368547758081:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={-92233720368547758081:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={1073741953:1073741973}, 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={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-92233720368547758081:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, arg0={-55340232221128654849:0}, arg0={-55340232221128654849:0}, arg1=8, arg2=208, arg3={-18446744073709551615:224}, arg3={-18446744073709551615:224}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-92233720368547758081:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, acecad->data={-92233720368547758081:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={18:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={18:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={18:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={18:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={18:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={1073741953:1073741973}, 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={18:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={18:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={18: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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={18:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={18: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15: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={1073741953:1073741973}, 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={18:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={18: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={1073741953:1073741973}, 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={18:0}, tmp___0=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={18: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={1073741953:1073741973}, 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={18:0}, tmp___0=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18:0}, value={18:0}] [L4105] return (usb_urb); VAL [={0:0}, ={0:0}, \result={18:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={1073741953:1073741973}, 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={18:0}, tmp___0=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18:0}, value={18: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={18:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={1073741953:1073741973}, 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={18:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, acecad->irq={18:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev->manufacturer={0:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev->product={0:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, actual=-1, buf={-18446744073709551615:128}, buf={-18446744073709551615:128}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev={-55340232221128654849: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, snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath))=-1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, arg0={-18446744073709551615:128}, arg1={9: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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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)=1073741955, tmp={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18:0}] [L3775] tmp___5 = strlen((char const *)(& acecad->name)) [L3776] COND TRUE tmp___5 == 0UL [L3778] dev->descriptor.idVendor [L3778] dev->descriptor.idProduct [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={1073741953:1073741973}, 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={18:0}, urb={18:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, acecad->data={-92233720368547758081:0}, acecad->data_dma=1073741972, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18:0}] [L3807] FCALL usb_free_coherent(dev, 8UL, (void *)acecad->data, acecad->data_dma) 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={1073741953:1073741973}, acecad={-18446744073709551615:0}, acecad->data={-92233720368547758081:0}, acecad->data_dma=1073741972, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18:0}] [L3809] FCALL input_free_device(input_dev) [L3810] CALL 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={1073741953:1073741973}, 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={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18:0}] [L3810] RET 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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, acecad={-18446744073709551615:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-55340232221128654849:0}, dev_counter=0, endpoint={1073741985:0}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, INTERF_STATE=0, interface={1073741959:-11}, intf={-36893488147419103233:0}, intf={-36893488147419103233: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={-55340232221128654849:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-18446744073709551615:0}, tmp___4={-92233720368547758081:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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 [={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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: [L3922] case 1: 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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, arg={14:0}, arg={14: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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18: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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18:0}] [L4056] reach_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={1073741953:1073741973}, 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={14:0}, usb_acecad_driver_group1={-36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 107.9s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8413 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8038 mSDsluCounter, 56318 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9232 IncrementalHoareTripleChecker+Unchecked, 49454 mSDsCounter, 1979 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15651 IncrementalHoareTripleChecker+Invalid, 26862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1979 mSolverCounterUnsat, 6864 mSDtfsCounter, 15651 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2546 GetRequests, 2088 SyntacticMatches, 56 SemanticMatches, 402 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7564occurred in iteration=20, InterpolantAutomatonStates: 274, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 15404 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 21.9s SatisfiabilityAnalysisTime, 34.8s InterpolantComputationTime, 4461 NumberOfCodeBlocks, 4335 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4198 ConstructedInterpolants, 241 QuantifiedInterpolants, 15618 SizeOfPredicates, 111 NumberOfNonLiveVariables, 12080 ConjunctsInSsa, 411 ConjunctsInUnsatCore, 28 InterpolantComputations, 17 PerfectInterpolantSequences, 1756/2059 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-18 20:03:33,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 20:03:35,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:03:35,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:03:35,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:03:35,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:03:35,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:03:35,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:03:35,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:03:35,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:03:35,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:03:35,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:03:35,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:03:35,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:03:35,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:03:35,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:03:35,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:03:35,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:03:35,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:03:35,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:03:35,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:03:35,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:03:35,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:03:35,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:03:35,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:03:35,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:03:35,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:03:35,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:03:35,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:03:35,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:03:35,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:03:35,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:03:35,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:03:35,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:03:35,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:03:35,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:03:35,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:03:35,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:03:35,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:03:35,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:03:35,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:03:35,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:03:35,533 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-18 20:03:35,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:03:35,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:03:35,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:03:35,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:03:35,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:03:35,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:03:35,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:03:35,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:03:35,587 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:03:35,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:03:35,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:03:35,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:03:35,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:03:35,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:03:35,590 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:03:35,590 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:03:35,590 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:03:35,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:03:35,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:03:35,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:03:35,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:03:35,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:03:35,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:03:35,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:03:35,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:03:35,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:03:35,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:03:35,593 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:03:35,593 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:03:35,594 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:03:35,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:03:35,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:03:35,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:03:35,595 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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro 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-18 20:03:36,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:03:36,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:03:36,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:03:36,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:03:36,060 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:03:36,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/../../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-18 20:03:36,139 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data/3b89b6bd0/e6aa538fc8144fb392ccefbf0f0b85bd/FLAG80ba681f8 [2022-11-18 20:03:36,853 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:03:36,854 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/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-18 20:03:36,893 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data/3b89b6bd0/e6aa538fc8144fb392ccefbf0f0b85bd/FLAG80ba681f8 [2022-11-18 20:03:37,000 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/data/3b89b6bd0/e6aa538fc8144fb392ccefbf0f0b85bd [2022-11-18 20:03:37,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:03:37,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:03:37,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:03:37,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:03:37,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:03:37,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:03:37" (1/1) ... [2022-11-18 20:03:37,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7f324c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:37, skipping insertion in model container [2022-11-18 20:03:37,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:03:37" (1/1) ... [2022-11-18 20:03:37,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:03:37,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:03:37,920 WARN L234 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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/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-18 20:03:37,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:03:37,997 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 20:03:38,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:03:38,175 WARN L234 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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/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-18 20:03:38,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:03:38,200 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:03:38,365 WARN L234 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_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/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-18 20:03:38,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:03:38,413 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:03:38,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38 WrapperNode [2022-11-18 20:03:38,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:03:38,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:03:38,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:03:38,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:03:38,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,524 INFO L138 Inliner]: procedures = 116, calls = 317, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 740 [2022-11-18 20:03:38,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:03:38,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:03:38,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:03:38,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:03:38,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,637 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:03:38,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:03:38,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:03:38,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:03:38,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (1/1) ... [2022-11-18 20:03:38,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:03:38,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:38,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:03:38,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:03:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-18 20:03:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-18 20:03:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 20:03:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-11-18 20:03:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 20:03:38,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 20:03:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-18 20:03:38,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-18 20:03:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:03:38,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:03:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-18 20:03:38,749 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-18 20:03:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-18 20:03:38,749 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-18 20:03:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-18 20:03:38,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-18 20:03:38,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-18 20:03:38,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-18 20:03:38,750 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-18 20:03:38,750 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-18 20:03:38,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-18 20:03:38,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-18 20:03:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:03:38,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:03:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:03:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:03:38,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-18 20:03:38,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-18 20:03:38,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:03:38,752 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-18 20:03:38,753 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-18 20:03:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-18 20:03:38,753 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-18 20:03:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-18 20:03:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-18 20:03:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:03:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-18 20:03:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-18 20:03:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:03:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 20:03:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:03:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-11-18 20:03:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-18 20:03:38,756 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-18 20:03:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:03:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-18 20:03:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-18 20:03:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-18 20:03:38,757 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-18 20:03:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:03:38,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:03:39,194 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:03:39,197 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:03:39,349 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 20:03:46,447 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:03:46,467 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:03:46,469 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:03:46,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:46 BoogieIcfgContainer [2022-11-18 20:03:46,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:03:46,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:03:46,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:03:46,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:03:46,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:03:37" (1/3) ... [2022-11-18 20:03:46,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392c356a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:03:46, skipping insertion in model container [2022-11-18 20:03:46,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:38" (2/3) ... [2022-11-18 20:03:46,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392c356a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:03:46, skipping insertion in model container [2022-11-18 20:03:46,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:46" (3/3) ... [2022-11-18 20:03:46,485 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-18 20:03:46,511 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:03:46,512 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:03:46,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:03:46,583 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;@3fdc63b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:03:46,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:03:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 179 states have internal predecessors, (218), 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-18 20:03:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:03:46,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:46,600 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-18 20:03:46,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash -844282775, now seen corresponding path program 1 times [2022-11-18 20:03:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:46,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323491311] [2022-11-18 20:03:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:46,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:46,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:46,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 20:03:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:03:47,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:47,120 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-18 20:03:47,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:47,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:47,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323491311] [2022-11-18 20:03:47,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323491311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:47,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:47,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163745368] [2022-11-18 20:03:47,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:47,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:03:47,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:47,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:03:47,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:03:47,189 INFO L87 Difference]: Start difference. First operand has 227 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 179 states have internal predecessors, (218), 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 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 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-18 20:03:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:47,293 INFO L93 Difference]: Finished difference Result 449 states and 605 transitions. [2022-11-18 20:03:47,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:03:47,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 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-18 20:03:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:47,313 INFO L225 Difference]: With dead ends: 449 [2022-11-18 20:03:47,314 INFO L226 Difference]: Without dead ends: 216 [2022-11-18 20:03:47,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:03:47,331 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:47,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:03:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-18 20:03:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-18 20:03:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 162 states have (on average 1.271604938271605) internal successors, (206), 168 states have internal predecessors, (206), 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-18 20:03:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2022-11-18 20:03:47,392 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 32 [2022-11-18 20:03:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:47,393 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2022-11-18 20:03:47,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 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-18 20:03:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2022-11-18 20:03:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:03:47,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:47,395 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-18 20:03:47,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-18 20:03:47,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:47,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:47,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:47,608 INFO L85 PathProgramCache]: Analyzing trace with hash -421580949, now seen corresponding path program 1 times [2022-11-18 20:03:47,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:47,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351388658] [2022-11-18 20:03:47,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:47,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:47,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:47,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 20:03:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:03:47,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:48,035 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-18 20:03:48,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:48,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:48,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351388658] [2022-11-18 20:03:48,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351388658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:48,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:48,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:03:48,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237379853] [2022-11-18 20:03:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:48,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:48,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:48,040 INFO L87 Difference]: Start difference. First operand 216 states and 279 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:03:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:48,204 INFO L93 Difference]: Finished difference Result 612 states and 793 transitions. [2022-11-18 20:03:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:48,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-18 20:03:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:48,213 INFO L225 Difference]: With dead ends: 612 [2022-11-18 20:03:48,213 INFO L226 Difference]: Without dead ends: 401 [2022-11-18 20:03:48,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:48,217 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 244 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:48,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 575 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:03:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-11-18 20:03:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2022-11-18 20:03:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 301 states have (on average 1.2624584717607974) internal successors, (380), 309 states have internal predecessors, (380), 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-18 20:03:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 517 transitions. [2022-11-18 20:03:48,300 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 517 transitions. Word has length 32 [2022-11-18 20:03:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:48,300 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 517 transitions. [2022-11-18 20:03:48,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:03:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 517 transitions. [2022-11-18 20:03:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:03:48,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:48,303 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-18 20:03:48,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:48,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:48,518 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1120918184, now seen corresponding path program 1 times [2022-11-18 20:03:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:48,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974524154] [2022-11-18 20:03:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:48,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:48,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:48,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:48,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 20:03:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:48,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:03:48,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:48,981 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-18 20:03:48,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:48,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:48,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974524154] [2022-11-18 20:03:48,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974524154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:48,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:48,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:03:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155128730] [2022-11-18 20:03:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:48,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:03:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:03:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:03:49,000 INFO L87 Difference]: Start difference. First operand 401 states and 517 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:03:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:49,406 INFO L93 Difference]: Finished difference Result 936 states and 1236 transitions. [2022-11-18 20:03:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:03:49,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:03:49,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:49,411 INFO L225 Difference]: With dead ends: 936 [2022-11-18 20:03:49,412 INFO L226 Difference]: Without dead ends: 550 [2022-11-18 20:03:49,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:49,414 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 604 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:49,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1089 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:03:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-18 20:03:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 404. [2022-11-18 20:03:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 304 states have (on average 1.256578947368421) internal successors, (382), 312 states have internal predecessors, (382), 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-18 20:03:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 519 transitions. [2022-11-18 20:03:49,484 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 519 transitions. Word has length 55 [2022-11-18 20:03:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:49,485 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 519 transitions. [2022-11-18 20:03:49,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:03:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 519 transitions. [2022-11-18 20:03:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:03:49,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:49,496 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-18 20:03:49,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:49,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:49,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:49,717 INFO L85 PathProgramCache]: Analyzing trace with hash -440859814, now seen corresponding path program 1 times [2022-11-18 20:03:49,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:49,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418447147] [2022-11-18 20:03:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:49,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:49,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:49,724 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:49,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 20:03:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:50,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:03:50,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:50,499 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-18 20:03:50,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:50,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:50,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418447147] [2022-11-18 20:03:50,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418447147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:50,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:50,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:50,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439099802] [2022-11-18 20:03:50,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:50,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:50,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:50,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:50,503 INFO L87 Difference]: Start difference. First operand 404 states and 519 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:03:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:50,667 INFO L93 Difference]: Finished difference Result 1181 states and 1528 transitions. [2022-11-18 20:03:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:50,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:03:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:50,678 INFO L225 Difference]: With dead ends: 1181 [2022-11-18 20:03:50,678 INFO L226 Difference]: Without dead ends: 792 [2022-11-18 20:03:50,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:50,682 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 237 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:50,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 575 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:03:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-11-18 20:03:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 782. [2022-11-18 20:03:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 593 states have (on average 1.2529510961214165) internal successors, (743), 605 states have internal predecessors, (743), 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-18 20:03:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1008 transitions. [2022-11-18 20:03:50,790 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1008 transitions. Word has length 55 [2022-11-18 20:03:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:50,792 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1008 transitions. [2022-11-18 20:03:50,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:03:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1008 transitions. [2022-11-18 20:03:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 20:03:50,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:50,796 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-18 20:03:50,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:51,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:51,015 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash -781748368, now seen corresponding path program 1 times [2022-11-18 20:03:51,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:51,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123123889] [2022-11-18 20:03:51,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:51,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:51,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:51,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:51,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 20:03:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:51,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:03:51,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:51,806 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-18 20:03:51,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:51,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:51,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123123889] [2022-11-18 20:03:51,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123123889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:51,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:51,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951933335] [2022-11-18 20:03:51,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:51,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:51,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:51,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:51,808 INFO L87 Difference]: Start difference. First operand 782 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 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-18 20:03:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:51,925 INFO L93 Difference]: Finished difference Result 784 states and 1009 transitions. [2022-11-18 20:03:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:51,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 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 56 [2022-11-18 20:03:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:51,930 INFO L225 Difference]: With dead ends: 784 [2022-11-18 20:03:51,930 INFO L226 Difference]: Without dead ends: 781 [2022-11-18 20:03:51,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:51,932 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 237 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:51,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 276 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:03:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-11-18 20:03:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2022-11-18 20:03:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 593 states have (on average 1.2512647554806071) internal successors, (742), 604 states have internal predecessors, (742), 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-18 20:03:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1006 transitions. [2022-11-18 20:03:52,063 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1006 transitions. Word has length 56 [2022-11-18 20:03:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:52,065 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1006 transitions. [2022-11-18 20:03:52,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 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-18 20:03:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1006 transitions. [2022-11-18 20:03:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 20:03:52,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:52,068 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-18 20:03:52,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:52,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:52,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1535613213, now seen corresponding path program 1 times [2022-11-18 20:03:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:52,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983998855] [2022-11-18 20:03:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:52,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:52,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:52,287 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:52,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 20:03:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:52,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:03:52,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:52,825 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-18 20:03:52,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:52,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:52,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983998855] [2022-11-18 20:03:52,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983998855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:52,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:52,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809320164] [2022-11-18 20:03:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:52,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:52,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:52,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:52,828 INFO L87 Difference]: Start difference. First operand 781 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 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-18 20:03:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:52,955 INFO L93 Difference]: Finished difference Result 783 states and 1007 transitions. [2022-11-18 20:03:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:52,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 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 57 [2022-11-18 20:03:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:52,960 INFO L225 Difference]: With dead ends: 783 [2022-11-18 20:03:52,960 INFO L226 Difference]: Without dead ends: 780 [2022-11-18 20:03:52,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:52,962 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 234 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:52,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:03:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-11-18 20:03:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2022-11-18 20:03:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 593 states have (on average 1.2495784148397977) internal successors, (741), 603 states have internal predecessors, (741), 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-18 20:03:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1004 transitions. [2022-11-18 20:03:53,075 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1004 transitions. Word has length 57 [2022-11-18 20:03:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:53,076 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1004 transitions. [2022-11-18 20:03:53,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 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-18 20:03:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1004 transitions. [2022-11-18 20:03:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:03:53,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:53,077 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-18 20:03:53,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:53,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:53,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash 359383059, now seen corresponding path program 1 times [2022-11-18 20:03:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:53,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880776552] [2022-11-18 20:03:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:53,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:53,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:53,296 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:53,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 20:03:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:53,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:03:53,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:53,857 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-18 20:03:53,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:53,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:53,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880776552] [2022-11-18 20:03:53,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880776552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:53,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:53,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397271213] [2022-11-18 20:03:53,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:53,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:53,859 INFO L87 Difference]: Start difference. First operand 780 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 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-18 20:03:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:53,961 INFO L93 Difference]: Finished difference Result 782 states and 1005 transitions. [2022-11-18 20:03:53,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:53,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 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 58 [2022-11-18 20:03:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:53,967 INFO L225 Difference]: With dead ends: 782 [2022-11-18 20:03:53,967 INFO L226 Difference]: Without dead ends: 779 [2022-11-18 20:03:53,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:53,969 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 231 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:53,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 272 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:03:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-11-18 20:03:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2022-11-18 20:03:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 593 states have (on average 1.2478920741989883) internal successors, (740), 602 states have internal predecessors, (740), 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-18 20:03:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1002 transitions. [2022-11-18 20:03:54,098 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1002 transitions. Word has length 58 [2022-11-18 20:03:54,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:54,099 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1002 transitions. [2022-11-18 20:03:54,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 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-18 20:03:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1002 transitions. [2022-11-18 20:03:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:03:54,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:54,101 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-18 20:03:54,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:54,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:54,316 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1744008480, now seen corresponding path program 1 times [2022-11-18 20:03:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:54,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380004007] [2022-11-18 20:03:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:54,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:54,319 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:54,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-18 20:03:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:54,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:03:54,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:54,811 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-18 20:03:54,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:54,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:54,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380004007] [2022-11-18 20:03:54,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380004007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:54,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:54,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342390949] [2022-11-18 20:03:54,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:54,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:54,813 INFO L87 Difference]: Start difference. First operand 779 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (5), 2 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-18 20:03:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:54,941 INFO L93 Difference]: Finished difference Result 781 states and 1003 transitions. [2022-11-18 20:03:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:54,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (5), 2 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 59 [2022-11-18 20:03:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:54,945 INFO L225 Difference]: With dead ends: 781 [2022-11-18 20:03:54,945 INFO L226 Difference]: Without dead ends: 769 [2022-11-18 20:03:54,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:54,947 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 228 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:54,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:03:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-11-18 20:03:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2022-11-18 20:03:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 584 states have (on average 1.2465753424657535) internal successors, (728), 592 states have internal predecessors, (728), 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-18 20:03:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 989 transitions. [2022-11-18 20:03:55,090 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 989 transitions. Word has length 59 [2022-11-18 20:03:55,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:55,091 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 989 transitions. [2022-11-18 20:03:55,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (5), 2 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-18 20:03:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 989 transitions. [2022-11-18 20:03:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-18 20:03:55,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:55,095 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] [2022-11-18 20:03:55,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:55,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:55,310 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:55,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:55,311 INFO L85 PathProgramCache]: Analyzing trace with hash 534361474, now seen corresponding path program 1 times [2022-11-18 20:03:55,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:55,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584596809] [2022-11-18 20:03:55,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:55,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:55,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:55,313 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:55,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-18 20:03:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:55,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:03:55,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-18 20:03:55,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:55,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:55,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584596809] [2022-11-18 20:03:55,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584596809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:55,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:55,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:03:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611764484] [2022-11-18 20:03:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:55,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:55,879 INFO L87 Difference]: Start difference. First operand 769 states and 989 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 20:03:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:56,128 INFO L93 Difference]: Finished difference Result 1587 states and 2049 transitions. [2022-11-18 20:03:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:56,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 159 [2022-11-18 20:03:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:56,133 INFO L225 Difference]: With dead ends: 1587 [2022-11-18 20:03:56,133 INFO L226 Difference]: Without dead ends: 833 [2022-11-18 20:03:56,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:56,137 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 41 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:56,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 521 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:03:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2022-11-18 20:03:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 823. [2022-11-18 20:03:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 637 states have (on average 1.2590266875981162) internal successors, (802), 645 states have internal predecessors, (802), 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-18 20:03:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1063 transitions. [2022-11-18 20:03:56,254 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1063 transitions. Word has length 159 [2022-11-18 20:03:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:56,254 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1063 transitions. [2022-11-18 20:03:56,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 20:03:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1063 transitions. [2022-11-18 20:03:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-18 20:03:56,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:56,263 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] [2022-11-18 20:03:56,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:56,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:56,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash 71836451, now seen corresponding path program 1 times [2022-11-18 20:03:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:56,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979154542] [2022-11-18 20:03:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:56,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:56,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:56,485 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:56,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-18 20:03:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:57,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:03:57,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:57,121 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-18 20:03:57,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:57,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:57,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979154542] [2022-11-18 20:03:57,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979154542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:57,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:57,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:03:57,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846369944] [2022-11-18 20:03:57,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:57,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:03:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:03:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:03:57,124 INFO L87 Difference]: Start difference. First operand 823 states and 1063 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 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-18 20:03:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:57,308 INFO L93 Difference]: Finished difference Result 1643 states and 2135 transitions. [2022-11-18 20:03:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:03:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 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 168 [2022-11-18 20:03:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:57,313 INFO L225 Difference]: With dead ends: 1643 [2022-11-18 20:03:57,314 INFO L226 Difference]: Without dead ends: 831 [2022-11-18 20:03:57,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:03:57,316 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1054 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-18 20:03:57,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1054 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:03:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-18 20:03:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2022-11-18 20:03:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 641 states have (on average 1.2574102964118565) internal successors, (806), 653 states have internal predecessors, (806), 130 states have call successors, (130), 56 states have call predecessors, (130), 59 states have return successors, (143), 129 states have call predecessors, (143), 129 states have call successors, (143) [2022-11-18 20:03:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1079 transitions. [2022-11-18 20:03:57,460 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1079 transitions. Word has length 168 [2022-11-18 20:03:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:57,460 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1079 transitions. [2022-11-18 20:03:57,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 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-18 20:03:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1079 transitions. [2022-11-18 20:03:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-18 20:03:57,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:57,464 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] [2022-11-18 20:03:57,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:57,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:57,687 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1802056919, now seen corresponding path program 1 times [2022-11-18 20:03:57,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:57,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100519523] [2022-11-18 20:03:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:57,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:57,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:57,691 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:57,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-18 20:03:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:58,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:03:58,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-18 20:03:58,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:58,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100519523] [2022-11-18 20:03:58,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100519523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:58,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:58,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:03:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267948084] [2022-11-18 20:03:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:58,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:03:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:03:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:03:58,282 INFO L87 Difference]: Start difference. First operand 831 states and 1079 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:03:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:58,633 INFO L93 Difference]: Finished difference Result 2217 states and 2962 transitions. [2022-11-18 20:03:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:03:58,634 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 174 [2022-11-18 20:03:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:58,640 INFO L225 Difference]: With dead ends: 2217 [2022-11-18 20:03:58,640 INFO L226 Difference]: Without dead ends: 1405 [2022-11-18 20:03:58,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:58,643 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 333 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:58,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1308 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:03:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2022-11-18 20:03:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 843. [2022-11-18 20:03:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 653 states have (on average 1.2526799387442573) internal successors, (818), 665 states have internal predecessors, (818), 130 states have call successors, (130), 56 states have call predecessors, (130), 59 states have return successors, (143), 129 states have call predecessors, (143), 129 states have call successors, (143) [2022-11-18 20:03:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1091 transitions. [2022-11-18 20:03:58,798 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1091 transitions. Word has length 174 [2022-11-18 20:03:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:58,798 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1091 transitions. [2022-11-18 20:03:58,799 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:03:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1091 transitions. [2022-11-18 20:03:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-18 20:03:58,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:58,802 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] [2022-11-18 20:03:58,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:59,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:59,025 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:03:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash -419348752, now seen corresponding path program 1 times [2022-11-18 20:03:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:03:59,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348314313] [2022-11-18 20:03:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:59,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:03:59,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:03:59,028 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:03:59,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-18 20:03:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:59,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:03:59,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-18 20:03:59,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:03:59,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:03:59,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348314313] [2022-11-18 20:03:59,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348314313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:59,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:59,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:03:59,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827012335] [2022-11-18 20:03:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:59,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:03:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:03:59,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:03:59,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:03:59,910 INFO L87 Difference]: Start difference. First operand 843 states and 1091 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 8 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 20:04:01,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:04:03,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:04:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:03,324 INFO L93 Difference]: Finished difference Result 2211 states and 2945 transitions. [2022-11-18 20:04:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:04:03,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 8 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) Word has length 176 [2022-11-18 20:04:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:03,333 INFO L225 Difference]: With dead ends: 2211 [2022-11-18 20:04:03,333 INFO L226 Difference]: Without dead ends: 1387 [2022-11-18 20:04:03,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:04:03,336 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 203 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:03,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 3263 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-18 20:04:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-11-18 20:04:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 875. [2022-11-18 20:04:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 681 states have (on average 1.2422907488986785) internal successors, (846), 689 states have internal predecessors, (846), 130 states have call successors, (130), 56 states have call predecessors, (130), 63 states have return successors, (151), 137 states have call predecessors, (151), 129 states have call successors, (151) [2022-11-18 20:04:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1127 transitions. [2022-11-18 20:04:03,482 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1127 transitions. Word has length 176 [2022-11-18 20:04:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:03,483 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1127 transitions. [2022-11-18 20:04:03,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 8 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 20:04:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1127 transitions. [2022-11-18 20:04:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-11-18 20:04:03,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:03,488 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:04:03,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:03,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:03,703 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:04:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash 403002934, now seen corresponding path program 2 times [2022-11-18 20:04:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:04:03,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753852594] [2022-11-18 20:04:03,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:04:03,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:03,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:04:03,706 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:04:03,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-18 20:04:04,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:04:04,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:04:04,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 20:04:04,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-18 20:04:04,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:04:04,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:04:04,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753852594] [2022-11-18 20:04:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753852594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:04:04,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:04:04,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:04:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740221190] [2022-11-18 20:04:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:04:04,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:04:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:04:04,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:04:04,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:04:04,264 INFO L87 Difference]: Start difference. First operand 875 states and 1127 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:04:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:05,623 INFO L93 Difference]: Finished difference Result 1917 states and 2506 transitions. [2022-11-18 20:04:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:04:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 182 [2022-11-18 20:04:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:05,630 INFO L225 Difference]: With dead ends: 1917 [2022-11-18 20:04:05,630 INFO L226 Difference]: Without dead ends: 1061 [2022-11-18 20:04:05,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:04:05,633 INFO L413 NwaCegarLoop]: 496 mSDtfsCounter, 682 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:05,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 2052 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-18 20:04:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-11-18 20:04:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 875. [2022-11-18 20:04:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 681 states have (on average 1.2393538913362703) internal successors, (844), 689 states have internal predecessors, (844), 130 states have call successors, (130), 56 states have call predecessors, (130), 63 states have return successors, (151), 137 states have call predecessors, (151), 129 states have call successors, (151) [2022-11-18 20:04:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1125 transitions. [2022-11-18 20:04:05,811 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1125 transitions. Word has length 182 [2022-11-18 20:04:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:05,813 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1125 transitions. [2022-11-18 20:04:05,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:04:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1125 transitions. [2022-11-18 20:04:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-11-18 20:04:05,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:05,825 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:04:05,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:06,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:06,042 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:04:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash 741573795, now seen corresponding path program 1 times [2022-11-18 20:04:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:04:06,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775286916] [2022-11-18 20:04:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:06,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:06,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:04:06,045 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:04:06,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-18 20:04:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:07,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:04:07,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-18 20:04:07,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-18 20:04:08,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:04:08,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775286916] [2022-11-18 20:04:08,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775286916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:04:08,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:04:08,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-18 20:04:08,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995611960] [2022-11-18 20:04:08,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:04:08,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:04:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:04:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:04:08,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:04:08,365 INFO L87 Difference]: Start difference. First operand 875 states and 1125 transitions. Second operand has 16 states, 16 states have (on average 9.1875) internal successors, (147), 12 states have internal predecessors, (147), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-18 20:04:10,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:04:13,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:04:13,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:13,560 INFO L93 Difference]: Finished difference Result 1957 states and 2552 transitions. [2022-11-18 20:04:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:04:13,561 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 12 states have internal predecessors, (147), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) Word has length 197 [2022-11-18 20:04:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:13,569 INFO L225 Difference]: With dead ends: 1957 [2022-11-18 20:04:13,569 INFO L226 Difference]: Without dead ends: 1101 [2022-11-18 20:04:13,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:04:13,572 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 64 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:13,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 3701 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-11-18 20:04:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2022-11-18 20:04:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 883. [2022-11-18 20:04:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 685 states have (on average 1.237956204379562) internal successors, (848), 693 states have internal predecessors, (848), 134 states have call successors, (134), 56 states have call predecessors, (134), 63 states have return successors, (159), 141 states have call predecessors, (159), 133 states have call successors, (159) [2022-11-18 20:04:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1141 transitions. [2022-11-18 20:04:13,752 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1141 transitions. Word has length 197 [2022-11-18 20:04:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:13,753 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1141 transitions. [2022-11-18 20:04:13,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 12 states have internal predecessors, (147), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-18 20:04:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1141 transitions. [2022-11-18 20:04:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-11-18 20:04:13,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:13,758 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] [2022-11-18 20:04:13,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:13,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:13,979 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:04:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash 828966121, now seen corresponding path program 2 times [2022-11-18 20:04:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:04:13,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331704542] [2022-11-18 20:04:13,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:04:13,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:13,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:04:13,983 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:04:13,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-18 20:04:15,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:04:15,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:04:16,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:04:16,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-18 20:04:16,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-18 20:04:16,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:04:16,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331704542] [2022-11-18 20:04:16,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331704542] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:04:16,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:04:16,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-18 20:04:16,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047789742] [2022-11-18 20:04:16,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:04:16,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:04:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:04:16,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:04:16,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:04:16,954 INFO L87 Difference]: Start difference. First operand 883 states and 1141 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 4 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 20:04:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:19,248 INFO L93 Difference]: Finished difference Result 5196 states and 6743 transitions. [2022-11-18 20:04:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:04:19,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 4 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 203 [2022-11-18 20:04:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:19,269 INFO L225 Difference]: With dead ends: 5196 [2022-11-18 20:04:19,269 INFO L226 Difference]: Without dead ends: 5188 [2022-11-18 20:04:19,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:04:19,272 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 1139 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:19,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 1670 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-18 20:04:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5188 states. [2022-11-18 20:04:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5188 to 5155. [2022-11-18 20:04:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 4007 states have (on average 1.242575492887447) internal successors, (4979), 4063 states have internal predecessors, (4979), 784 states have call successors, (784), 316 states have call predecessors, (784), 363 states have return successors, (939), 823 states have call predecessors, (939), 783 states have call successors, (939) [2022-11-18 20:04:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6702 transitions. [2022-11-18 20:04:20,130 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6702 transitions. Word has length 203 [2022-11-18 20:04:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:20,130 INFO L495 AbstractCegarLoop]: Abstraction has 5155 states and 6702 transitions. [2022-11-18 20:04:20,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 4 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 20:04:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6702 transitions. [2022-11-18 20:04:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-11-18 20:04:20,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:20,142 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] [2022-11-18 20:04:20,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:20,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:20,355 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:04:20,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash -182151129, now seen corresponding path program 1 times [2022-11-18 20:04:20,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:04:20,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381736861] [2022-11-18 20:04:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:20,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:20,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:04:20,357 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:04:20,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-18 20:04:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:21,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:04:21,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-18 20:04:21,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:04:21,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:04:21,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381736861] [2022-11-18 20:04:21,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381736861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:04:21,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:04:21,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:04:21,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306001031] [2022-11-18 20:04:21,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:04:21,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:04:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:04:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:04:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:04:21,495 INFO L87 Difference]: Start difference. First operand 5155 states and 6702 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:04:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:22,885 INFO L93 Difference]: Finished difference Result 12545 states and 16683 transitions. [2022-11-18 20:04:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:04:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 203 [2022-11-18 20:04:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:22,916 INFO L225 Difference]: With dead ends: 12545 [2022-11-18 20:04:22,916 INFO L226 Difference]: Without dead ends: 7409 [2022-11-18 20:04:22,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:04:22,928 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 93 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:22,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1791 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:04:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7409 states. [2022-11-18 20:04:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7409 to 5227. [2022-11-18 20:04:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 4079 states have (on average 1.2382936994361362) internal successors, (5051), 4111 states have internal predecessors, (5051), 784 states have call successors, (784), 316 states have call predecessors, (784), 363 states have return successors, (939), 847 states have call predecessors, (939), 783 states have call successors, (939) [2022-11-18 20:04:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 6774 transitions. [2022-11-18 20:04:24,420 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 6774 transitions. Word has length 203 [2022-11-18 20:04:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:24,421 INFO L495 AbstractCegarLoop]: Abstraction has 5227 states and 6774 transitions. [2022-11-18 20:04:24,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:04:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 6774 transitions. [2022-11-18 20:04:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-18 20:04:24,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:24,433 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] [2022-11-18 20:04:24,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:24,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:24,647 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:04:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash 485150061, now seen corresponding path program 2 times [2022-11-18 20:04:24,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:04:24,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887342615] [2022-11-18 20:04:24,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:04:24,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:24,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:04:24,650 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:04:24,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-18 20:04:25,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:04:25,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:04:25,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:04:25,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-11-18 20:04:25,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:04:25,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:04:25,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887342615] [2022-11-18 20:04:25,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887342615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:04:25,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:04:25,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:04:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340167336] [2022-11-18 20:04:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:04:25,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:04:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:04:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:04:25,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:04:25,407 INFO L87 Difference]: Start difference. First operand 5227 states and 6774 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-18 20:04:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:27,119 INFO L93 Difference]: Finished difference Result 16673 states and 21758 transitions. [2022-11-18 20:04:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:04:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 209 [2022-11-18 20:04:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:27,166 INFO L225 Difference]: With dead ends: 16673 [2022-11-18 20:04:27,166 INFO L226 Difference]: Without dead ends: 11465 [2022-11-18 20:04:27,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:04:27,179 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 324 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:27,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 916 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:04:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11465 states. [2022-11-18 20:04:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11465 to 5251. [2022-11-18 20:04:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5251 states, 4103 states have (on average 1.236899829393127) internal successors, (5075), 4143 states have internal predecessors, (5075), 784 states have call successors, (784), 316 states have call predecessors, (784), 363 states have return successors, (939), 839 states have call predecessors, (939), 783 states have call successors, (939) [2022-11-18 20:04:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5251 states to 5251 states and 6798 transitions. [2022-11-18 20:04:28,555 INFO L78 Accepts]: Start accepts. Automaton has 5251 states and 6798 transitions. Word has length 209 [2022-11-18 20:04:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:28,556 INFO L495 AbstractCegarLoop]: Abstraction has 5251 states and 6798 transitions. [2022-11-18 20:04:28,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-18 20:04:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5251 states and 6798 transitions. [2022-11-18 20:04:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-11-18 20:04:28,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:28,566 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] [2022-11-18 20:04:28,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:28,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:28,789 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:04:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash -826439509, now seen corresponding path program 1 times [2022-11-18 20:04:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:04:28,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373943868] [2022-11-18 20:04:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:28,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:28,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:04:28,792 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:04:28,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-18 20:04:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:29,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 20:04:29,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-18 20:04:29,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:04:29,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:04:29,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373943868] [2022-11-18 20:04:29,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373943868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:04:29,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:04:29,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:04:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146221625] [2022-11-18 20:04:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:04:29,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:04:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:04:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:04:29,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:04:29,963 INFO L87 Difference]: Start difference. First operand 5251 states and 6798 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:04:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:31,310 INFO L93 Difference]: Finished difference Result 14057 states and 18807 transitions. [2022-11-18 20:04:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:04:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 216 [2022-11-18 20:04:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:31,336 INFO L225 Difference]: With dead ends: 14057 [2022-11-18 20:04:31,337 INFO L226 Difference]: Without dead ends: 8825 [2022-11-18 20:04:31,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:04:31,349 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 141 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:31,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1469 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:04:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2022-11-18 20:04:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 5371. [2022-11-18 20:04:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5371 states, 4199 states have (on average 1.2371993331745654) internal successors, (5195), 4215 states have internal predecessors, (5195), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (963), 887 states have call predecessors, (963), 807 states have call successors, (963) [2022-11-18 20:04:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5371 states to 5371 states and 6966 transitions. [2022-11-18 20:04:32,258 INFO L78 Accepts]: Start accepts. Automaton has 5371 states and 6966 transitions. Word has length 216 [2022-11-18 20:04:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:32,259 INFO L495 AbstractCegarLoop]: Abstraction has 5371 states and 6966 transitions. [2022-11-18 20:04:32,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 20:04:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 5371 states and 6966 transitions. [2022-11-18 20:04:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-11-18 20:04:32,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:32,268 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] [2022-11-18 20:04:32,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:32,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:32,491 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:04:32,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:32,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2070127077, now seen corresponding path program 1 times [2022-11-18 20:04:32,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:04:32,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690229717] [2022-11-18 20:04:32,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:32,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:04:32,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:04:32,493 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:04:32,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-18 20:04:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:36,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-18 20:04:36,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:36,178 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 7 [2022-11-18 20:04:36,243 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-18 20:04:36,876 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 11 [2022-11-18 20:04:36,921 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2175 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2175))) is different from true [2022-11-18 20:04:36,948 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc61.base| (_ BitVec 64))) (and (exists ((v_ArrVal_2175 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc61.base| v_ArrVal_2175))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc61.base|)) (exists ((v_ArrVal_2174 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc61.base| v_ArrVal_2174) |c_#valid|)))) is different from true [2022-11-18 20:04:36,974 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 11 [2022-11-18 20:04:36,978 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-18 20:04:37,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:37,040 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-18 20:04:37,081 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:04:37,082 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 27 [2022-11-18 20:04:37,265 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 7 treesize of output 5 [2022-11-18 20:04:43,482 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 7 [2022-11-18 20:04:51,892 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 20:04:51,893 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 14 treesize of output 20 [2022-11-18 20:04:52,914 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 7 treesize of output 5 [2022-11-18 20:04:57,149 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 11 [2022-11-18 20:04:59,155 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:05:10,044 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:05:10,045 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 27 [2022-11-18 20:05:10,404 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 7 treesize of output 5 [2022-11-18 20:05:25,461 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:05:25,461 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 13 treesize of output 13 [2022-11-18 20:05:28,069 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:05:28,352 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-18 20:05:30,390 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:05:32,667 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8| (_ BitVec 64))) (= ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8|))) is different from true [2022-11-18 20:05:32,972 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-18 20:05:33,002 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-18 20:05:35,200 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_9| (_ BitVec 64))) (= ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_9|))) is different from true [2022-11-18 20:05:35,423 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-18 20:05:35,438 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-18 20:05:35,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:35,480 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 144 treesize of output 110 [2022-11-18 20:05:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 28 proven. 18 refuted. 9 times theorem prover too weak. 17 trivial. 101 not checked. [2022-11-18 20:05:35,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:05:35,656 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2188 (Array (_ BitVec 64) (_ BitVec 8))) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ BitVec 64))) (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2188) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|))) (concat (concat (concat (concat (concat (concat (concat (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv23 64))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv22 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv21 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv20 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv19 64)))) (select .cse0 (bvadd (_ bv18 64) |ULTIMATE.start_usb_acecad_probe_~id#1.offset|))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv17 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv16 64))))))) is different from false [2022-11-18 20:05:35,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:05:35,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690229717] [2022-11-18 20:05:35,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690229717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:05:35,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1259560763] [2022-11-18 20:05:35,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:35,777 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:05:35,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:05:35,783 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:05:35,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfe1a1a9-5ea6-4dd9-b52a-22d5e91c7051/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-11-18 20:13:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:56,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-18 20:13:56,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:56,681 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 7 [2022-11-18 20:13:58,900 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-18 20:14:00,830 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2531 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2531))) is different from true [2022-11-18 20:14:00,853 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc61.base| (_ BitVec 64))) (and (exists ((v_ArrVal_2531 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc61.base| v_ArrVal_2531))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc61.base|)))) is different from true [2022-11-18 20:14:00,873 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-18 20:14:00,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:00,930 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-18 20:14:00,950 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:14:00,951 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 13 treesize of output 13 [2022-11-18 20:14:03,483 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_10| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_10|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:14:05,953 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_11| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_11|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:14:08,255 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_12| (_ BitVec 64))) (= ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_12|))) is different from true [2022-11-18 20:14:10,559 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_13| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_13|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:14:10,597 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 7 [2022-11-18 20:14:45,943 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:14:45,944 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 13 treesize of output 13 [2022-11-18 20:14:49,118 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_15| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_15|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:14:49,734 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-11-18 20:14:49,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 32 [2022-11-18 20:14:49,759 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-18 20:14:52,402 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) (or (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_16| (_ BitVec 64))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_16|))) (exists ((v_ArrVal_2533 (_ BitVec 8)) (|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_16| (_ BitVec 64))) (= (store .cse0 (_ bv216 64) v_ArrVal_2533) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_16|))))) is different from true [2022-11-18 20:14:55,168 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) (or (exists ((v_ArrVal_2533 (_ BitVec 8)) (|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_17| (_ BitVec 64))) (= (store .cse0 (_ bv216 64) v_ArrVal_2533) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_17|))) (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_17| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_17|) .cse0)))) is different from true [2022-11-18 20:14:56,183 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-11-18 20:14:56,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 50 [2022-11-18 20:14:56,293 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-18 20:14:57,395 INFO L321 Elim1Store]: treesize reduction 16, result has 52.9 percent of original size [2022-11-18 20:14:57,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 48 [2022-11-18 20:14:57,515 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 11 treesize of output 15 [2022-11-18 20:15:00,507 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) (or (exists ((v_ArrVal_2539 (_ BitVec 8)) (v_ArrVal_2533 (_ BitVec 8)) (|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_18| (_ BitVec 64)) (v_ArrVal_2535 (_ BitVec 8)) (v_ArrVal_2540 (_ BitVec 8))) (= (store (store (store (store .cse0 (_ bv216 64) v_ArrVal_2533) (_ bv208 64) v_ArrVal_2535) (_ bv192 64) v_ArrVal_2540) (_ bv200 64) v_ArrVal_2539) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_18|))) (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_18| (_ BitVec 64))) (= .cse0 (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_18|))))) is different from true [2022-11-18 20:15:03,359 INFO L321 Elim1Store]: treesize reduction 58, result has 23.7 percent of original size [2022-11-18 20:15:03,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 87 treesize of output 97 [2022-11-18 20:15:03,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:03,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:03,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:03,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:03,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:03,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:03,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:03,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:03,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:03,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 89 [2022-11-18 20:15:05,434 INFO L321 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-11-18 20:15:05,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 96 treesize of output 106 [2022-11-18 20:15:05,641 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-18 20:15:07,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:07,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 173 treesize of output 145 [2022-11-18 20:15:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 124 not checked. [2022-11-18 20:15:07,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:15:37,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1259560763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:37,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:15:37,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 52] total 91 [2022-11-18 20:15:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792363730] [2022-11-18 20:15:37,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:15:37,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-11-18 20:15:37,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:15:37,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-11-18 20:15:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=5537, Unknown=40, NotChecked=3006, Total=8930 [2022-11-18 20:15:37,662 INFO L87 Difference]: Start difference. First operand 5371 states and 6966 transitions. Second operand has 91 states, 85 states have (on average 3.376470588235294) internal successors, (287), 75 states have internal predecessors, (287), 33 states have call successors, (44), 21 states have call predecessors, (44), 32 states have return successors, (46), 37 states have call predecessors, (46), 33 states have call successors, (46)