./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 --- 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-5e519f3 [2022-11-03 01:57:30,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:57:30,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:57:30,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:57:30,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:57:30,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:57:30,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:57:30,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:57:30,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:57:30,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:57:30,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:57:30,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:57:30,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:57:30,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:57:30,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:57:30,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:57:30,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:57:30,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:57:30,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:57:30,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:57:30,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:57:30,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:57:30,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:57:30,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:57:30,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:57:30,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:57:30,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:57:30,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:57:30,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:57:30,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:57:30,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:57:30,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:57:30,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:57:30,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:57:30,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:57:30,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:57:30,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:57:30,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:57:30,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:57:30,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:57:30,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:57:30,749 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-03 01:57:30,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:57:30,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:57:30,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:57:30,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:57:30,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:57:30,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:57:30,775 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:57:30,775 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:57:30,776 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:57:30,776 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:57:30,776 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:57:30,777 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:57:30,777 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:57:30,777 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:57:30,777 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:57:30,778 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:57:30,778 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:57:30,778 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:57:30,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:57:30,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:57:30,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:57:30,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:57:30,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:57:30,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:57:30,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:57:30,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:57:30,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:57:30,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:57:30,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:57:30,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:57:30,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:57:30,783 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:57:30,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:57:30,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:57:30,783 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:57:30,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:57:30,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:57:30,784 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:57:30,784 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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 [2022-11-03 01:57:31,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:57:31,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:57:31,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:57:31,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:57:31,130 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:57:31,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2022-11-03 01:57:31,214 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data/432826510/f3b3800781aa4018b313088571292e9c/FLAG05024d7f7 [2022-11-03 01:57:32,149 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:57:32,149 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2022-11-03 01:57:32,201 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data/432826510/f3b3800781aa4018b313088571292e9c/FLAG05024d7f7 [2022-11-03 01:57:32,652 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data/432826510/f3b3800781aa4018b313088571292e9c [2022-11-03 01:57:32,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:57:32,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:57:32,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:57:32,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:57:32,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:57:32,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:57:32" (1/1) ... [2022-11-03 01:57:32,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd31798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:32, skipping insertion in model container [2022-11-03 01:57:32,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:57:32" (1/1) ... [2022-11-03 01:57:32,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:57:32,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:57:33,661 WARN L230 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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2022-11-03 01:57:34,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:57:34,183 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:57:34,333 WARN L230 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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2022-11-03 01:57:34,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:57:34,550 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:57:34,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34 WrapperNode [2022-11-03 01:57:34,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:57:34,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:57:34,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:57:34,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:57:34,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,756 INFO L138 Inliner]: procedures = 114, calls = 1187, calls flagged for inlining = 51, calls inlined = 48, statements flattened = 2158 [2022-11-03 01:57:34,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:57:34,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:57:34,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:57:34,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:57:34,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,937 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:57:34,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:57:34,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:57:34,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:57:34,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (1/1) ... [2022-11-03 01:57:34,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:57:34,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:34,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:57:35,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:57:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-03 01:57:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2022-11-03 01:57:35,061 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2022-11-03 01:57:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-03 01:57:35,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-03 01:57:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:57:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-03 01:57:35,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-03 01:57:35,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-03 01:57:35,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-03 01:57:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-03 01:57:35,063 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-03 01:57:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-03 01:57:35,063 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-03 01:57:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:57:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-03 01:57:35,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-03 01:57:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-03 01:57:35,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-03 01:57:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 01:57:35,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 01:57:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:57:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-11-03 01:57:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-11-03 01:57:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure gtco_disconnect [2022-11-03 01:57:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure gtco_disconnect [2022-11-03 01:57:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2022-11-03 01:57:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2022-11-03 01:57:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:57:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-03 01:57:35,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-03 01:57:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:57:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:57:35,066 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-03 01:57:35,066 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-03 01:57:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-03 01:57:35,067 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-03 01:57:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:57:35,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:57:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2022-11-03 01:57:35,068 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2022-11-03 01:57:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 01:57:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-03 01:57:35,068 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-03 01:57:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-11-03 01:57:35,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-11-03 01:57:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:57:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-03 01:57:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-03 01:57:35,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:57:35,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:57:35,597 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:57:35,599 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:57:35,720 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-03 01:57:35,802 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-11-03 01:57:38,174 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:57:38,644 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:57:38,645 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 01:57:38,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:57:38 BoogieIcfgContainer [2022-11-03 01:57:38,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:57:38,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:57:38,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:57:38,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:57:38,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:57:32" (1/3) ... [2022-11-03 01:57:38,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5544322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:57:38, skipping insertion in model container [2022-11-03 01:57:38,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:57:34" (2/3) ... [2022-11-03 01:57:38,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5544322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:57:38, skipping insertion in model container [2022-11-03 01:57:38,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:57:38" (3/3) ... [2022-11-03 01:57:38,667 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2022-11-03 01:57:38,688 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:57:38,689 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:57:38,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:57:38,795 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@809c5cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:57:38,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:57:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 315 states, 208 states have (on average 1.4182692307692308) internal successors, (295), 219 states have internal predecessors, (295), 88 states have call successors, (88), 19 states have call predecessors, (88), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-03 01:57:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:57:38,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:38,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:38,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:38,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:38,822 INFO L85 PathProgramCache]: Analyzing trace with hash -329688328, now seen corresponding path program 1 times [2022-11-03 01:57:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:38,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820309603] [2022-11-03 01:57:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:39,464 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-03 01:57:39,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:39,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820309603] [2022-11-03 01:57:39,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820309603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:39,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:39,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:57:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364050074] [2022-11-03 01:57:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:39,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:57:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:57:39,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:39,518 INFO L87 Difference]: Start difference. First operand has 315 states, 208 states have (on average 1.4182692307692308) internal successors, (295), 219 states have internal predecessors, (295), 88 states have call successors, (88), 19 states have call predecessors, (88), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:57:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:41,176 INFO L93 Difference]: Finished difference Result 919 states and 1404 transitions. [2022-11-03 01:57:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:57:41,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-03 01:57:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:41,197 INFO L225 Difference]: With dead ends: 919 [2022-11-03 01:57:41,197 INFO L226 Difference]: Without dead ends: 593 [2022-11-03 01:57:41,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:41,207 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 426 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:41,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 837 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 01:57:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-11-03 01:57:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2022-11-03 01:57:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 399 states have (on average 1.3759398496240602) internal successors, (549), 405 states have internal predecessors, (549), 161 states have call successors, (161), 33 states have call predecessors, (161), 32 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2022-11-03 01:57:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 866 transitions. [2022-11-03 01:57:41,372 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 866 transitions. Word has length 17 [2022-11-03 01:57:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:41,373 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 866 transitions. [2022-11-03 01:57:41,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:57:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 866 transitions. [2022-11-03 01:57:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:57:41,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:41,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:41,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:57:41,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1765954213, now seen corresponding path program 1 times [2022-11-03 01:57:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:41,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72547434] [2022-11-03 01:57:41,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:57:41,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:41,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72547434] [2022-11-03 01:57:41,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72547434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:41,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:41,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:57:41,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977739151] [2022-11-03 01:57:41,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:41,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:57:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:41,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:57:41,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:41,981 INFO L87 Difference]: Start difference. First operand 593 states and 866 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:43,207 INFO L93 Difference]: Finished difference Result 773 states and 1094 transitions. [2022-11-03 01:57:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:57:43,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-03 01:57:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:43,215 INFO L225 Difference]: With dead ends: 773 [2022-11-03 01:57:43,215 INFO L226 Difference]: Without dead ends: 770 [2022-11-03 01:57:43,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:43,217 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 115 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:43,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 754 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-03 01:57:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-03 01:57:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 758. [2022-11-03 01:57:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 513 states have (on average 1.3567251461988303) internal successors, (696), 523 states have internal predecessors, (696), 193 states have call successors, (193), 52 states have call predecessors, (193), 51 states have return successors, (188), 186 states have call predecessors, (188), 188 states have call successors, (188) [2022-11-03 01:57:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1077 transitions. [2022-11-03 01:57:43,319 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1077 transitions. Word has length 25 [2022-11-03 01:57:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:43,319 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 1077 transitions. [2022-11-03 01:57:43,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1077 transitions. [2022-11-03 01:57:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 01:57:43,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:43,325 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:43,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:57:43,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1090207902, now seen corresponding path program 1 times [2022-11-03 01:57:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:43,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808861425] [2022-11-03 01:57:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:57:43,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:43,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808861425] [2022-11-03 01:57:43,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808861425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:43,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:43,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:57:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516128014] [2022-11-03 01:57:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:43,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:57:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:57:43,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:43,819 INFO L87 Difference]: Start difference. First operand 758 states and 1077 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:45,105 INFO L93 Difference]: Finished difference Result 1667 states and 2343 transitions. [2022-11-03 01:57:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:57:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-03 01:57:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:45,112 INFO L225 Difference]: With dead ends: 1667 [2022-11-03 01:57:45,113 INFO L226 Difference]: Without dead ends: 918 [2022-11-03 01:57:45,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:45,116 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 100 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:45,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 749 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-03 01:57:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-11-03 01:57:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 908. [2022-11-03 01:57:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 618 states have (on average 1.343042071197411) internal successors, (830), 632 states have internal predecessors, (830), 219 states have call successors, (219), 71 states have call predecessors, (219), 70 states have return successors, (214), 210 states have call predecessors, (214), 214 states have call successors, (214) [2022-11-03 01:57:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1263 transitions. [2022-11-03 01:57:45,179 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1263 transitions. Word has length 26 [2022-11-03 01:57:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:45,180 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1263 transitions. [2022-11-03 01:57:45,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1263 transitions. [2022-11-03 01:57:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 01:57:45,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:45,182 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:45,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:57:45,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:45,183 INFO L85 PathProgramCache]: Analyzing trace with hash 563084616, now seen corresponding path program 1 times [2022-11-03 01:57:45,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:45,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092244083] [2022-11-03 01:57:45,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:45,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:57:45,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:45,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092244083] [2022-11-03 01:57:45,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092244083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:45,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:45,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:57:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060000869] [2022-11-03 01:57:45,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:45,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:57:45,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:45,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:57:45,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:45,318 INFO L87 Difference]: Start difference. First operand 908 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:46,365 INFO L93 Difference]: Finished difference Result 916 states and 1270 transitions. [2022-11-03 01:57:46,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:57:46,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-11-03 01:57:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:46,372 INFO L225 Difference]: With dead ends: 916 [2022-11-03 01:57:46,372 INFO L226 Difference]: Without dead ends: 913 [2022-11-03 01:57:46,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:46,374 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 97 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:46,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 746 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:57:46,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2022-11-03 01:57:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 909. [2022-11-03 01:57:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 619 states have (on average 1.3424878836833603) internal successors, (831), 633 states have internal predecessors, (831), 219 states have call successors, (219), 71 states have call predecessors, (219), 70 states have return successors, (214), 210 states have call predecessors, (214), 214 states have call successors, (214) [2022-11-03 01:57:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1264 transitions. [2022-11-03 01:57:46,431 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1264 transitions. Word has length 27 [2022-11-03 01:57:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:46,431 INFO L495 AbstractCegarLoop]: Abstraction has 909 states and 1264 transitions. [2022-11-03 01:57:46,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1264 transitions. [2022-11-03 01:57:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:57:46,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:46,433 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:57:46,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:57:46,434 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash 275549989, now seen corresponding path program 1 times [2022-11-03 01:57:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:46,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103604559] [2022-11-03 01:57:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:57:46,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:46,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103604559] [2022-11-03 01:57:46,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103604559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:46,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:46,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:57:46,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784185287] [2022-11-03 01:57:46,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:46,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:57:46,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:57:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:46,587 INFO L87 Difference]: Start difference. First operand 909 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:47,197 INFO L93 Difference]: Finished difference Result 911 states and 1265 transitions. [2022-11-03 01:57:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:57:47,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-03 01:57:47,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:47,204 INFO L225 Difference]: With dead ends: 911 [2022-11-03 01:57:47,204 INFO L226 Difference]: Without dead ends: 908 [2022-11-03 01:57:47,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:47,206 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 428 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:47,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 368 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 01:57:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-11-03 01:57:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2022-11-03 01:57:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 619 states have (on average 1.3408723747980613) internal successors, (830), 632 states have internal predecessors, (830), 218 states have call successors, (218), 71 states have call predecessors, (218), 70 states have return successors, (214), 210 states have call predecessors, (214), 214 states have call successors, (214) [2022-11-03 01:57:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1262 transitions. [2022-11-03 01:57:47,289 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1262 transitions. Word has length 28 [2022-11-03 01:57:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:47,289 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1262 transitions. [2022-11-03 01:57:47,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1262 transitions. [2022-11-03 01:57:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:57:47,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:47,291 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:57:47,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:57:47,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -48083989, now seen corresponding path program 1 times [2022-11-03 01:57:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:47,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323976826] [2022-11-03 01:57:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:57:47,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:47,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323976826] [2022-11-03 01:57:47,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323976826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:47,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:47,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:57:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883063097] [2022-11-03 01:57:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:47,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:57:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:47,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:57:47,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:47,427 INFO L87 Difference]: Start difference. First operand 908 states and 1262 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:48,027 INFO L93 Difference]: Finished difference Result 910 states and 1263 transitions. [2022-11-03 01:57:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:57:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2022-11-03 01:57:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:48,034 INFO L225 Difference]: With dead ends: 910 [2022-11-03 01:57:48,034 INFO L226 Difference]: Without dead ends: 901 [2022-11-03 01:57:48,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:48,036 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 425 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:48,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 367 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:57:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-11-03 01:57:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2022-11-03 01:57:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 613 states have (on average 1.3393148450244698) internal successors, (821), 625 states have internal predecessors, (821), 217 states have call successors, (217), 71 states have call predecessors, (217), 70 states have return successors, (214), 210 states have call predecessors, (214), 214 states have call successors, (214) [2022-11-03 01:57:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1252 transitions. [2022-11-03 01:57:48,099 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1252 transitions. Word has length 29 [2022-11-03 01:57:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:48,100 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1252 transitions. [2022-11-03 01:57:48,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 01:57:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1252 transitions. [2022-11-03 01:57:48,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-03 01:57:48,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:48,103 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-03 01:57:48,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:57:48,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2041400381, now seen corresponding path program 1 times [2022-11-03 01:57:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:48,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459537067] [2022-11-03 01:57:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 01:57:48,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:48,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459537067] [2022-11-03 01:57:48,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459537067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:48,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:48,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:57:48,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956533974] [2022-11-03 01:57:48,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:48,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:57:48,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:48,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:57:48,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:48,375 INFO L87 Difference]: Start difference. First operand 901 states and 1252 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-03 01:57:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:49,490 INFO L93 Difference]: Finished difference Result 1437 states and 1996 transitions. [2022-11-03 01:57:49,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:57:49,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2022-11-03 01:57:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:49,494 INFO L225 Difference]: With dead ends: 1437 [2022-11-03 01:57:49,494 INFO L226 Difference]: Without dead ends: 545 [2022-11-03 01:57:49,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:57:49,497 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 36 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:49,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 723 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 01:57:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-11-03 01:57:49,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 534. [2022-11-03 01:57:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 378 states have (on average 1.3597883597883598) internal successors, (514), 385 states have internal predecessors, (514), 114 states have call successors, (114), 42 states have call predecessors, (114), 41 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2022-11-03 01:57:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 739 transitions. [2022-11-03 01:57:49,534 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 739 transitions. Word has length 79 [2022-11-03 01:57:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:49,534 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 739 transitions. [2022-11-03 01:57:49,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-03 01:57:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 739 transitions. [2022-11-03 01:57:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-03 01:57:49,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:49,536 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:49,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:57:49,537 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:57:49,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 79403539, now seen corresponding path program 1 times [2022-11-03 01:57:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:49,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352762213] [2022-11-03 01:57:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:57:50,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:50,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352762213] [2022-11-03 01:57:50,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352762213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:50,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436096094] [2022-11-03 01:57:50,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:50,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:50,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:50,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:50,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:57:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:51,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 2250 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 01:57:51,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 01:57:52,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:57:52,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436096094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:52,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1879777381] [2022-11-03 01:57:52,674 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-11-03 01:57:52,675 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:57:52,679 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:57:52,686 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:57:52,686 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:57:58,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:58,859 INFO L244 Elim1Store]: Index analysis took 403 ms [2022-11-03 01:57:58,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 270 select indices, 270 select index equivalence classes, 3852 disjoint index pairs (out of 36315 index pairs), introduced 270 new quantified variables, introduced 0 case distinctions, treesize of input 2067 treesize of output 811 [2022-11-03 01:58:03,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,618 INFO L244 Elim1Store]: Index analysis took 343 ms [2022-11-03 01:58:03,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 270 select indices, 270 select index equivalence classes, 3852 disjoint index pairs (out of 36315 index pairs), introduced 270 new quantified variables, introduced 0 case distinctions, treesize of input 2067 treesize of output 811 [2022-11-03 01:58:07,587 INFO L356 Elim1Store]: treesize reduction 703, result has 8.6 percent of original size [2022-11-03 01:58:07,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 30 treesize of output 71 [2022-11-03 01:58:08,518 INFO L356 Elim1Store]: treesize reduction 1016, result has 3.9 percent of original size [2022-11-03 01:58:08,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 52 case distinctions, treesize of input 220 treesize of output 217 [2022-11-03 01:58:09,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:09,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:10,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:10,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:13,665 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:13,697 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:14,534 INFO L356 Elim1Store]: treesize reduction 1016, result has 3.9 percent of original size [2022-11-03 01:58:14,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 52 case distinctions, treesize of input 220 treesize of output 217 [2022-11-03 01:58:14,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 46 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2022-11-03 01:58:15,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:15,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:16,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:16,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:19,282 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:21,887 INFO L356 Elim1Store]: treesize reduction 1016, result has 3.9 percent of original size [2022-11-03 01:58:21,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 52 case distinctions, treesize of input 220 treesize of output 217 [2022-11-03 01:58:22,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 46 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2022-11-03 01:58:22,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:23,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:24,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:24,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:26,576 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:26,583 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:27,421 INFO L356 Elim1Store]: treesize reduction 703, result has 8.6 percent of original size [2022-11-03 01:58:27,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 30 treesize of output 71 [2022-11-03 01:58:28,297 INFO L356 Elim1Store]: treesize reduction 1016, result has 3.9 percent of original size [2022-11-03 01:58:28,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 52 case distinctions, treesize of input 220 treesize of output 217 [2022-11-03 01:58:29,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:29,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:30,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:30,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 01:58:33,228 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:33,245 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:40,122 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_zalloc with input of size 191 for LOIs [2022-11-03 01:58:40,273 INFO L197 IcfgInterpreter]: Interpreting procedure kzalloc with input of size 546 for LOIs [2022-11-03 01:58:46,168 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 447 for LOIs [2022-11-03 01:58:47,658 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:59:13,258 WARN L234 SmtUtils]: Spent 24.98s on a formula simplification that was a NOOP. DAG size: 1787 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:59:28,354 WARN L234 SmtUtils]: Spent 9.89s on a formula simplification. DAG size of input: 545 DAG size of output: 451 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:59:35,762 WARN L234 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 432 DAG size of output: 397 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:59:51,798 WARN L234 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 422 DAG size of output: 387 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:00:06,658 WARN L234 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 602 DAG size of output: 527 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:00:16,547 WARN L234 SmtUtils]: Spent 8.69s on a formula simplification. DAG size of input: 546 DAG size of output: 449 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:00:27,060 WARN L234 SmtUtils]: Spent 9.40s on a formula simplification. DAG size of input: 565 DAG size of output: 469 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:00:47,748 WARN L234 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 591 DAG size of output: 516 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:00:55,802 WARN L234 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 595 DAG size of output: 520 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:01:03,972 WARN L234 SmtUtils]: Spent 7.25s on a formula simplification. DAG size of input: 603 DAG size of output: 524 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:01:12,476 WARN L234 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 607 DAG size of output: 528 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:01:13,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1879777381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:13,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:13,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [7, 7, 8] total 50 [2022-11-03 02:01:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554378135] [2022-11-03 02:01:13,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:13,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 02:01:13,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:13,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 02:01:13,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2237, Unknown=0, NotChecked=0, Total=2450 [2022-11-03 02:01:13,687 INFO L87 Difference]: Start difference. First operand 534 states and 739 transitions. Second operand has 33 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 24 states have internal predecessors, (45), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-03 02:01:59,088 WARN L234 SmtUtils]: Spent 44.71s on a formula simplification. DAG size of input: 1801 DAG size of output: 1791 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:02:44,826 WARN L234 SmtUtils]: Spent 45.08s on a formula simplification. DAG size of input: 1809 DAG size of output: 1799 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:03:31,949 WARN L234 SmtUtils]: Spent 45.46s on a formula simplification. DAG size of input: 1815 DAG size of output: 1805 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:03:56,446 WARN L234 SmtUtils]: Spent 23.69s on a formula simplification that was a NOOP. DAG size: 1791 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:04:14,877 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 504 DAG size of output: 425 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:04:21,798 WARN L234 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 494 DAG size of output: 415 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:04:30,811 WARN L234 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 531 DAG size of output: 386 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:04:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:57,763 INFO L93 Difference]: Finished difference Result 1152 states and 1598 transitions. [2022-11-03 02:04:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-03 02:04:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 24 states have internal predecessors, (45), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 85 [2022-11-03 02:04:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:57,768 INFO L225 Difference]: With dead ends: 1152 [2022-11-03 02:04:57,768 INFO L226 Difference]: Without dead ends: 626 [2022-11-03 02:04:57,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 338.8s TimeCoverageRelationStatistics Valid=323, Invalid=3709, Unknown=0, NotChecked=0, Total=4032 [2022-11-03 02:04:57,771 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 62 mSDsluCounter, 7499 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 6778 SdHoareTripleChecker+Invalid, 3995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 855 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:57,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 6778 Invalid, 3995 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 3101 Invalid, 0 Unknown, 855 Unchecked, 31.2s Time] [2022-11-03 02:04:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-11-03 02:04:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 591. [2022-11-03 02:04:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 425 states have (on average 1.3576470588235294) internal successors, (577), 433 states have internal predecessors, (577), 119 states have call successors, (119), 45 states have call predecessors, (119), 46 states have return successors, (121), 115 states have call predecessors, (121), 116 states have call successors, (121) [2022-11-03 02:04:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 817 transitions. [2022-11-03 02:04:57,934 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 817 transitions. Word has length 85 [2022-11-03 02:04:57,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:57,934 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 817 transitions. [2022-11-03 02:04:57,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 24 states have internal predecessors, (45), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-03 02:04:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 817 transitions. [2022-11-03 02:04:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-03 02:04:57,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:57,937 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:57,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:58,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:58,157 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:04:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash 932114785, now seen corresponding path program 1 times [2022-11-03 02:04:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:58,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553721399] [2022-11-03 02:04:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:04:59,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:59,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553721399] [2022-11-03 02:04:59,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553721399] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:59,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028680573] [2022-11-03 02:04:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:59,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:59,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:59,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:59,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:04:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:59,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 2291 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:04:59,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:05:00,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:05:00,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028680573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:05:00,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:05:00,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2022-11-03 02:05:00,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748934318] [2022-11-03 02:05:00,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:05:00,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:05:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:00,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:05:00,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:05:00,204 INFO L87 Difference]: Start difference. First operand 591 states and 817 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-03 02:05:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:01,902 INFO L93 Difference]: Finished difference Result 1133 states and 1588 transitions. [2022-11-03 02:05:01,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:05:01,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2022-11-03 02:05:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:01,906 INFO L225 Difference]: With dead ends: 1133 [2022-11-03 02:05:01,907 INFO L226 Difference]: Without dead ends: 700 [2022-11-03 02:05:01,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:05:01,909 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 130 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:01,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1513 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 02:05:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-11-03 02:05:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 601. [2022-11-03 02:05:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 431 states have (on average 1.3526682134570767) internal successors, (583), 440 states have internal predecessors, (583), 119 states have call successors, (119), 45 states have call predecessors, (119), 50 states have return successors, (131), 118 states have call predecessors, (131), 116 states have call successors, (131) [2022-11-03 02:05:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 833 transitions. [2022-11-03 02:05:02,092 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 833 transitions. Word has length 89 [2022-11-03 02:05:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:02,093 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 833 transitions. [2022-11-03 02:05:02,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-03 02:05:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 833 transitions. [2022-11-03 02:05:02,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-03 02:05:02,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:02,099 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:02,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 02:05:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:02,313 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:05:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1149126033, now seen corresponding path program 1 times [2022-11-03 02:05:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:02,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887887881] [2022-11-03 02:05:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-03 02:05:03,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:03,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887887881] [2022-11-03 02:05:03,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887887881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:03,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391402294] [2022-11-03 02:05:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:03,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:03,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:03,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:03,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:05:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:03,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 2316 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:05:03,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:05:04,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:05:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-03 02:05:04,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391402294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:05:04,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [166343156] [2022-11-03 02:05:04,641 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2022-11-03 02:05:04,643 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:05:04,644 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:05:04,646 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:05:04,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:05:07,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:05:07,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:05:07,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:05:08,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:08,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:09,262 INFO L244 Elim1Store]: Index analysis took 281 ms [2022-11-03 02:05:09,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 270 select indices, 270 select index equivalence classes, 3852 disjoint index pairs (out of 36315 index pairs), introduced 270 new quantified variables, introduced 0 case distinctions, treesize of input 2067 treesize of output 811 [2022-11-03 02:05:12,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:12,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:13,159 INFO L244 Elim1Store]: Index analysis took 329 ms [2022-11-03 02:05:13,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 270 select indices, 270 select index equivalence classes, 3852 disjoint index pairs (out of 36315 index pairs), introduced 270 new quantified variables, introduced 0 case distinctions, treesize of input 2067 treesize of output 811 [2022-11-03 02:05:17,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-11-03 02:05:17,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:05:17,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:05:18,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:05:18,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-11-03 02:05:18,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:05:21,165 INFO L356 Elim1Store]: treesize reduction 703, result has 8.6 percent of original size [2022-11-03 02:05:21,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 30 treesize of output 71 [2022-11-03 02:05:21,843 INFO L356 Elim1Store]: treesize reduction 1016, result has 3.9 percent of original size [2022-11-03 02:05:21,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 52 case distinctions, treesize of input 220 treesize of output 217 [2022-11-03 02:05:22,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-03 02:05:22,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:05:22,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 02:05:23,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 02:05:23,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 02:05:24,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 02:05:25,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 1 [2022-11-03 02:05:26,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 02:05:26,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 02:05:31,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:31,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2022-11-03 02:05:31,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 9 [2022-11-03 02:05:31,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2022-11-03 02:05:33,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:05:33,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 1 [2022-11-03 02:05:33,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-11-03 02:05:33,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:05:34,868 INFO L356 Elim1Store]: treesize reduction 954, result has 4.6 percent of original size [2022-11-03 02:05:34,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 case distinctions, treesize of input 36 treesize of output 54 [2022-11-03 02:05:37,264 INFO L356 Elim1Store]: treesize reduction 703, result has 8.6 percent of original size [2022-11-03 02:05:37,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 30 treesize of output 71 [2022-11-03 02:05:37,964 INFO L356 Elim1Store]: treesize reduction 1016, result has 3.9 percent of original size [2022-11-03 02:05:37,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 52 case distinctions, treesize of input 220 treesize of output 217 [2022-11-03 02:05:39,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 02:05:39,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 02:05:40,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 02:05:40,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-11-03 02:05:41,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 1 [2022-11-03 02:05:42,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 02:05:42,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-03 02:05:49,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 9 [2022-11-03 02:05:49,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:49,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:49,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1247 treesize of output 1238 [2022-11-03 02:05:49,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:49,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:49,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1247 treesize of output 1238 [2022-11-03 02:05:57,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:57,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:05:57,756 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Maybe an infinite loop at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostconditionCall(PredicateTransformer.java:157) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.postCall(SymbolicTools.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:218) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:98) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:98) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:05:57,760 INFO L158 Benchmark]: Toolchain (without parser) took 505103.43ms. Allocated memory was 113.2MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 70.8MB in the beginning and 603.4MB in the end (delta: -532.6MB). Peak memory consumption was 732.6MB. Max. memory is 16.1GB. [2022-11-03 02:05:57,760 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory was 94.0MB in the beginning and 93.9MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:05:57,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1886.58ms. Allocated memory is still 113.2MB. Free memory was 70.6MB in the beginning and 44.0MB in the end (delta: 26.6MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2022-11-03 02:05:57,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 205.68ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 44.0MB in the beginning and 94.2MB in the end (delta: -50.2MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-11-03 02:05:57,761 INFO L158 Benchmark]: Boogie Preprocessor took 200.72ms. Allocated memory is still 144.7MB. Free memory was 94.2MB in the beginning and 82.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 02:05:57,761 INFO L158 Benchmark]: RCFGBuilder took 3696.45ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 82.2MB in the beginning and 74.1MB in the end (delta: 8.1MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2022-11-03 02:05:57,762 INFO L158 Benchmark]: TraceAbstraction took 499099.32ms. Allocated memory was 203.4MB in the beginning and 1.1GB in the end (delta: 945.8MB). Free memory was 73.1MB in the beginning and 603.4MB in the end (delta: -530.3MB). Peak memory consumption was 646.6MB. Max. memory is 16.1GB. [2022-11-03 02:05:57,763 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 113.2MB. Free memory was 94.0MB in the beginning and 93.9MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1886.58ms. Allocated memory is still 113.2MB. Free memory was 70.6MB in the beginning and 44.0MB in the end (delta: 26.6MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 205.68ms. Allocated memory was 113.2MB in the beginning and 144.7MB in the end (delta: 31.5MB). Free memory was 44.0MB in the beginning and 94.2MB in the end (delta: -50.2MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 200.72ms. Allocated memory is still 144.7MB. Free memory was 94.2MB in the beginning and 82.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 3696.45ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 82.2MB in the beginning and 74.1MB in the end (delta: 8.1MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * TraceAbstraction took 499099.32ms. Allocated memory was 203.4MB in the beginning and 1.1GB in the end (delta: 945.8MB). Free memory was 73.1MB in the beginning and 603.4MB in the end (delta: -530.3MB). Peak memory consumption was 646.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Maybe an infinite loop de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Maybe an infinite loop: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:130) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-03 02:05:57,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 --- 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-5e519f3 [2022-11-03 02:06:00,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:06:00,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:06:00,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:06:00,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:06:00,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:06:00,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:06:00,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:06:00,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:06:00,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:06:00,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:06:00,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:06:00,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:06:00,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:06:00,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:06:00,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:06:00,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:06:00,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:06:00,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:06:00,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:06:00,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:06:00,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:06:00,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:06:00,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:06:00,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:06:00,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:06:00,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:06:00,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:06:00,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:06:00,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:06:00,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:06:00,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:06:00,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:06:00,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:06:00,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:06:00,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:06:00,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:06:00,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:06:00,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:06:00,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:06:00,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:06:00,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Bitvector.epf [2022-11-03 02:06:00,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:06:00,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:06:00,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:06:00,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:06:00,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:06:00,312 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:06:00,312 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:06:00,312 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:06:00,312 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:06:00,312 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:06:00,313 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:06:00,314 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:06:00,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:06:00,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:06:00,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:06:00,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:06:00,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:06:00,316 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:06:00,316 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:06:00,317 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:06:00,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:06:00,317 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:06:00,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:06:00,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:06:00,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:06:00,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:06:00,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:06:00,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:06:00,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:06:00,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:06:00,319 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:06:00,319 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:06:00,320 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:06:00,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:06:00,320 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:06:00,321 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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 [2022-11-03 02:06:00,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:06:00,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:06:00,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:06:00,767 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:06:00,768 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:06:00,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2022-11-03 02:06:00,836 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data/b58e327b0/892ad486ce544171a27e2a7250c4adc8/FLAG9db67ae76 [2022-11-03 02:06:01,751 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:06:01,752 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2022-11-03 02:06:01,790 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data/b58e327b0/892ad486ce544171a27e2a7250c4adc8/FLAG9db67ae76 [2022-11-03 02:06:01,876 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/data/b58e327b0/892ad486ce544171a27e2a7250c4adc8 [2022-11-03 02:06:01,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:06:01,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:06:01,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:06:01,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:06:01,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:06:01,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:06:01" (1/1) ... [2022-11-03 02:06:01,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183cd3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:01, skipping insertion in model container [2022-11-03 02:06:01,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:06:01" (1/1) ... [2022-11-03 02:06:01,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:06:02,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:06:02,722 WARN L230 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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2022-11-03 02:06:03,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:06:03,174 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-03 02:06:03,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:06:03,305 WARN L230 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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2022-11-03 02:06:03,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:06:03,516 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:06:03,631 WARN L230 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_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2022-11-03 02:06:03,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:06:03,832 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:06:03,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03 WrapperNode [2022-11-03 02:06:03,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:06:03,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:06:03,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:06:03,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:06:03,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:03,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,060 INFO L138 Inliner]: procedures = 126, calls = 1187, calls flagged for inlining = 51, calls inlined = 48, statements flattened = 2112 [2022-11-03 02:06:04,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:06:04,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:06:04,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:06:04,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:06:04,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,252 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:06:04,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:06:04,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:06:04,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:06:04,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (1/1) ... [2022-11-03 02:06:04,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:06:04,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:04,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:06:04,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:06:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-03 02:06:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2022-11-03 02:06:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2022-11-03 02:06:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-03 02:06:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:06:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-11-03 02:06:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-03 02:06:04,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-03 02:06:04,431 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-03 02:06:04,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-03 02:06:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-03 02:06:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-03 02:06:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-03 02:06:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-03 02:06:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-03 02:06:04,433 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-03 02:06:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-03 02:06:04,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-03 02:06:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-11-03 02:06:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-03 02:06:04,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-03 02:06:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 02:06:04,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 02:06:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:06:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-11-03 02:06:04,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-11-03 02:06:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure gtco_disconnect [2022-11-03 02:06:04,435 INFO L138 BoogieDeclarations]: Found implementation of procedure gtco_disconnect [2022-11-03 02:06:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2022-11-03 02:06:04,436 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2022-11-03 02:06:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:06:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-03 02:06:04,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-03 02:06:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:06:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:06:04,437 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-03 02:06:04,438 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-03 02:06:04,438 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-03 02:06:04,438 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-03 02:06:04,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:06:04,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-03 02:06:04,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-03 02:06:04,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-03 02:06:04,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:06:04,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:06:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2022-11-03 02:06:04,440 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2022-11-03 02:06:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:06:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-11-03 02:06:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:06:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-03 02:06:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-03 02:06:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-03 02:06:04,444 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-03 02:06:04,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-11-03 02:06:04,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-11-03 02:06:04,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-03 02:06:04,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-03 02:06:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:06:04,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:06:04,947 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:06:04,949 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:06:05,123 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-03 02:06:05,190 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-11-03 02:06:21,208 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:06:21,220 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:06:21,220 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 02:06:21,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:06:21 BoogieIcfgContainer [2022-11-03 02:06:21,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:06:21,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:06:21,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:06:21,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:06:21,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:06:01" (1/3) ... [2022-11-03 02:06:21,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4357c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:06:21, skipping insertion in model container [2022-11-03 02:06:21,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:03" (2/3) ... [2022-11-03 02:06:21,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4357c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:06:21, skipping insertion in model container [2022-11-03 02:06:21,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:06:21" (3/3) ... [2022-11-03 02:06:21,233 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2022-11-03 02:06:21,252 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:06:21,252 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:06:21,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:06:21,325 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@717bab3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:06:21,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:06:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 450 states, 343 states have (on average 1.3906705539358601) internal successors, (477), 354 states have internal predecessors, (477), 88 states have call successors, (88), 19 states have call predecessors, (88), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-03 02:06:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:06:21,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:21,343 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] [2022-11-03 02:06:21,343 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:21,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1034947126, now seen corresponding path program 1 times [2022-11-03 02:06:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:21,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797483321] [2022-11-03 02:06:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:21,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:21,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:21,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:21,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:06:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:22,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:06:22,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:22,096 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-03 02:06:22,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:22,097 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:22,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797483321] [2022-11-03 02:06:22,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797483321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:22,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:22,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:06:22,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913135455] [2022-11-03 02:06:22,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:22,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:06:22,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:06:22,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:06:22,139 INFO L87 Difference]: Start difference. First operand has 450 states, 343 states have (on average 1.3906705539358601) internal successors, (477), 354 states have internal predecessors, (477), 88 states have call successors, (88), 19 states have call predecessors, (88), 17 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:06:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:22,399 INFO L93 Difference]: Finished difference Result 1311 states and 1961 transitions. [2022-11-03 02:06:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:06:22,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-11-03 02:06:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:22,428 INFO L225 Difference]: With dead ends: 1311 [2022-11-03 02:06:22,428 INFO L226 Difference]: Without dead ends: 848 [2022-11-03 02:06:22,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-03 02:06:22,446 INFO L413 NwaCegarLoop]: 724 mSDtfsCounter, 599 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:22,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:06:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2022-11-03 02:06:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2022-11-03 02:06:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 654 states have (on average 1.3669724770642202) internal successors, (894), 660 states have internal predecessors, (894), 161 states have call successors, (161), 33 states have call predecessors, (161), 32 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2022-11-03 02:06:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1211 transitions. [2022-11-03 02:06:22,632 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1211 transitions. Word has length 22 [2022-11-03 02:06:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:22,633 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1211 transitions. [2022-11-03 02:06:22,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:06:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1211 transitions. [2022-11-03 02:06:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:06:22,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:22,636 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 02:06:22,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:22,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:22,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -362058192, now seen corresponding path program 1 times [2022-11-03 02:06:22,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:22,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658174695] [2022-11-03 02:06:22,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:22,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:22,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:22,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:22,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:06:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:23,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:06:23,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:06:23,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:23,432 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:23,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658174695] [2022-11-03 02:06:23,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658174695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:23,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:23,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:06:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838229210] [2022-11-03 02:06:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:23,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:06:23,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:23,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:06:23,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:06:23,437 INFO L87 Difference]: Start difference. First operand 848 states and 1211 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:23,619 INFO L93 Difference]: Finished difference Result 874 states and 1243 transitions. [2022-11-03 02:06:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:06:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-03 02:06:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:23,625 INFO L225 Difference]: With dead ends: 874 [2022-11-03 02:06:23,626 INFO L226 Difference]: Without dead ends: 861 [2022-11-03 02:06:23,626 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-03 02:06:23,627 INFO L413 NwaCegarLoop]: 639 mSDtfsCounter, 619 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:23,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 655 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:06:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-11-03 02:06:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 848. [2022-11-03 02:06:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 654 states have (on average 1.3654434250764527) internal successors, (893), 660 states have internal predecessors, (893), 161 states have call successors, (161), 33 states have call predecessors, (161), 32 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2022-11-03 02:06:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1210 transitions. [2022-11-03 02:06:23,691 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1210 transitions. Word has length 32 [2022-11-03 02:06:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:23,691 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1210 transitions. [2022-11-03 02:06:23,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1210 transitions. [2022-11-03 02:06:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:06:23,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:23,693 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 02:06:23,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:23,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:23,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash -304799890, now seen corresponding path program 1 times [2022-11-03 02:06:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:23,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058736969] [2022-11-03 02:06:23,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:23,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:23,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:23,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:23,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:06:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:24,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:06:24,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:06:24,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:24,733 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058736969] [2022-11-03 02:06:24,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058736969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:24,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:24,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:06:24,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490127608] [2022-11-03 02:06:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:24,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:06:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:24,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:06:24,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:06:24,735 INFO L87 Difference]: Start difference. First operand 848 states and 1210 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:24,963 INFO L93 Difference]: Finished difference Result 2519 states and 3613 transitions. [2022-11-03 02:06:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:06:24,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-03 02:06:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:24,974 INFO L225 Difference]: With dead ends: 2519 [2022-11-03 02:06:24,974 INFO L226 Difference]: Without dead ends: 1683 [2022-11-03 02:06:24,976 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-03 02:06:24,977 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 597 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1310 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-03 02:06:24,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1310 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:06:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2022-11-03 02:06:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1673. [2022-11-03 02:06:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1294 states have (on average 1.3639876352395672) internal successors, (1765), 1302 states have internal predecessors, (1765), 315 states have call successors, (315), 64 states have call predecessors, (315), 63 states have return successors, (316), 310 states have call predecessors, (316), 310 states have call successors, (316) [2022-11-03 02:06:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2396 transitions. [2022-11-03 02:06:25,125 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2396 transitions. Word has length 32 [2022-11-03 02:06:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:25,126 INFO L495 AbstractCegarLoop]: Abstraction has 1673 states and 2396 transitions. [2022-11-03 02:06:25,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2396 transitions. [2022-11-03 02:06:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:06:25,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:25,128 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 02:06:25,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:25,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:25,349 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:25,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash -859075655, now seen corresponding path program 1 times [2022-11-03 02:06:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:25,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542493982] [2022-11-03 02:06:25,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:25,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:25,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:25,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:25,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:06:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:25,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:06:25,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:06:26,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:26,166 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:26,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542493982] [2022-11-03 02:06:26,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542493982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:26,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:26,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:06:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299597026] [2022-11-03 02:06:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:26,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:06:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:26,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:06:26,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:06:26,168 INFO L87 Difference]: Start difference. First operand 1673 states and 2396 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:26,569 INFO L93 Difference]: Finished difference Result 4990 states and 7151 transitions. [2022-11-03 02:06:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:06:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-03 02:06:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:26,587 INFO L225 Difference]: With dead ends: 4990 [2022-11-03 02:06:26,587 INFO L226 Difference]: Without dead ends: 3329 [2022-11-03 02:06:26,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-03 02:06:26,596 INFO L413 NwaCegarLoop]: 1099 mSDtfsCounter, 591 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:26,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1709 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:06:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2022-11-03 02:06:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3320. [2022-11-03 02:06:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 2571 states have (on average 1.3617269544924153) internal successors, (3501), 2583 states have internal predecessors, (3501), 623 states have call successors, (623), 126 states have call predecessors, (623), 125 states have return successors, (630), 618 states have call predecessors, (630), 618 states have call successors, (630) [2022-11-03 02:06:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4754 transitions. [2022-11-03 02:06:26,944 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4754 transitions. Word has length 33 [2022-11-03 02:06:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:26,945 INFO L495 AbstractCegarLoop]: Abstraction has 3320 states and 4754 transitions. [2022-11-03 02:06:26,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4754 transitions. [2022-11-03 02:06:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 02:06:26,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:26,953 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 02:06:26,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:27,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:27,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -861750319, now seen corresponding path program 1 times [2022-11-03 02:06:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:27,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736267553] [2022-11-03 02:06:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:27,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:27,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:27,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:27,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 02:06:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:27,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:06:27,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:06:27,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:27,840 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:27,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736267553] [2022-11-03 02:06:27,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736267553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:27,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:27,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:06:27,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468917332] [2022-11-03 02:06:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:27,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:06:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:27,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:06:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:06:27,842 INFO L87 Difference]: Start difference. First operand 3320 states and 4754 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:28,115 INFO L93 Difference]: Finished difference Result 3327 states and 4760 transitions. [2022-11-03 02:06:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:06:28,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-11-03 02:06:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:28,132 INFO L225 Difference]: With dead ends: 3327 [2022-11-03 02:06:28,133 INFO L226 Difference]: Without dead ends: 3324 [2022-11-03 02:06:28,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-03 02:06:28,135 INFO L413 NwaCegarLoop]: 1100 mSDtfsCounter, 588 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:28,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1709 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:06:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2022-11-03 02:06:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 3321. [2022-11-03 02:06:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 2572 states have (on average 1.3615863141524105) internal successors, (3502), 2584 states have internal predecessors, (3502), 623 states have call successors, (623), 126 states have call predecessors, (623), 125 states have return successors, (630), 618 states have call predecessors, (630), 618 states have call successors, (630) [2022-11-03 02:06:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4755 transitions. [2022-11-03 02:06:28,425 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4755 transitions. Word has length 34 [2022-11-03 02:06:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:28,425 INFO L495 AbstractCegarLoop]: Abstraction has 3321 states and 4755 transitions. [2022-11-03 02:06:28,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4755 transitions. [2022-11-03 02:06:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:06:28,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:28,427 INFO L195 NwaCegarLoop]: trace histogram [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-03 02:06:28,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:28,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:28,646 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:28,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash -944660036, now seen corresponding path program 1 times [2022-11-03 02:06:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:28,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203544594] [2022-11-03 02:06:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:28,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:28,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:28,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:28,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 02:06:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:29,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:06:29,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:06:29,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:29,288 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:29,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203544594] [2022-11-03 02:06:29,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203544594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:29,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:29,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:06:29,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556089841] [2022-11-03 02:06:29,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:29,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:06:29,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:29,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:06:29,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:06:29,290 INFO L87 Difference]: Start difference. First operand 3321 states and 4755 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:29,520 INFO L93 Difference]: Finished difference Result 3323 states and 4756 transitions. [2022-11-03 02:06:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:06:29,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-03 02:06:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:29,537 INFO L225 Difference]: With dead ends: 3323 [2022-11-03 02:06:29,539 INFO L226 Difference]: Without dead ends: 3320 [2022-11-03 02:06:29,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-03 02:06:29,542 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 593 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 621 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-03 02:06:29,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 621 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:06:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2022-11-03 02:06:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 3320. [2022-11-03 02:06:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 2572 states have (on average 1.3611975116640747) internal successors, (3501), 2583 states have internal predecessors, (3501), 622 states have call successors, (622), 126 states have call predecessors, (622), 125 states have return successors, (630), 618 states have call predecessors, (630), 618 states have call successors, (630) [2022-11-03 02:06:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4753 transitions. [2022-11-03 02:06:29,871 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4753 transitions. Word has length 35 [2022-11-03 02:06:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:29,872 INFO L495 AbstractCegarLoop]: Abstraction has 3320 states and 4753 transitions. [2022-11-03 02:06:29,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4753 transitions. [2022-11-03 02:06:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:06:29,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:29,874 INFO L195 NwaCegarLoop]: trace histogram [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-03 02:06:29,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:30,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:30,098 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 780110900, now seen corresponding path program 1 times [2022-11-03 02:06:30,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:30,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106120152] [2022-11-03 02:06:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:30,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:30,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:30,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:30,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 02:06:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:30,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:06:30,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:06:30,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:30,699 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:30,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106120152] [2022-11-03 02:06:30,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106120152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:30,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:30,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:06:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173241094] [2022-11-03 02:06:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:30,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:06:30,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:30,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:06:30,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:06:30,702 INFO L87 Difference]: Start difference. First operand 3320 states and 4753 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:30,973 INFO L93 Difference]: Finished difference Result 3322 states and 4754 transitions. [2022-11-03 02:06:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:06:30,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-11-03 02:06:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:30,989 INFO L225 Difference]: With dead ends: 3322 [2022-11-03 02:06:30,989 INFO L226 Difference]: Without dead ends: 3310 [2022-11-03 02:06:30,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-03 02:06:30,992 INFO L413 NwaCegarLoop]: 620 mSDtfsCounter, 590 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 620 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-03 02:06:30,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:06:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2022-11-03 02:06:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3310. [2022-11-03 02:06:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3310 states, 2563 states have (on average 1.3609051892313695) internal successors, (3488), 2573 states have internal predecessors, (3488), 621 states have call successors, (621), 126 states have call predecessors, (621), 125 states have return successors, (630), 618 states have call predecessors, (630), 618 states have call successors, (630) [2022-11-03 02:06:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4739 transitions. [2022-11-03 02:06:31,304 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4739 transitions. Word has length 36 [2022-11-03 02:06:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:31,304 INFO L495 AbstractCegarLoop]: Abstraction has 3310 states and 4739 transitions. [2022-11-03 02:06:31,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-03 02:06:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4739 transitions. [2022-11-03 02:06:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-03 02:06:31,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:31,308 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-03 02:06:31,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:31,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:31,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:31,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1322798679, now seen corresponding path program 1 times [2022-11-03 02:06:31,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:31,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503911944] [2022-11-03 02:06:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:31,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:31,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:31,526 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:31,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 02:06:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:32,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:06:32,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 02:06:32,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:32,252 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:32,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503911944] [2022-11-03 02:06:32,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503911944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:32,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:32,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:06:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330902906] [2022-11-03 02:06:32,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:32,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:06:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:32,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:06:32,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:06:32,255 INFO L87 Difference]: Start difference. First operand 3310 states and 4739 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-03 02:06:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:32,724 INFO L93 Difference]: Finished difference Result 6736 states and 9643 transitions. [2022-11-03 02:06:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:06:32,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2022-11-03 02:06:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:32,741 INFO L225 Difference]: With dead ends: 6736 [2022-11-03 02:06:32,741 INFO L226 Difference]: Without dead ends: 3438 [2022-11-03 02:06:32,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-03 02:06:32,749 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 45 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1222 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.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:32,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1222 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:06:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2022-11-03 02:06:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3414. [2022-11-03 02:06:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3414 states, 2666 states have (on average 1.3630907726931734) internal successors, (3634), 2676 states have internal predecessors, (3634), 621 states have call successors, (621), 127 states have call predecessors, (621), 126 states have return successors, (630), 618 states have call predecessors, (630), 618 states have call successors, (630) [2022-11-03 02:06:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 4885 transitions. [2022-11-03 02:06:33,080 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 4885 transitions. Word has length 103 [2022-11-03 02:06:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:33,080 INFO L495 AbstractCegarLoop]: Abstraction has 3414 states and 4885 transitions. [2022-11-03 02:06:33,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-03 02:06:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 4885 transitions. [2022-11-03 02:06:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-03 02:06:33,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:33,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:06:33,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:33,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:33,313 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash -818637723, now seen corresponding path program 1 times [2022-11-03 02:06:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:33,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879369054] [2022-11-03 02:06:33,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:33,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:33,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:33,323 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:33,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 02:06:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:34,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:06:34,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:06:34,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:34,350 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:34,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879369054] [2022-11-03 02:06:34,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879369054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:34,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:34,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:06:34,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682053671] [2022-11-03 02:06:34,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:34,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:06:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:34,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:06:34,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:06:34,353 INFO L87 Difference]: Start difference. First operand 3414 states and 4885 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:06:37,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:06:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:37,233 INFO L93 Difference]: Finished difference Result 7280 states and 10460 transitions. [2022-11-03 02:06:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:06:37,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2022-11-03 02:06:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:37,252 INFO L225 Difference]: With dead ends: 7280 [2022-11-03 02:06:37,252 INFO L226 Difference]: Without dead ends: 3882 [2022-11-03 02:06:37,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 104 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-03 02:06:37,261 INFO L413 NwaCegarLoop]: 683 mSDtfsCounter, 119 mSDsluCounter, 5316 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 5999 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:37,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 5999 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 02:06:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2022-11-03 02:06:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3494. [2022-11-03 02:06:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3494 states, 2730 states have (on average 1.3545787545787547) internal successors, (3698), 2740 states have internal predecessors, (3698), 621 states have call successors, (621), 127 states have call predecessors, (621), 142 states have return successors, (694), 634 states have call predecessors, (694), 618 states have call successors, (694) [2022-11-03 02:06:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5013 transitions. [2022-11-03 02:06:37,619 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5013 transitions. Word has length 112 [2022-11-03 02:06:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:37,620 INFO L495 AbstractCegarLoop]: Abstraction has 3494 states and 5013 transitions. [2022-11-03 02:06:37,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:06:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5013 transitions. [2022-11-03 02:06:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-03 02:06:37,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:37,624 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:06:37,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:37,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:37,846 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1266039471, now seen corresponding path program 1 times [2022-11-03 02:06:37,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:37,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941687817] [2022-11-03 02:06:37,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:37,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:37,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:37,848 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:37,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 02:06:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:38,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:06:38,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:06:38,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:06:39,656 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:39,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941687817] [2022-11-03 02:06:39,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941687817] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:06:39,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1236249238] [2022-11-03 02:06:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:39,656 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:06:39,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:06:39,658 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:06:39,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-11-03 02:06:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:40,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:06:40,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-03 02:06:40,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:40,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1236249238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:40,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:06:40,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 9] total 19 [2022-11-03 02:06:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946372577] [2022-11-03 02:06:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:40,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:06:40,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:40,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:06:40,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:06:40,646 INFO L87 Difference]: Start difference. First operand 3494 states and 5013 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:06:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:41,982 INFO L93 Difference]: Finished difference Result 10626 states and 15237 transitions. [2022-11-03 02:06:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:06:41,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2022-11-03 02:06:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:42,038 INFO L225 Difference]: With dead ends: 10626 [2022-11-03 02:06:42,038 INFO L226 Difference]: Without dead ends: 7148 [2022-11-03 02:06:42,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:06:42,049 INFO L413 NwaCegarLoop]: 1211 mSDtfsCounter, 720 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:42,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 4149 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:06:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7148 states. [2022-11-03 02:06:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7148 to 3590. [2022-11-03 02:06:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3590 states, 2802 states have (on average 1.345467523197716) internal successors, (3770), 2812 states have internal predecessors, (3770), 645 states have call successors, (645), 127 states have call predecessors, (645), 142 states have return successors, (722), 658 states have call predecessors, (722), 642 states have call successors, (722) [2022-11-03 02:06:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 5137 transitions. [2022-11-03 02:06:42,614 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 5137 transitions. Word has length 118 [2022-11-03 02:06:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:42,615 INFO L495 AbstractCegarLoop]: Abstraction has 3590 states and 5137 transitions. [2022-11-03 02:06:42,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:06:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 5137 transitions. [2022-11-03 02:06:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-03 02:06:42,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:42,619 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:06:42,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:42,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:43,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:06:43,041 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:43,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash -13824207, now seen corresponding path program 1 times [2022-11-03 02:06:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:43,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317840177] [2022-11-03 02:06:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:43,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:43,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:43,044 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:43,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 02:06:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:43,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:06:43,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:06:44,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:06:44,797 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:44,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317840177] [2022-11-03 02:06:44,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317840177] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:06:44,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1686428488] [2022-11-03 02:06:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:44,798 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:06:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:06:44,801 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:06:44,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-11-03 02:06:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:45,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:06:45,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:06:45,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:06:46,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1686428488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:06:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468679504] [2022-11-03 02:06:46,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:46,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:46,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:46,161 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:06:46,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:06:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:46,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 1297 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 02:06:46,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:06:46,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:06:47,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468679504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:06:47,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:06:47,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 16 [2022-11-03 02:06:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056898624] [2022-11-03 02:06:47,340 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:06:47,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 02:06:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 02:06:47,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:06:47,342 INFO L87 Difference]: Start difference. First operand 3590 states and 5137 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 8 states have call predecessors, (18), 4 states have call successors, (18) [2022-11-03 02:06:50,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:06:53,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:06:55,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:06:56,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:06:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:56,679 INFO L93 Difference]: Finished difference Result 7600 states and 10876 transitions. [2022-11-03 02:06:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:06:56,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 8 states have call predecessors, (18), 4 states have call successors, (18) Word has length 118 [2022-11-03 02:06:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:56,704 INFO L225 Difference]: With dead ends: 7600 [2022-11-03 02:06:56,704 INFO L226 Difference]: Without dead ends: 4026 [2022-11-03 02:06:56,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:06:56,712 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 63 mSDsluCounter, 7240 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 7914 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:56,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 7914 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-03 02:06:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2022-11-03 02:06:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3606. [2022-11-03 02:06:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 2810 states have (on average 1.3444839857651245) internal successors, (3778), 2820 states have internal predecessors, (3778), 653 states have call successors, (653), 127 states have call predecessors, (653), 142 states have return successors, (738), 666 states have call predecessors, (738), 650 states have call successors, (738) [2022-11-03 02:06:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 5169 transitions. [2022-11-03 02:06:57,295 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 5169 transitions. Word has length 118 [2022-11-03 02:06:57,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:57,295 INFO L495 AbstractCegarLoop]: Abstraction has 3606 states and 5169 transitions. [2022-11-03 02:06:57,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 4 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 8 states have call predecessors, (18), 4 states have call successors, (18) [2022-11-03 02:06:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 5169 transitions. [2022-11-03 02:06:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-03 02:06:57,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:57,310 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-03 02:06:57,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:57,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:57,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:57,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:06:57,922 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:06:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2027575463, now seen corresponding path program 2 times [2022-11-03 02:06:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:06:57,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277920360] [2022-11-03 02:06:57,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 02:06:57,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:06:57,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:06:57,925 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:06:57,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 02:06:59,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 02:06:59,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:06:59,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:06:59,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 02:06:59,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:06:59,225 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:06:59,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277920360] [2022-11-03 02:06:59,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277920360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:06:59,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:06:59,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:06:59,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170652480] [2022-11-03 02:06:59,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:06:59,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:06:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:06:59,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:06:59,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:06:59,227 INFO L87 Difference]: Start difference. First operand 3606 states and 5169 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:06:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:59,690 INFO L93 Difference]: Finished difference Result 7212 states and 10337 transitions. [2022-11-03 02:06:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:06:59,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 124 [2022-11-03 02:06:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:59,704 INFO L225 Difference]: With dead ends: 7212 [2022-11-03 02:06:59,704 INFO L226 Difference]: Without dead ends: 3606 [2022-11-03 02:06:59,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 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-03 02:06:59,715 INFO L413 NwaCegarLoop]: 617 mSDtfsCounter, 0 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:59,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2457 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:06:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2022-11-03 02:07:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3606. [2022-11-03 02:07:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 2810 states have (on average 1.3444839857651245) internal successors, (3778), 2820 states have internal predecessors, (3778), 653 states have call successors, (653), 127 states have call predecessors, (653), 142 states have return successors, (730), 666 states have call predecessors, (730), 650 states have call successors, (730) [2022-11-03 02:07:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 5161 transitions. [2022-11-03 02:07:00,210 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 5161 transitions. Word has length 124 [2022-11-03 02:07:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:07:00,210 INFO L495 AbstractCegarLoop]: Abstraction has 3606 states and 5161 transitions. [2022-11-03 02:07:00,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:07:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 5161 transitions. [2022-11-03 02:07:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-03 02:07:00,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:07:00,214 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:00,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:07:00,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:07:00,433 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:07:00,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:07:00,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1972520605, now seen corresponding path program 3 times [2022-11-03 02:07:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:07:00,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668275736] [2022-11-03 02:07:00,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:07:00,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:07:00,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:07:00,435 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:07:00,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-03 02:07:52,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:07:52,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-03 02:07:52,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:07:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:07:56,223 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-03 02:07:56,224 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:07:56,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 02:07:56,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:07:56,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:07:56,445 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:07:56,448 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:07:56,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:07:56 BoogieIcfgContainer [2022-11-03 02:07:56,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:07:56,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:07:56,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:07:56,698 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:07:56,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:06:21" (3/4) ... [2022-11-03 02:07:56,701 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:07:56,922 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:07:56,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:07:56,923 INFO L158 Benchmark]: Toolchain (without parser) took 115041.71ms. Allocated memory was 58.7MB in the beginning and 675.3MB in the end (delta: 616.6MB). Free memory was 29.1MB in the beginning and 463.3MB in the end (delta: -434.2MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. [2022-11-03 02:07:56,923 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 58.7MB. Free memory was 39.4MB in the beginning and 39.4MB in the end (delta: 46.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:07:56,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1952.49ms. Allocated memory was 58.7MB in the beginning and 94.4MB in the end (delta: 35.7MB). Free memory was 28.8MB in the beginning and 35.9MB in the end (delta: -7.1MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2022-11-03 02:07:56,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 222.14ms. Allocated memory is still 94.4MB. Free memory was 35.9MB in the beginning and 38.1MB in the end (delta: -2.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:07:56,925 INFO L158 Benchmark]: Boogie Preprocessor took 267.63ms. Allocated memory was 94.4MB in the beginning and 140.5MB in the end (delta: 46.1MB). Free memory was 38.1MB in the beginning and 96.8MB in the end (delta: -58.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-11-03 02:07:56,928 INFO L158 Benchmark]: RCFGBuilder took 16892.96ms. Allocated memory was 140.5MB in the beginning and 268.4MB in the end (delta: 127.9MB). Free memory was 96.8MB in the beginning and 133.0MB in the end (delta: -36.2MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2022-11-03 02:07:56,929 INFO L158 Benchmark]: TraceAbstraction took 95471.31ms. Allocated memory was 268.4MB in the beginning and 675.3MB in the end (delta: 406.8MB). Free memory was 132.0MB in the beginning and 507.3MB in the end (delta: -375.3MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2022-11-03 02:07:56,930 INFO L158 Benchmark]: Witness Printer took 224.38ms. Allocated memory is still 675.3MB. Free memory was 507.3MB in the beginning and 463.3MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-03 02:07:56,934 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 58.7MB. Free memory was 39.4MB in the beginning and 39.4MB in the end (delta: 46.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1952.49ms. Allocated memory was 58.7MB in the beginning and 94.4MB in the end (delta: 35.7MB). Free memory was 28.8MB in the beginning and 35.9MB in the end (delta: -7.1MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 222.14ms. Allocated memory is still 94.4MB. Free memory was 35.9MB in the beginning and 38.1MB in the end (delta: -2.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 267.63ms. Allocated memory was 94.4MB in the beginning and 140.5MB in the end (delta: 46.1MB). Free memory was 38.1MB in the beginning and 96.8MB in the end (delta: -58.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * RCFGBuilder took 16892.96ms. Allocated memory was 140.5MB in the beginning and 268.4MB in the end (delta: 127.9MB). Free memory was 96.8MB in the beginning and 133.0MB in the end (delta: -36.2MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. * TraceAbstraction took 95471.31ms. Allocated memory was 268.4MB in the beginning and 675.3MB in the end (delta: 406.8MB). Free memory was 132.0MB in the beginning and 507.3MB in the end (delta: -375.3MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 224.38ms. Allocated memory is still 675.3MB. Free memory was 507.3MB in the beginning and 463.3MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. 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. - 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 - CounterExampleResult [Line: 3735]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3758] int ldv_state_variable_1 ; [L3759] int LDV_IN_INTERRUPT = 1; [L3760] int usb_counter ; [L3761] struct usb_interface *gtco_driverinfo_table_group1 ; [L3762] int ref_cnt ; [L3763] int ldv_state_variable_0 ; [L3830-L3844] static struct usb_device_id const gtco_usbid_table[6U] = { {3U, 1932U, 1024U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 1025U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4096U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4097U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4098U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L3845] struct usb_device_id const __mod_usb_device_table ; [L4829-L4834] static struct usb_driver gtco_driverinfo_table = {"gtco", & gtco_probe, & gtco_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& gtco_usbid_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, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L4850] int ldv_retval_0 ; [L4851] int ldv_retval_1 ; [L5064] int INTERF_STATE = 0; [L5065] int SERIAL_STATE = 0; [L5066] void *usb_intfdata = 0; [L5067] struct urb *usb_urb = 0; [L5068] struct usb_device *usb_dev = 0; [L5069] int dev_counter = 0; [L5070] int completeFnIntCounter = 0; [L5071] int completeFnBulkCounter = 0; [L5072] void (*completeFnInt)(struct urb * ) ; [L5073] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4865] struct usb_device_id *ldvarg0 ; [L4866] void *tmp ; [L4867] int tmp___0 ; [L4868] int tmp___1 ; [L4869] 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, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4871] CALL, EXPR ldv_zalloc(32UL) 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, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=32, \result={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, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=32, tmp___0=2147483648, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4871] RET, EXPR ldv_zalloc(32UL) 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, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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, ldv_zalloc(32UL)={0:0}, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4871] tmp = ldv_zalloc(32UL) [L4872] ldvarg0 = (struct usb_device_id *)tmp [L4873] FCALL ldv_initialize() [L4874] ldv_state_variable_1 = 0 [L4875] ref_cnt = 0 [L4876] 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, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] 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, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] case 0: [L4922] 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, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4923] COND TRUE ldv_state_variable_0 == 1 [L4924] CALL, EXPR gtco_driverinfo_table_init() [L4837] int tmp ; [L4839] CALL, EXPR ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L5036] ldv_func_ret_type ldv_func_res ; [L5037] int tmp ; [L5039] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5370] return __VERIFIER_nondet_int(); [L5039] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5039] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5040] ldv_func_res = tmp [L5041] ldv_state_variable_1 = 1 [L5042] usb_counter = 0 [L5043] CALL ldv_usb_driver_1() [L4856] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4858] CALL, EXPR ldv_zalloc(1520UL) 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=1520, \result={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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=1520, tmp___0=2147483648, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4858] RET, EXPR ldv_zalloc(1520UL) 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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, ldv_zalloc(1520UL)={0:0}, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4858] tmp = ldv_zalloc(1520UL) [L4859] gtco_driverinfo_table_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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5043] RET ldv_usb_driver_1() [L5044] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, ldv_func_arg1={167:0}, ldv_func_arg1={167:0}, ldv_func_arg2={168:169}, ldv_func_arg2={168:169}, ldv_func_arg3={165:0}, ldv_func_arg3={165: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4839] RET, EXPR ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L4839] tmp = ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L4840] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4924] RET, EXPR gtco_driverinfo_table_init() [L4924] ldv_retval_1 = gtco_driverinfo_table_init() [L4925] COND TRUE ldv_retval_1 == 0 [L4926] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4929] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=0, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4881] COND TRUE ldv_state_variable_1 != 0 [L4882] tmp___1 = __VERIFIER_nondet_int() [L4884] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4885] COND TRUE ldv_state_variable_1 == 1 [L4886] CALL, EXPR gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4569] struct gtco *gtco ; [L4570] struct input_dev *input_dev ; [L4571] struct hid_descriptor *hid_desc ; [L4572] char *report ; [L4573] int result ; [L4574] int retry ; [L4575] int error ; [L4576] struct usb_endpoint_descriptor *endpoint ; [L4577] void *tmp ; [L4578] struct usb_device *tmp___0 ; [L4579] void *tmp___1 ; [L4580] struct _ddebug descriptor ; [L4581] long tmp___2 ; [L4582] struct _ddebug descriptor___0 ; [L4583] long tmp___3 ; [L4584] struct _ddebug descriptor___1 ; [L4585] long tmp___4 ; [L4586] struct _ddebug descriptor___2 ; [L4587] long tmp___5 ; [L4588] struct _ddebug descriptor___3 ; [L4589] long tmp___6 ; [L4590] int tmp___7 ; [L4591] struct _ddebug descriptor___4 ; [L4592] long tmp___8 ; [L4593] int tmp___9 ; [L4594] struct _ddebug descriptor___5 ; [L4595] long tmp___10 ; [L4596] void *tmp___11 ; [L4597] unsigned int tmp___12 ; [L4598] struct _ddebug descriptor___6 ; [L4599] long tmp___13 ; [L4600] unsigned int tmp___14 ; [L4602] result = 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={-9223372036854775761:0}, descriptor___0={-1441151880758558828:0}, descriptor___1={-7205759403792793708:0}, descriptor___2={-288230376151711852:0}, descriptor___3={-2594073385365405932:0}, descriptor___4={-2594073385365405921:0}, descriptor___5={-2594073385365405804:0}, descriptor___6={-9223372036853727169:0}, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, hid_desc={-8935141660703064061:0}, id={0:0}, id={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4603] CALL, EXPR kzalloc(152UL, 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3667] void *tmp ; [L3669] CALL, EXPR kmalloc(size, flags | 32768U) [L3658] void *tmp___2 ; [L3660] CALL, EXPR __kmalloc(size, flags) [L3653] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=152, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp VAL [={0:0}, ={0:0}, \old(size)=152, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775805:0}, ref_cnt=0, SERIAL_STATE=0, size=152, tmp={-9223372036854775805:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3679] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=152, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775805:0}, ref_cnt=0, SERIAL_STATE=0, size=152, tmp={-9223372036854775805:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3694] return (p); VAL [={0:0}, ={0:0}, \old(size)=152, \result={-9223372036854775805:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775805:0}, ref_cnt=0, SERIAL_STATE=0, size=152, tmp={-9223372036854775805:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=152, \old(t)=32976, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-9223372036854775805: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=152, t=32976, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] return ldv_malloc(size); [L3660] RET, EXPR __kmalloc(size, flags) [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, \old(flags)=32976, \old(size)=152, \result={-9223372036854775805:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32976, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=152, tmp___2={-9223372036854775805:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] RET, EXPR kmalloc(size, flags | 32768U) [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=152, \result={-9223372036854775805:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=208, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=152, tmp={-9223372036854775805:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4603] RET, EXPR kzalloc(152UL, 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={-9223372036854775761:0}, descriptor___0={-1441151880758558828:0}, descriptor___1={-7205759403792793708:0}, descriptor___2={-288230376151711852:0}, descriptor___3={-2594073385365405932:0}, descriptor___4={-2594073385365405921:0}, descriptor___5={-2594073385365405804:0}, descriptor___6={-9223372036853727169:0}, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, hid_desc={-8935141660703064061:0}, id={0:0}, id={0:0}, INTERF_STATE=0, kzalloc(152UL, 208U)={-9223372036854775805: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=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4603] tmp = kzalloc(152UL, 208U) [L4604] gtco = (struct gtco *)tmp [L4605] CALL, EXPR input_allocate_device() [L3766] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3667] void *tmp ; [L3669] CALL, EXPR kmalloc(size, flags | 32768U) [L3658] void *tmp___2 ; [L3660] CALL, EXPR __kmalloc(size, flags) [L3653] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=2144, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp VAL [={0:0}, ={0:0}, \old(size)=2144, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={4611686018427387905:0}, ref_cnt=0, SERIAL_STATE=0, size=2144, tmp={4611686018427387905:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3679] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=2144, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={4611686018427387905:0}, ref_cnt=0, SERIAL_STATE=0, size=2144, tmp={4611686018427387905:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3694] return (p); VAL [={0:0}, ={0:0}, \old(size)=2144, \result={4611686018427387905:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={4611686018427387905:0}, ref_cnt=0, SERIAL_STATE=0, size=2144, tmp={4611686018427387905:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=2144, \old(t)=32976, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={4611686018427387905: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=2144, t=32976, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] return ldv_malloc(size); [L3660] RET, EXPR __kmalloc(size, flags) [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, \old(flags)=32976, \old(size)=2144, \result={4611686018427387905:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32976, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=2144, tmp___2={4611686018427387905:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] RET, EXPR kmalloc(size, flags | 32768U) [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=2144, \result={4611686018427387905:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=208, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=2144, tmp={4611686018427387905:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3766] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={4611686018427387905: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3766] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L4605] RET, EXPR input_allocate_device() [L4605] input_dev = input_allocate_device() [L4606] COND FALSE !((unsigned long )gtco == (unsigned long )((struct gtco *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L4612] gtco->inputdevice = input_dev [L4613] CALL, EXPR interface_to_usbdev(usbinterface) [L4956] struct usb_device *tmp ; [L4958] CALL, EXPR ldv_interface_to_usbdev() [L5177] void *result ; [L5178] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5180] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, \old(size)=1889, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1889, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775807:0}, ref_cnt=0, SERIAL_STATE=0, size=1889, tmp={-9223372036854775807:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3679] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1889, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775807:0}, ref_cnt=0, SERIAL_STATE=0, size=1889, tmp={-9223372036854775807:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3694] return (p); VAL [={0:0}, ={0:0}, \old(size)=1889, \result={-9223372036854775807:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775807:0}, ref_cnt=0, SERIAL_STATE=0, size=1889, tmp={-9223372036854775807:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5180] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-9223372036854775807: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5180] tmp = ldv_malloc(sizeof(struct usb_device)) [L5181] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775807:0}, SERIAL_STATE=0, tmp={-9223372036854775807:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5182] COND TRUE (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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775807:0}, SERIAL_STATE=0, tmp={-9223372036854775807:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5186] return (result); VAL [={0:0}, ={0:0}, \result={-9223372036854775807:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775807:0}, SERIAL_STATE=0, tmp={-9223372036854775807:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4958] RET, EXPR ldv_interface_to_usbdev() [L4958] tmp = ldv_interface_to_usbdev() [L4959] return (tmp); VAL [={0:0}, ={0:0}, \result={-9223372036854775807:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, intf={0:0}, intf={0: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={-9223372036854775807:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4613] RET, EXPR interface_to_usbdev(usbinterface) [L4613] tmp___0 = interface_to_usbdev(usbinterface) [L4614] CALL, EXPR ldv_usb_get_dev_4(tmp___0) [L4980] struct usb_device *tmp ; [L4982] CALL, EXPR ldv_get_dev(ldv_func_arg1) [L5191] int 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, data={-9223372036854775807:0}, data={-9223372036854775807:0}, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5193] COND TRUE (unsigned long )usb_dev == (unsigned long )((struct usb_device *)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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, data={-9223372036854775807:0}, data={-9223372036854775807:0}, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5194] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3717] int tmp ; [L3719] tmp = __VERIFIER_nondet_int() [L3720] return (tmp); VAL [={0:0}, ={0:0}, \result=-2147483648, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=2147483648, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5194] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, data={-9223372036854775807:0}, data={-9223372036854775807:0}, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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()=-2147483648, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5194] tmp = ldv_undef_int() [L5195] COND TRUE \read(tmp) [L5196] dev_counter = dev_counter + 1 [L5197] usb_dev = 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, data={-9223372036854775807:0}, data={-9223372036854775807:0}, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=2147483648, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5205] return (usb_dev); VAL [={0:0}, ={0:0}, \result={-9223372036854775807:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, data={-9223372036854775807:0}, data={-9223372036854775807:0}, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=2147483648, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4982] RET, EXPR ldv_get_dev(ldv_func_arg1) [L4982] tmp = ldv_get_dev(ldv_func_arg1) [L4983] return (tmp); VAL [={0:0}, ={0:0}, \result={-9223372036854775807:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, ldv_func_arg1={-9223372036854775807:0}, ldv_func_arg1={-9223372036854775807: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={-9223372036854775807:0}, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4614] RET, EXPR ldv_usb_get_dev_4(tmp___0) [L4614] gtco->usbdev = ldv_usb_get_dev_4(tmp___0) [L4615] gtco->intf = usbinterface [L4616] EXPR gtco->usbdev [L4616] CALL, EXPR usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L5353] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND TRUE tmp___0 != 0 [L3689] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=0, \result={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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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=0, tmp___0=2147483648, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5353] RET, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(arg1)=null, \old(arg2)=null, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, arg0={-9223372036854775807:0}, arg0={-9223372036854775807:0}, arg1=null, arg2=null, arg3={-9223372036854775805:32}, arg3={-9223372036854775805:32}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={0: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_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5353] return ldv_malloc(0UL); [L4616] RET, EXPR usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L4616] tmp___1 = usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L4617] gtco->buffer = (unsigned char *)tmp___1 [L4618] EXPR gtco->buffer 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={-9223372036854775761:0}, descriptor___0={-1441151880758558828:0}, descriptor___1={-7205759403792793708:0}, descriptor___2={-288230376151711852:0}, descriptor___3={-2594073385365405932:0}, descriptor___4={-2594073385365405921:0}, descriptor___5={-2594073385365405804:0}, descriptor___6={-9223372036853727169:0}, dev_counter=1, gtco={-9223372036854775805:0}, gtco->buffer={0:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, hid_desc={-8935141660703064061:0}, id={0:0}, id={0:0}, input_dev={4611686018427387905: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=0, SERIAL_STATE=0, tmp={-9223372036854775805:0}, tmp___0={-9223372036854775807:0}, tmp___1={0:0}, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4618] COND TRUE (unsigned long )gtco->buffer == (unsigned long )((unsigned char *)0U) [L4620] error = -12 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={-9223372036854775761:0}, descriptor___0={-1441151880758558828:0}, descriptor___1={-7205759403792793708:0}, descriptor___2={-288230376151711852:0}, descriptor___3={-2594073385365405932:0}, descriptor___4={-2594073385365405921:0}, descriptor___5={-2594073385365405804:0}, descriptor___6={-9223372036853727169:0}, dev_counter=1, error=4294967284, gtco={-9223372036854775805:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, hid_desc={-8935141660703064061:0}, id={0:0}, id={0:0}, input_dev={4611686018427387905: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=0, SERIAL_STATE=0, tmp={-9223372036854775805:0}, tmp___0={-9223372036854775807:0}, tmp___1={0:0}, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4805] FCALL input_free_device(input_dev) [L4806] CALL kfree((void const *)gtco) 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166: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={-9223372036854775805:0}, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4806] RET kfree((void const *)gtco) 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={-9223372036854775761:0}, descriptor___0={-1441151880758558828:0}, descriptor___1={-7205759403792793708:0}, descriptor___2={-288230376151711852:0}, descriptor___3={-2594073385365405932:0}, descriptor___4={-2594073385365405921:0}, descriptor___5={-2594073385365405804:0}, descriptor___6={-9223372036853727169:0}, dev_counter=1, error=4294967284, gtco={-9223372036854775805:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, hid_desc={-8935141660703064061:0}, id={0:0}, id={0:0}, input_dev={4611686018427387905: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=0, SERIAL_STATE=0, tmp={-9223372036854775805:0}, tmp___0={-9223372036854775807:0}, tmp___1={0:0}, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); VAL [={0:0}, ={0:0}, \result=-12, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, error=4294967284, gtco={-9223372036854775805:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, id={0:0}, id={0:0}, input_dev={4611686018427387905: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=0, SERIAL_STATE=0, tmp={-9223372036854775805:0}, tmp___0={-9223372036854775807:0}, tmp___1={0:0}, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4886] RET, EXPR gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4886] ldv_retval_0 = gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4887] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___1=0, tmp___2=1, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] 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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4915] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L4916] CALL gtco_driverinfo_table_exit() [L4846] CALL ldv_usb_deregister_12(& gtco_driverinfo_table) [L5050] FCALL usb_deregister(arg) [L5051] ldv_state_variable_1 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, arg={167:0}, arg={167:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4846] RET ldv_usb_deregister_12(& gtco_driverinfo_table) [L4916] RET gtco_driverinfo_table_exit() [L4917] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4950] CALL ldv_check_final_state() [L5283] COND TRUE (unsigned long )usb_urb == (unsigned long )((struct urb *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5287] COND FALSE !((unsigned long )usb_dev == (unsigned long )((struct usb_device *)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, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5289] CALL ldv_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3735] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-9223372036854775807:0}, usb_intfdata={0:0}, usb_urb={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 452 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 95.1s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5131 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5124 mSDsluCounter, 29708 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20398 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 321 IncrementalHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 9310 mSDtfsCounter, 321 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1616 GetRequests, 1558 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3606occurred in iteration=11, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 4425 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 57.1s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1283 NumberOfCodeBlocks, 1283 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 2760 SizeOfPredicates, 70 NumberOfNonLiveVariables, 16626 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 479/551 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 proved your program to be incorrect! [2022-11-03 02:07:57,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ea3ea2e-3e8b-449b-b240-dc7bc69f80ab/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE