./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point_true-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point_true-unreach-call.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c4902120881d27fc457e3fe728170baa2cf05f87 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 12:19:03,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:19:03,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:19:03,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:19:03,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:19:03,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:19:03,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:19:03,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:19:03,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:19:03,132 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:19:03,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:19:03,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:19:03,133 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:19:03,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:19:03,134 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:19:03,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:19:03,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:19:03,135 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:19:03,136 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:19:03,137 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:19:03,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:19:03,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:19:03,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:19:03,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:19:03,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:19:03,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:19:03,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:19:03,140 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:19:03,141 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:19:03,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:19:03,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:19:03,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:19:03,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:19:03,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:19:03,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:19:03,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:19:03,142 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-12-02 12:19:03,149 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:19:03,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:19:03,150 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:19:03,150 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:19:03,150 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:19:03,150 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:19:03,150 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:19:03,150 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:19:03,150 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:19:03,150 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:19:03,150 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-02 12:19:03,151 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:19:03,151 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:19:03,151 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:19:03,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:19:03,151 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:19:03,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:19:03,151 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:19:03,152 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:19:03,152 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:19:03,152 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:19:03,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:19:03,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:19:03,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:19:03,152 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:19:03,152 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:19:03,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:19:03,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:19:03,152 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:19:03,153 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:19:03,153 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:19:03,153 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:19:03,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:19:03,153 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 12:19:03,153 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-12-02 12:19:03,153 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan 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(__VERIFIER_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 -> c4902120881d27fc457e3fe728170baa2cf05f87 [2018-12-02 12:19:03,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:19:03,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:19:03,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:19:03,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:19:03,179 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:19:03,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point_true-unreach-call.cil.out.i [2018-12-02 12:19:03,214 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/data/8ebf68054/75f875d6accd434ab64577a1009a18a6/FLAGc1adee003 [2018-12-02 12:19:03,755 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:19:03,756 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point_true-unreach-call.cil.out.i [2018-12-02 12:19:03,776 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/data/8ebf68054/75f875d6accd434ab64577a1009a18a6/FLAGc1adee003 [2018-12-02 12:19:04,247 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/data/8ebf68054/75f875d6accd434ab64577a1009a18a6 [2018-12-02 12:19:04,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:19:04,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:19:04,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:19:04,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:19:04,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:19:04,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:19:04" (1/1) ... [2018-12-02 12:19:04,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d04ea20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:04, skipping insertion in model container [2018-12-02 12:19:04,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:19:04" (1/1) ... [2018-12-02 12:19:04,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:19:04,330 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:19:05,677 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:19:05,689 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:19:05,900 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:19:06,053 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:19:06,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06 WrapperNode [2018-12-02 12:19:06,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:19:06,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:19:06,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:19:06,054 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:19:06,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... [2018-12-02 12:19:06,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... [2018-12-02 12:19:06,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:19:06,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:19:06,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:19:06,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:19:06,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... [2018-12-02 12:19:06,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... [2018-12-02 12:19:06,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... [2018-12-02 12:19:06,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... [2018-12-02 12:19:06,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... [2018-12-02 12:19:06,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... [2018-12-02 12:19:06,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... [2018-12-02 12:19:06,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:19:06,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:19:06,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:19:06,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:19:06,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:19:06,294 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_mpt_command [2018-12-02 12:19:06,295 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_mpt_command [2018-12-02 12:19:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_17 [2018-12-02 12:19:06,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_17 [2018-12-02 12:19:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of__MPT_MGMT [2018-12-02 12:19:06,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of__MPT_MGMT [2018-12-02 12:19:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_14 [2018-12-02 12:19:06,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_14 [2018-12-02 12:19:06,295 INFO L130 BoogieDeclarations]: Found specification of procedure pci_domain_nr [2018-12-02 12:19:06,296 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_domain_nr [2018-12-02 12:19:06,296 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_device_driver_register [2018-12-02 12:19:06,296 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_device_driver_register [2018-12-02 12:19:06,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_31 [2018-12-02 12:19:06,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_31 [2018-12-02 12:19:06,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_28 [2018-12-02 12:19:06,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_28 [2018-12-02 12:19:06,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_29 [2018-12-02 12:19:06,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_29 [2018-12-02 12:19:06,297 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_fw_download [2018-12-02 12:19:06,297 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_fw_download [2018-12-02 12:19:06,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-12-02 12:19:06,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-12-02 12:19:06,297 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2018-12-02 12:19:06,297 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2018-12-02 12:19:06,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-12-02 12:19:06,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-12-02 12:19:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2018-12-02 12:19:06,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2018-12-02 12:19:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2018-12-02 12:19:06,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2018-12-02 12:19:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_Soft_Hard_ResetHandler [2018-12-02 12:19:06,298 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_Soft_Hard_ResetHandler [2018-12-02 12:19:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_26 [2018-12-02 12:19:06,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_26 [2018-12-02 12:19:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_27 [2018-12-02 12:19:06,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_27 [2018-12-02 12:19:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_24 [2018-12-02 12:19:06,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_24 [2018-12-02 12:19:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure fasync_helper [2018-12-02 12:19:06,299 INFO L138 BoogieDeclarations]: Found implementation of procedure fasync_helper [2018-12-02 12:19:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_25 [2018-12-02 12:19:06,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_25 [2018-12-02 12:19:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_23 [2018-12-02 12:19:06,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_23 [2018-12-02 12:19:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2018-12-02 12:19:06,299 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2018-12-02 12:19:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_21 [2018-12-02 12:19:06,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_21 [2018-12-02 12:19:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mpctl_mutex [2018-12-02 12:19:06,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mpctl_mutex [2018-12-02 12:19:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_hp_targetinfo [2018-12-02 12:19:06,300 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_hp_targetinfo [2018-12-02 12:19:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 12:19:06,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 12:19:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_19 [2018-12-02 12:19:06,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_19 [2018-12-02 12:19:06,301 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_GetIocState [2018-12-02 12:19:06,301 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_GetIocState [2018-12-02 12:19:06,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_18 [2018-12-02 12:19:06,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_18 [2018-12-02 12:19:06,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_external_alloc [2018-12-02 12:19:06,301 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_reset_deregister [2018-12-02 12:19:06,301 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_reset_deregister [2018-12-02 12:19:06,301 INFO L130 BoogieDeclarations]: Found specification of procedure kmemcheck_mark_initialized [2018-12-02 12:19:06,301 INFO L138 BoogieDeclarations]: Found implementation of procedure kmemcheck_mark_initialized [2018-12-02 12:19:06,301 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_init [2018-12-02 12:19:06,301 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_init [2018-12-02 12:19:06,302 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2018-12-02 12:19:06,302 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2018-12-02 12:19:06,302 INFO L130 BoogieDeclarations]: Found specification of procedure __scsi_iterate_devices [2018-12-02 12:19:06,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __scsi_iterate_devices [2018-12-02 12:19:06,302 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2018-12-02 12:19:06,302 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2018-12-02 12:19:06,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-12-02 12:19:06,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-12-02 12:19:06,302 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_exit [2018-12-02 12:19:06,302 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_exit [2018-12-02 12:19:06,302 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_syscall_down [2018-12-02 12:19:06,302 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_syscall_down [2018-12-02 12:19:06,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_2 [2018-12-02 12:19:06,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_2 [2018-12-02 12:19:06,303 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_replace_fw [2018-12-02 12:19:06,303 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_replace_fw [2018-12-02 12:19:06,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_mpt_pci_driver_1 [2018-12-02 12:19:06,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_mpt_pci_driver_1 [2018-12-02 12:19:06,303 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2018-12-02 12:19:06,303 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2018-12-02 12:19:06,303 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_device_driver_deregister [2018-12-02 12:19:06,303 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_device_driver_deregister [2018-12-02 12:19:06,303 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2018-12-02 12:19:06,303 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2018-12-02 12:19:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_remove [2018-12-02 12:19:06,304 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_remove [2018-12-02 12:19:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-02 12:19:06,304 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-02 12:19:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_open_2 [2018-12-02 12:19:06,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_open_2 [2018-12-02 12:19:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_probe [2018-12-02 12:19:06,304 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_probe [2018-12-02 12:19:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame [2018-12-02 12:19:06,304 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame [2018-12-02 12:19:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 12:19:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 12:19:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2018-12-02 12:19:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2018-12-02 12:19:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-12-02 12:19:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-12-02 12:19:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_unmap_page [2018-12-02 12:19:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_unmap_page [2018-12-02 12:19:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2018-12-02 12:19:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2018-12-02 12:19:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure __mptctl_ioctl [2018-12-02 12:19:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __mptctl_ioctl [2018-12-02 12:19:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_register_32 [2018-12-02 12:19:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_register_32 [2018-12-02 12:19:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_single_attrs [2018-12-02 12:19:06,306 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_single_attrs [2018-12-02 12:19:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_mpt_command [2018-12-02 12:19:06,306 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_mpt_command [2018-12-02 12:19:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_fw_download [2018-12-02 12:19:06,306 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_fw_download [2018-12-02 12:19:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-12-02 12:19:06,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2018-12-02 12:19:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_readtest [2018-12-02 12:19:06,306 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_readtest [2018-12-02 12:19:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 12:19:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2018-12-02 12:19:06,307 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2018-12-02 12:19:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2018-12-02 12:19:06,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2018-12-02 12:19:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_HardResetHandler [2018-12-02 12:19:06,307 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_HardResetHandler [2018-12-02 12:19:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame_hi_pri [2018-12-02 12:19:06,307 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame_hi_pri [2018-12-02 12:19:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2018-12-02 12:19:06,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2018-12-02 12:19:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2018-12-02 12:19:06,307 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2018-12-02 12:19:06,307 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2018-12-02 12:19:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2018-12-02 12:19:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_fw_memory [2018-12-02 12:19:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_fw_memory [2018-12-02 12:19:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_taskmgmt [2018-12-02 12:19:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_taskmgmt [2018-12-02 12:19:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2018-12-02 12:19:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2018-12-02 12:19:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:19:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 12:19:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_clear_taskmgmt_in_progress_flag [2018-12-02 12:19:06,308 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_clear_taskmgmt_in_progress_flag [2018-12-02 12:19:06,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_2 [2018-12-02 12:19:06,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_2 [2018-12-02 12:19:06,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_30 [2018-12-02 12:19:06,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_30 [2018-12-02 12:19:06,309 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_timeout_expired [2018-12-02 12:19:06,309 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_timeout_expired [2018-12-02 12:19:06,309 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2018-12-02 12:19:06,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2018-12-02 12:19:06,309 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2018-12-02 12:19:06,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2018-12-02 12:19:06,309 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-12-02 12:19:06,309 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-12-02 12:19:06,310 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-12-02 12:19:06,310 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-12-02 12:19:06,310 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_alloc_fw_memory [2018-12-02 12:19:06,310 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_alloc_fw_memory [2018-12-02 12:19:06,310 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2018-12-02 12:19:06,310 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2018-12-02 12:19:06,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_20 [2018-12-02 12:19:06,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_20 [2018-12-02 12:19:06,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mpctl_mutex [2018-12-02 12:19:06,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mpctl_mutex [2018-12-02 12:19:06,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_22 [2018-12-02 12:19:06,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_22 [2018-12-02 12:19:06,310 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2018-12-02 12:19:06,311 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2018-12-02 12:19:06,311 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_eventenable [2018-12-02 12:19:06,311 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_eventenable [2018-12-02 12:19:06,311 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_fasync [2018-12-02 12:19:06,311 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_fasync [2018-12-02 12:19:06,311 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2018-12-02 12:19:06,311 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2018-12-02 12:19:06,311 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-12-02 12:19:06,311 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2018-12-02 12:19:06,311 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2018-12-02 12:19:06,311 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2018-12-02 12:19:06,311 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_13 [2018-12-02 12:19:06,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_13 [2018-12-02 12:19:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_reset [2018-12-02 12:19:06,312 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_reset [2018-12-02 12:19:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:19:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-02 12:19:06,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-02 12:19:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2018-12-02 12:19:06,312 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2018-12-02 12:19:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 12:19:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_set_taskmgmt_in_progress_flag [2018-12-02 12:19:06,312 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_set_taskmgmt_in_progress_flag [2018-12-02 12:19:06,312 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_halt_firmware [2018-12-02 12:19:06,313 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_halt_firmware [2018-12-02 12:19:06,313 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2018-12-02 12:19:06,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2018-12-02 12:19:06,313 INFO L130 BoogieDeclarations]: Found specification of procedure compat_mpctl_ioctl [2018-12-02 12:19:06,313 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_mpctl_ioctl [2018-12-02 12:19:06,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2018-12-02 12:19:06,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2018-12-02 12:19:06,313 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_verify_adapter [2018-12-02 12:19:06,313 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_verify_adapter [2018-12-02 12:19:06,313 INFO L130 BoogieDeclarations]: Found specification of procedure compat_mpt_command [2018-12-02 12:19:06,313 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_mpt_command [2018-12-02 12:19:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-12-02 12:19:06,314 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2018-12-02 12:19:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure kbuf_alloc_2_sgl [2018-12-02 12:19:06,314 INFO L138 BoogieDeclarations]: Found implementation of procedure kbuf_alloc_2_sgl [2018-12-02 12:19:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_12 [2018-12-02 12:19:06,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_12 [2018-12-02 12:19:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2018-12-02 12:19:06,314 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2018-12-02 12:19:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2018-12-02 12:19:06,314 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2018-12-02 12:19:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:19:06,314 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_eventreport [2018-12-02 12:19:06,315 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_eventreport [2018-12-02 12:19:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2018-12-02 12:19:06,315 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2018-12-02 12:19:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_deregister [2018-12-02 12:19:06,315 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_deregister [2018-12-02 12:19:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_sgl [2018-12-02 12:19:06,315 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_sgl [2018-12-02 12:19:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2018-12-02 12:19:06,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2018-12-02 12:19:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_target [2018-12-02 12:19:06,315 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_target [2018-12-02 12:19:06,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-12-02 12:19:06,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-12-02 12:19:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2018-12-02 12:19:06,316 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2018-12-02 12:19:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-12-02 12:19:06,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-12-02 12:19:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure compat_mptfwxfer_ioctl [2018-12-02 12:19:06,316 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_mptfwxfer_ioctl [2018-12-02 12:19:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure dma_map_single_attrs [2018-12-02 12:19:06,316 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_map_single_attrs [2018-12-02 12:19:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2018-12-02 12:19:06,316 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2018-12-02 12:19:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-12-02 12:19:06,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-12-02 12:19:06,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 12:19:06,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 12:19:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 12:19:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_get_msg_frame [2018-12-02 12:19:06,317 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_get_msg_frame [2018-12-02 12:19:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2018-12-02 12:19:06,317 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2018-12-02 12:19:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_reset_register [2018-12-02 12:19:06,317 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_reset_register [2018-12-02 12:19:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_hp_hostinfo [2018-12-02 12:19:06,317 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_hp_hostinfo [2018-12-02 12:19:06,317 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2018-12-02 12:19:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2018-12-02 12:19:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure misc_register [2018-12-02 12:19:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_register [2018-12-02 12:19:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2018-12-02 12:19:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2018-12-02 12:19:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_eventquery [2018-12-02 12:19:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_eventquery [2018-12-02 12:19:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2018-12-02 12:19:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2018-12-02 12:19:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_ioctl [2018-12-02 12:19:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_ioctl [2018-12-02 12:19:06,318 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_deregister_35 [2018-12-02 12:19:06,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_deregister_35 [2018-12-02 12:19:06,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_deregister_34 [2018-12-02 12:19:06,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_deregister_34 [2018-12-02 12:19:06,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_deregister_33 [2018-12-02 12:19:06,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_deregister_33 [2018-12-02 12:19:06,319 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_getiocinfo [2018-12-02 12:19:06,319 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_getiocinfo [2018-12-02 12:19:06,319 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2018-12-02 12:19:06,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2018-12-02 12:19:06,319 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_send_handshake_request [2018-12-02 12:19:06,319 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_send_handshake_request [2018-12-02 12:19:06,319 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_map_page [2018-12-02 12:19:06,319 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_map_page [2018-12-02 12:19:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_15 [2018-12-02 12:19:06,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_15 [2018-12-02 12:19:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_16 [2018-12-02 12:19:06,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_16 [2018-12-02 12:19:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_event_deregister [2018-12-02 12:19:06,320 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_event_deregister [2018-12-02 12:19:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_event_register [2018-12-02 12:19:06,320 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_event_register [2018-12-02 12:19:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_register [2018-12-02 12:19:06,320 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_register [2018-12-02 12:19:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_gettargetinfo [2018-12-02 12:19:06,320 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_gettargetinfo [2018-12-02 12:19:06,320 INFO L130 BoogieDeclarations]: Found specification of procedure no_llseek [2018-12-02 12:19:06,321 INFO L138 BoogieDeclarations]: Found implementation of procedure no_llseek [2018-12-02 12:19:06,321 INFO L130 BoogieDeclarations]: Found specification of procedure memdup_user [2018-12-02 12:19:06,321 INFO L138 BoogieDeclarations]: Found implementation of procedure memdup_user [2018-12-02 12:19:06,321 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_attrs [2018-12-02 12:19:06,321 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_attrs [2018-12-02 12:19:06,321 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user_overflow [2018-12-02 12:19:06,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_to_user_overflow [2018-12-02 12:19:06,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2018-12-02 12:19:06,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2018-12-02 12:19:06,321 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2018-12-02 12:19:06,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2018-12-02 12:19:06,321 INFO L130 BoogieDeclarations]: Found specification of procedure shost_priv [2018-12-02 12:19:06,321 INFO L138 BoogieDeclarations]: Found implementation of procedure shost_priv [2018-12-02 12:19:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_from_user_overflow [2018-12-02 12:19:06,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_from_user_overflow [2018-12-02 12:19:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 12:19:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-02 12:19:06,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-02 12:19:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2018-12-02 12:19:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:19:06,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:19:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_config [2018-12-02 12:19:06,322 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_config [2018-12-02 12:19:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_msg_frame [2018-12-02 12:19:06,322 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_msg_frame [2018-12-02 12:19:06,322 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2018-12-02 12:19:06,323 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2018-12-02 12:21:26,462 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:21:26,462 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 12:21:26,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:21:26 BoogieIcfgContainer [2018-12-02 12:21:26,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:21:26,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:21:26,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:21:26,466 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:21:26,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:19:04" (1/3) ... [2018-12-02 12:21:26,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5198dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:21:26, skipping insertion in model container [2018-12-02 12:21:26,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:19:06" (2/3) ... [2018-12-02 12:21:26,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5198dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:21:26, skipping insertion in model container [2018-12-02 12:21:26,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:21:26" (3/3) ... [2018-12-02 12:21:26,469 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point_true-unreach-call.cil.out.i [2018-12-02 12:21:26,477 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:21:26,485 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 12:21:26,499 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 12:21:26,529 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:21:26,529 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:21:26,529 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:21:26,530 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:21:26,530 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:21:26,530 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:21:26,530 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:21:26,530 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:21:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states. [2018-12-02 12:21:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 12:21:26,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:26,560 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:26,561 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:26,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:26,565 INFO L82 PathProgramCache]: Analyzing trace with hash -773542833, now seen corresponding path program 1 times [2018-12-02 12:21:26,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:26,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:26,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:26,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:26,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-12-02 12:21:26,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:26,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:26,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:26,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:26,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:26,976 INFO L87 Difference]: Start difference. First operand 1659 states. Second operand 3 states. [2018-12-02 12:21:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:27,328 INFO L93 Difference]: Finished difference Result 3416 states and 4723 transitions. [2018-12-02 12:21:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:27,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-12-02 12:21:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:27,344 INFO L225 Difference]: With dead ends: 3416 [2018-12-02 12:21:27,344 INFO L226 Difference]: Without dead ends: 1764 [2018-12-02 12:21:27,350 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-12-02 12:21:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1736. [2018-12-02 12:21:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-12-02 12:21:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2344 transitions. [2018-12-02 12:21:27,430 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2344 transitions. Word has length 124 [2018-12-02 12:21:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:27,430 INFO L480 AbstractCegarLoop]: Abstraction has 1736 states and 2344 transitions. [2018-12-02 12:21:27,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2344 transitions. [2018-12-02 12:21:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 12:21:27,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:27,433 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:27,433 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:27,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1124770652, now seen corresponding path program 1 times [2018-12-02 12:21:27,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:27,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:27,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:27,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:27,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-12-02 12:21:27,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:27,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:27,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:27,598 INFO L87 Difference]: Start difference. First operand 1736 states and 2344 transitions. Second operand 3 states. [2018-12-02 12:21:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:30,024 INFO L93 Difference]: Finished difference Result 4979 states and 6765 transitions. [2018-12-02 12:21:30,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:30,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-12-02 12:21:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:30,034 INFO L225 Difference]: With dead ends: 4979 [2018-12-02 12:21:30,034 INFO L226 Difference]: Without dead ends: 3288 [2018-12-02 12:21:30,039 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2018-12-02 12:21:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3272. [2018-12-02 12:21:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3272 states. [2018-12-02 12:21:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4452 transitions. [2018-12-02 12:21:30,108 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4452 transitions. Word has length 152 [2018-12-02 12:21:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:30,108 INFO L480 AbstractCegarLoop]: Abstraction has 3272 states and 4452 transitions. [2018-12-02 12:21:30,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4452 transitions. [2018-12-02 12:21:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 12:21:30,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:30,110 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:30,110 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:30,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:30,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1233200684, now seen corresponding path program 1 times [2018-12-02 12:21:30,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:30,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:30,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:30,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:30,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-02 12:21:30,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:30,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:30,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:30,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:30,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:30,264 INFO L87 Difference]: Start difference. First operand 3272 states and 4452 transitions. Second operand 3 states. [2018-12-02 12:21:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:30,304 INFO L93 Difference]: Finished difference Result 3274 states and 4453 transitions. [2018-12-02 12:21:30,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:30,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-02 12:21:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:30,314 INFO L225 Difference]: With dead ends: 3274 [2018-12-02 12:21:30,314 INFO L226 Difference]: Without dead ends: 3271 [2018-12-02 12:21:30,315 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2018-12-02 12:21:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 3271. [2018-12-02 12:21:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3271 states. [2018-12-02 12:21:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4450 transitions. [2018-12-02 12:21:30,388 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4450 transitions. Word has length 174 [2018-12-02 12:21:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:30,388 INFO L480 AbstractCegarLoop]: Abstraction has 3271 states and 4450 transitions. [2018-12-02 12:21:30,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4450 transitions. [2018-12-02 12:21:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-02 12:21:30,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:30,390 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:30,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:30,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:30,391 INFO L82 PathProgramCache]: Analyzing trace with hash 424928211, now seen corresponding path program 1 times [2018-12-02 12:21:30,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:30,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:30,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:30,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:30,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-02 12:21:30,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:30,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:30,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:30,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:30,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:30,536 INFO L87 Difference]: Start difference. First operand 3271 states and 4450 transitions. Second operand 3 states. [2018-12-02 12:21:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:30,585 INFO L93 Difference]: Finished difference Result 3273 states and 4451 transitions. [2018-12-02 12:21:30,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:30,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-12-02 12:21:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:30,595 INFO L225 Difference]: With dead ends: 3273 [2018-12-02 12:21:30,595 INFO L226 Difference]: Without dead ends: 3270 [2018-12-02 12:21:30,597 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2018-12-02 12:21:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3270. [2018-12-02 12:21:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2018-12-02 12:21:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4448 transitions. [2018-12-02 12:21:30,679 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4448 transitions. Word has length 175 [2018-12-02 12:21:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:30,679 INFO L480 AbstractCegarLoop]: Abstraction has 3270 states and 4448 transitions. [2018-12-02 12:21:30,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4448 transitions. [2018-12-02 12:21:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-02 12:21:30,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:30,681 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:30,681 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:30,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash 287321271, now seen corresponding path program 1 times [2018-12-02 12:21:30,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:30,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:30,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-02 12:21:30,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:30,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:30,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:30,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:30,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:30,841 INFO L87 Difference]: Start difference. First operand 3270 states and 4448 transitions. Second operand 3 states. [2018-12-02 12:21:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:30,919 INFO L93 Difference]: Finished difference Result 3280 states and 4454 transitions. [2018-12-02 12:21:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:30,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-12-02 12:21:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:30,933 INFO L225 Difference]: With dead ends: 3280 [2018-12-02 12:21:30,934 INFO L226 Difference]: Without dead ends: 3276 [2018-12-02 12:21:30,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2018-12-02 12:21:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3274. [2018-12-02 12:21:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3274 states. [2018-12-02 12:21:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 4447 transitions. [2018-12-02 12:21:31,042 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 4447 transitions. Word has length 176 [2018-12-02 12:21:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:31,043 INFO L480 AbstractCegarLoop]: Abstraction has 3274 states and 4447 transitions. [2018-12-02 12:21:31,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 4447 transitions. [2018-12-02 12:21:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 12:21:31,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:31,044 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:31,045 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:31,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash 316478294, now seen corresponding path program 1 times [2018-12-02 12:21:31,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:31,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:31,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:31,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:31,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-02 12:21:31,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:31,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:31,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:31,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:31,185 INFO L87 Difference]: Start difference. First operand 3274 states and 4447 transitions. Second operand 3 states. [2018-12-02 12:21:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:31,339 INFO L93 Difference]: Finished difference Result 9402 states and 12915 transitions. [2018-12-02 12:21:31,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:31,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2018-12-02 12:21:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:31,356 INFO L225 Difference]: With dead ends: 9402 [2018-12-02 12:21:31,356 INFO L226 Difference]: Without dead ends: 6173 [2018-12-02 12:21:31,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2018-12-02 12:21:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 6141. [2018-12-02 12:21:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6141 states. [2018-12-02 12:21:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 8428 transitions. [2018-12-02 12:21:31,511 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 8428 transitions. Word has length 177 [2018-12-02 12:21:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:31,511 INFO L480 AbstractCegarLoop]: Abstraction has 6141 states and 8428 transitions. [2018-12-02 12:21:31,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 8428 transitions. [2018-12-02 12:21:31,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 12:21:31,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:31,512 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:31,512 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:31,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1220350874, now seen corresponding path program 1 times [2018-12-02 12:21:31,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:31,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:31,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:31,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-02 12:21:31,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:31,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:31,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:31,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:31,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:31,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:31,657 INFO L87 Difference]: Start difference. First operand 6141 states and 8428 transitions. Second operand 3 states. [2018-12-02 12:21:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:31,731 INFO L93 Difference]: Finished difference Result 6143 states and 8429 transitions. [2018-12-02 12:21:31,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:31,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-12-02 12:21:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:31,748 INFO L225 Difference]: With dead ends: 6143 [2018-12-02 12:21:31,748 INFO L226 Difference]: Without dead ends: 6103 [2018-12-02 12:21:31,751 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:31,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2018-12-02 12:21:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 6103. [2018-12-02 12:21:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6103 states. [2018-12-02 12:21:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 8382 transitions. [2018-12-02 12:21:31,931 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 8382 transitions. Word has length 178 [2018-12-02 12:21:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:31,931 INFO L480 AbstractCegarLoop]: Abstraction has 6103 states and 8382 transitions. [2018-12-02 12:21:31,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 8382 transitions. [2018-12-02 12:21:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-02 12:21:31,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:31,933 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:31,933 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:31,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash -632512251, now seen corresponding path program 1 times [2018-12-02 12:21:31,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:31,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:31,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:31,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:31,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-02 12:21:32,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:32,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:32,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:32,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:32,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:32,066 INFO L87 Difference]: Start difference. First operand 6103 states and 8382 transitions. Second operand 3 states. [2018-12-02 12:21:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:34,515 INFO L93 Difference]: Finished difference Result 9339 states and 12779 transitions. [2018-12-02 12:21:34,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:34,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-12-02 12:21:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:34,523 INFO L225 Difference]: With dead ends: 9339 [2018-12-02 12:21:34,523 INFO L226 Difference]: Without dead ends: 3279 [2018-12-02 12:21:34,534 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2018-12-02 12:21:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3270. [2018-12-02 12:21:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2018-12-02 12:21:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4437 transitions. [2018-12-02 12:21:34,597 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4437 transitions. Word has length 209 [2018-12-02 12:21:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:34,597 INFO L480 AbstractCegarLoop]: Abstraction has 3270 states and 4437 transitions. [2018-12-02 12:21:34,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4437 transitions. [2018-12-02 12:21:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-02 12:21:34,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:34,599 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:34,599 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:34,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash -576458849, now seen corresponding path program 1 times [2018-12-02 12:21:34,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:34,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:34,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:34,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-02 12:21:34,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:34,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:34,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:34,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:34,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:34,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:34,746 INFO L87 Difference]: Start difference. First operand 3270 states and 4437 transitions. Second operand 3 states. [2018-12-02 12:21:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:37,148 INFO L93 Difference]: Finished difference Result 3274 states and 4439 transitions. [2018-12-02 12:21:37,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:37,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-12-02 12:21:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:37,157 INFO L225 Difference]: With dead ends: 3274 [2018-12-02 12:21:37,157 INFO L226 Difference]: Without dead ends: 3271 [2018-12-02 12:21:37,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2018-12-02 12:21:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 3269. [2018-12-02 12:21:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2018-12-02 12:21:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4434 transitions. [2018-12-02 12:21:37,217 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 4434 transitions. Word has length 212 [2018-12-02 12:21:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:37,218 INFO L480 AbstractCegarLoop]: Abstraction has 3269 states and 4434 transitions. [2018-12-02 12:21:37,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 4434 transitions. [2018-12-02 12:21:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-12-02 12:21:37,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:37,221 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:37,221 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:37,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:37,221 INFO L82 PathProgramCache]: Analyzing trace with hash 527508995, now seen corresponding path program 1 times [2018-12-02 12:21:37,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:37,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:37,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-12-02 12:21:37,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:37,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:37,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:37,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:37,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:37,373 INFO L87 Difference]: Start difference. First operand 3269 states and 4434 transitions. Second operand 3 states. [2018-12-02 12:21:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:39,792 INFO L93 Difference]: Finished difference Result 6704 states and 9076 transitions. [2018-12-02 12:21:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:39,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2018-12-02 12:21:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:39,801 INFO L225 Difference]: With dead ends: 6704 [2018-12-02 12:21:39,801 INFO L226 Difference]: Without dead ends: 3536 [2018-12-02 12:21:39,806 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2018-12-02 12:21:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3491. [2018-12-02 12:21:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3491 states. [2018-12-02 12:21:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 4695 transitions. [2018-12-02 12:21:39,871 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 4695 transitions. Word has length 281 [2018-12-02 12:21:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:39,871 INFO L480 AbstractCegarLoop]: Abstraction has 3491 states and 4695 transitions. [2018-12-02 12:21:39,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4695 transitions. [2018-12-02 12:21:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-12-02 12:21:39,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:39,874 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:39,874 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:39,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:39,875 INFO L82 PathProgramCache]: Analyzing trace with hash -57521226, now seen corresponding path program 1 times [2018-12-02 12:21:39,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:39,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:39,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:39,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:39,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-02 12:21:40,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:40,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:40,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:40,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:40,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:40,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:40,049 INFO L87 Difference]: Start difference. First operand 3491 states and 4695 transitions. Second operand 3 states. [2018-12-02 12:21:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:40,134 INFO L93 Difference]: Finished difference Result 6883 states and 9289 transitions. [2018-12-02 12:21:40,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:40,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2018-12-02 12:21:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:40,141 INFO L225 Difference]: With dead ends: 6883 [2018-12-02 12:21:40,142 INFO L226 Difference]: Without dead ends: 3493 [2018-12-02 12:21:40,147 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3493 states. [2018-12-02 12:21:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3493 to 3493. [2018-12-02 12:21:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3493 states. [2018-12-02 12:21:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 4697 transitions. [2018-12-02 12:21:40,208 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 4697 transitions. Word has length 298 [2018-12-02 12:21:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:40,208 INFO L480 AbstractCegarLoop]: Abstraction has 3493 states and 4697 transitions. [2018-12-02 12:21:40,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 4697 transitions. [2018-12-02 12:21:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-12-02 12:21:40,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:40,212 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:40,212 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:40,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:40,212 INFO L82 PathProgramCache]: Analyzing trace with hash -857086495, now seen corresponding path program 1 times [2018-12-02 12:21:40,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:40,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:40,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:40,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-12-02 12:21:40,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:40,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:40,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:40,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:40,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:40,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:40,379 INFO L87 Difference]: Start difference. First operand 3493 states and 4697 transitions. Second operand 3 states. [2018-12-02 12:21:40,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:40,508 INFO L93 Difference]: Finished difference Result 6923 states and 9335 transitions. [2018-12-02 12:21:40,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:40,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-12-02 12:21:40,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:40,516 INFO L225 Difference]: With dead ends: 6923 [2018-12-02 12:21:40,516 INFO L226 Difference]: Without dead ends: 3531 [2018-12-02 12:21:40,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2018-12-02 12:21:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3531. [2018-12-02 12:21:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3531 states. [2018-12-02 12:21:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3531 states to 3531 states and 4733 transitions. [2018-12-02 12:21:40,583 INFO L78 Accepts]: Start accepts. Automaton has 3531 states and 4733 transitions. Word has length 317 [2018-12-02 12:21:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:40,583 INFO L480 AbstractCegarLoop]: Abstraction has 3531 states and 4733 transitions. [2018-12-02 12:21:40,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3531 states and 4733 transitions. [2018-12-02 12:21:40,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-12-02 12:21:40,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:40,585 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:40,585 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:40,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:40,586 INFO L82 PathProgramCache]: Analyzing trace with hash 137607203, now seen corresponding path program 1 times [2018-12-02 12:21:40,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:40,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:40,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-12-02 12:21:40,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:40,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:40,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:40,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:40,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:40,757 INFO L87 Difference]: Start difference. First operand 3531 states and 4733 transitions. Second operand 6 states. [2018-12-02 12:21:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:40,990 INFO L93 Difference]: Finished difference Result 6975 states and 9413 transitions. [2018-12-02 12:21:40,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:40,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 317 [2018-12-02 12:21:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:40,996 INFO L225 Difference]: With dead ends: 6975 [2018-12-02 12:21:40,996 INFO L226 Difference]: Without dead ends: 3545 [2018-12-02 12:21:41,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2018-12-02 12:21:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3545. [2018-12-02 12:21:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3545 states. [2018-12-02 12:21:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 4783 transitions. [2018-12-02 12:21:41,075 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 4783 transitions. Word has length 317 [2018-12-02 12:21:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:41,076 INFO L480 AbstractCegarLoop]: Abstraction has 3545 states and 4783 transitions. [2018-12-02 12:21:41,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 4783 transitions. [2018-12-02 12:21:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-12-02 12:21:41,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:41,078 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:41,078 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:41,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash -975871295, now seen corresponding path program 1 times [2018-12-02 12:21:41,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:41,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:41,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:41,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2018-12-02 12:21:41,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:41,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:41,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:41,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:41,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:41,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:41,254 INFO L87 Difference]: Start difference. First operand 3545 states and 4783 transitions. Second operand 6 states. [2018-12-02 12:21:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:43,692 INFO L93 Difference]: Finished difference Result 6996 states and 9451 transitions. [2018-12-02 12:21:43,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:43,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2018-12-02 12:21:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:43,698 INFO L225 Difference]: With dead ends: 6996 [2018-12-02 12:21:43,699 INFO L226 Difference]: Without dead ends: 3513 [2018-12-02 12:21:43,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2018-12-02 12:21:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3495. [2018-12-02 12:21:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3495 states. [2018-12-02 12:21:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 4727 transitions. [2018-12-02 12:21:43,762 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 4727 transitions. Word has length 319 [2018-12-02 12:21:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:43,762 INFO L480 AbstractCegarLoop]: Abstraction has 3495 states and 4727 transitions. [2018-12-02 12:21:43,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 4727 transitions. [2018-12-02 12:21:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-12-02 12:21:43,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:43,765 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:43,765 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:43,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1812240550, now seen corresponding path program 1 times [2018-12-02 12:21:43,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:43,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:43,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-02 12:21:43,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:43,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:43,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:43,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:43,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:43,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:43,948 INFO L87 Difference]: Start difference. First operand 3495 states and 4727 transitions. Second operand 6 states. [2018-12-02 12:21:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:44,087 INFO L93 Difference]: Finished difference Result 6908 states and 9379 transitions. [2018-12-02 12:21:44,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:44,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 336 [2018-12-02 12:21:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:44,096 INFO L225 Difference]: With dead ends: 6908 [2018-12-02 12:21:44,096 INFO L226 Difference]: Without dead ends: 3514 [2018-12-02 12:21:44,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2018-12-02 12:21:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3505. [2018-12-02 12:21:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2018-12-02 12:21:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 4747 transitions. [2018-12-02 12:21:44,193 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 4747 transitions. Word has length 336 [2018-12-02 12:21:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:44,193 INFO L480 AbstractCegarLoop]: Abstraction has 3505 states and 4747 transitions. [2018-12-02 12:21:44,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 4747 transitions. [2018-12-02 12:21:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-12-02 12:21:44,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:44,197 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:44,197 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:44,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash 123296808, now seen corresponding path program 1 times [2018-12-02 12:21:44,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:44,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:44,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:44,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:44,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-02 12:21:44,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:44,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:21:44,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:44,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:21:44,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:21:44,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:44,416 INFO L87 Difference]: Start difference. First operand 3505 states and 4747 transitions. Second operand 7 states. [2018-12-02 12:21:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:44,496 INFO L93 Difference]: Finished difference Result 6915 states and 9407 transitions. [2018-12-02 12:21:44,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:21:44,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 336 [2018-12-02 12:21:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:44,501 INFO L225 Difference]: With dead ends: 6915 [2018-12-02 12:21:44,502 INFO L226 Difference]: Without dead ends: 3511 [2018-12-02 12:21:44,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2018-12-02 12:21:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3505. [2018-12-02 12:21:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2018-12-02 12:21:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 4746 transitions. [2018-12-02 12:21:44,562 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 4746 transitions. Word has length 336 [2018-12-02 12:21:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:44,563 INFO L480 AbstractCegarLoop]: Abstraction has 3505 states and 4746 transitions. [2018-12-02 12:21:44,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:21:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 4746 transitions. [2018-12-02 12:21:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-12-02 12:21:44,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:44,566 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:44,566 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:44,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:44,566 INFO L82 PathProgramCache]: Analyzing trace with hash 154316615, now seen corresponding path program 1 times [2018-12-02 12:21:44,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:44,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:44,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:44,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:44,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-02 12:21:44,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:44,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:44,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:44,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:44,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:44,737 INFO L87 Difference]: Start difference. First operand 3505 states and 4746 transitions. Second operand 3 states. [2018-12-02 12:21:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:47,158 INFO L93 Difference]: Finished difference Result 6911 states and 9392 transitions. [2018-12-02 12:21:47,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:47,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2018-12-02 12:21:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:47,164 INFO L225 Difference]: With dead ends: 6911 [2018-12-02 12:21:47,164 INFO L226 Difference]: Without dead ends: 3507 [2018-12-02 12:21:47,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3507 states. [2018-12-02 12:21:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3507 to 3503. [2018-12-02 12:21:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2018-12-02 12:21:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4699 transitions. [2018-12-02 12:21:47,227 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4699 transitions. Word has length 336 [2018-12-02 12:21:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:47,228 INFO L480 AbstractCegarLoop]: Abstraction has 3503 states and 4699 transitions. [2018-12-02 12:21:47,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4699 transitions. [2018-12-02 12:21:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-12-02 12:21:47,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:47,230 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:47,230 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:47,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1023028964, now seen corresponding path program 1 times [2018-12-02 12:21:47,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:47,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:47,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:47,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:47,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-02 12:21:47,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:47,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:21:47,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:47,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:21:47,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:21:47,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:47,429 INFO L87 Difference]: Start difference. First operand 3503 states and 4699 transitions. Second operand 7 states. [2018-12-02 12:21:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:47,519 INFO L93 Difference]: Finished difference Result 6697 states and 8962 transitions. [2018-12-02 12:21:47,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:21:47,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 336 [2018-12-02 12:21:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:47,524 INFO L225 Difference]: With dead ends: 6697 [2018-12-02 12:21:47,524 INFO L226 Difference]: Without dead ends: 3295 [2018-12-02 12:21:47,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2018-12-02 12:21:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3292. [2018-12-02 12:21:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3292 states. [2018-12-02 12:21:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 4369 transitions. [2018-12-02 12:21:47,576 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 4369 transitions. Word has length 336 [2018-12-02 12:21:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:47,576 INFO L480 AbstractCegarLoop]: Abstraction has 3292 states and 4369 transitions. [2018-12-02 12:21:47,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:21:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 4369 transitions. [2018-12-02 12:21:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-12-02 12:21:47,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:47,578 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:47,578 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:47,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2090039819, now seen corresponding path program 1 times [2018-12-02 12:21:47,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:47,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:47,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:47,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:47,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:47,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:47,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:47,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:47,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:47,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:47,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:47,728 INFO L87 Difference]: Start difference. First operand 3292 states and 4369 transitions. Second operand 3 states. [2018-12-02 12:21:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:47,785 INFO L93 Difference]: Finished difference Result 6485 states and 8625 transitions. [2018-12-02 12:21:47,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:47,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2018-12-02 12:21:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:47,790 INFO L225 Difference]: With dead ends: 6485 [2018-12-02 12:21:47,790 INFO L226 Difference]: Without dead ends: 3294 [2018-12-02 12:21:47,794 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2018-12-02 12:21:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2018-12-02 12:21:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3294 states. [2018-12-02 12:21:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4371 transitions. [2018-12-02 12:21:47,848 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4371 transitions. Word has length 335 [2018-12-02 12:21:47,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:47,848 INFO L480 AbstractCegarLoop]: Abstraction has 3294 states and 4371 transitions. [2018-12-02 12:21:47,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4371 transitions. [2018-12-02 12:21:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-12-02 12:21:47,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:47,850 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:47,850 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:47,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1328908471, now seen corresponding path program 1 times [2018-12-02 12:21:47,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:47,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:47,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:47,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:47,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:48,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:48,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:48,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:48,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:48,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:48,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:48,023 INFO L87 Difference]: Start difference. First operand 3294 states and 4371 transitions. Second operand 6 states. [2018-12-02 12:21:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:48,173 INFO L93 Difference]: Finished difference Result 6495 states and 8637 transitions. [2018-12-02 12:21:48,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:48,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 335 [2018-12-02 12:21:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:48,177 INFO L225 Difference]: With dead ends: 6495 [2018-12-02 12:21:48,177 INFO L226 Difference]: Without dead ends: 3302 [2018-12-02 12:21:48,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2018-12-02 12:21:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3300. [2018-12-02 12:21:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3300 states. [2018-12-02 12:21:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4377 transitions. [2018-12-02 12:21:48,231 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4377 transitions. Word has length 335 [2018-12-02 12:21:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:48,232 INFO L480 AbstractCegarLoop]: Abstraction has 3300 states and 4377 transitions. [2018-12-02 12:21:48,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4377 transitions. [2018-12-02 12:21:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-12-02 12:21:48,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:48,233 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:48,234 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:48,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:48,234 INFO L82 PathProgramCache]: Analyzing trace with hash 515705959, now seen corresponding path program 1 times [2018-12-02 12:21:48,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:48,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:48,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:48,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:48,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:48,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:48,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:48,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:48,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:48,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:48,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:48,401 INFO L87 Difference]: Start difference. First operand 3300 states and 4377 transitions. Second operand 6 states. [2018-12-02 12:21:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:48,477 INFO L93 Difference]: Finished difference Result 6315 states and 8345 transitions. [2018-12-02 12:21:48,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:48,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2018-12-02 12:21:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:48,482 INFO L225 Difference]: With dead ends: 6315 [2018-12-02 12:21:48,482 INFO L226 Difference]: Without dead ends: 3116 [2018-12-02 12:21:48,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2018-12-02 12:21:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3114. [2018-12-02 12:21:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2018-12-02 12:21:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4083 transitions. [2018-12-02 12:21:48,536 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4083 transitions. Word has length 337 [2018-12-02 12:21:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:48,537 INFO L480 AbstractCegarLoop]: Abstraction has 3114 states and 4083 transitions. [2018-12-02 12:21:48,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4083 transitions. [2018-12-02 12:21:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-12-02 12:21:48,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:48,540 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:48,540 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:48,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:48,540 INFO L82 PathProgramCache]: Analyzing trace with hash 985154637, now seen corresponding path program 1 times [2018-12-02 12:21:48,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:48,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:48,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:48,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:48,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:48,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:48,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:48,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:48,694 INFO L87 Difference]: Start difference. First operand 3114 states and 4083 transitions. Second operand 3 states. [2018-12-02 12:21:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:48,749 INFO L93 Difference]: Finished difference Result 6129 states and 8053 transitions. [2018-12-02 12:21:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:48,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2018-12-02 12:21:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:48,753 INFO L225 Difference]: With dead ends: 6129 [2018-12-02 12:21:48,754 INFO L226 Difference]: Without dead ends: 3116 [2018-12-02 12:21:48,757 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2018-12-02 12:21:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3116. [2018-12-02 12:21:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2018-12-02 12:21:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4085 transitions. [2018-12-02 12:21:48,807 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4085 transitions. Word has length 340 [2018-12-02 12:21:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:48,807 INFO L480 AbstractCegarLoop]: Abstraction has 3116 states and 4085 transitions. [2018-12-02 12:21:48,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4085 transitions. [2018-12-02 12:21:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-12-02 12:21:48,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:48,809 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:48,809 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:48,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:48,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1418883723, now seen corresponding path program 1 times [2018-12-02 12:21:48,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:48,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:48,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:48,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:48,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:48,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:48,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:48,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:48,988 INFO L87 Difference]: Start difference. First operand 3116 states and 4085 transitions. Second operand 6 states. [2018-12-02 12:21:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:49,152 INFO L93 Difference]: Finished difference Result 6139 states and 8065 transitions. [2018-12-02 12:21:49,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:49,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 340 [2018-12-02 12:21:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:49,156 INFO L225 Difference]: With dead ends: 6139 [2018-12-02 12:21:49,156 INFO L226 Difference]: Without dead ends: 3124 [2018-12-02 12:21:49,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2018-12-02 12:21:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3122. [2018-12-02 12:21:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2018-12-02 12:21:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4091 transitions. [2018-12-02 12:21:49,211 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4091 transitions. Word has length 340 [2018-12-02 12:21:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:49,212 INFO L480 AbstractCegarLoop]: Abstraction has 3122 states and 4091 transitions. [2018-12-02 12:21:49,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4091 transitions. [2018-12-02 12:21:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-12-02 12:21:49,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:49,214 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:49,214 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:49,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1229097495, now seen corresponding path program 1 times [2018-12-02 12:21:49,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:49,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:49,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:49,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:49,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:49,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:49,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:49,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:49,379 INFO L87 Difference]: Start difference. First operand 3122 states and 4091 transitions. Second operand 6 states. [2018-12-02 12:21:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:49,448 INFO L93 Difference]: Finished difference Result 5907 states and 7752 transitions. [2018-12-02 12:21:49,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:49,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 342 [2018-12-02 12:21:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:49,452 INFO L225 Difference]: With dead ends: 5907 [2018-12-02 12:21:49,452 INFO L226 Difference]: Without dead ends: 2886 [2018-12-02 12:21:49,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2018-12-02 12:21:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2884. [2018-12-02 12:21:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2884 states. [2018-12-02 12:21:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 3776 transitions. [2018-12-02 12:21:49,495 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 3776 transitions. Word has length 342 [2018-12-02 12:21:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:49,496 INFO L480 AbstractCegarLoop]: Abstraction has 2884 states and 3776 transitions. [2018-12-02 12:21:49,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 3776 transitions. [2018-12-02 12:21:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-12-02 12:21:49,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:49,499 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:49,499 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:49,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1183140414, now seen corresponding path program 1 times [2018-12-02 12:21:49,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:49,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:49,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-02 12:21:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:21:49,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:49,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:21:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:21:49,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:49,683 INFO L87 Difference]: Start difference. First operand 2884 states and 3776 transitions. Second operand 7 states. [2018-12-02 12:21:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:49,754 INFO L93 Difference]: Finished difference Result 3807 states and 4939 transitions. [2018-12-02 12:21:49,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:21:49,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2018-12-02 12:21:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:49,759 INFO L225 Difference]: With dead ends: 3807 [2018-12-02 12:21:49,759 INFO L226 Difference]: Without dead ends: 2887 [2018-12-02 12:21:49,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-12-02 12:21:49,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2884. [2018-12-02 12:21:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2884 states. [2018-12-02 12:21:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 3775 transitions. [2018-12-02 12:21:49,805 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 3775 transitions. Word has length 372 [2018-12-02 12:21:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:49,805 INFO L480 AbstractCegarLoop]: Abstraction has 2884 states and 3775 transitions. [2018-12-02 12:21:49,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:21:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 3775 transitions. [2018-12-02 12:21:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-12-02 12:21:49,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:49,808 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:49,808 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:49,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:49,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1650964782, now seen corresponding path program 1 times [2018-12-02 12:21:49,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:49,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:49,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:49,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:49,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:49,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:49,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:49,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:49,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:49,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:49,966 INFO L87 Difference]: Start difference. First operand 2884 states and 3775 transitions. Second operand 6 states. [2018-12-02 12:21:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:50,027 INFO L93 Difference]: Finished difference Result 3791 states and 4915 transitions. [2018-12-02 12:21:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:50,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 385 [2018-12-02 12:21:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:50,031 INFO L225 Difference]: With dead ends: 3791 [2018-12-02 12:21:50,031 INFO L226 Difference]: Without dead ends: 2884 [2018-12-02 12:21:50,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2018-12-02 12:21:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2882. [2018-12-02 12:21:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2018-12-02 12:21:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 3771 transitions. [2018-12-02 12:21:50,072 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 3771 transitions. Word has length 385 [2018-12-02 12:21:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:50,072 INFO L480 AbstractCegarLoop]: Abstraction has 2882 states and 3771 transitions. [2018-12-02 12:21:50,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 3771 transitions. [2018-12-02 12:21:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-12-02 12:21:50,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:50,075 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:50,075 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:50,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash 17202358, now seen corresponding path program 1 times [2018-12-02 12:21:50,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:50,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:50,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:50,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:50,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:50,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:50,239 INFO L87 Difference]: Start difference. First operand 2882 states and 3771 transitions. Second operand 6 states. [2018-12-02 12:21:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:50,301 INFO L93 Difference]: Finished difference Result 3787 states and 4912 transitions. [2018-12-02 12:21:50,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:50,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 391 [2018-12-02 12:21:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:50,305 INFO L225 Difference]: With dead ends: 3787 [2018-12-02 12:21:50,305 INFO L226 Difference]: Without dead ends: 2882 [2018-12-02 12:21:50,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2018-12-02 12:21:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2018-12-02 12:21:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2018-12-02 12:21:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 3770 transitions. [2018-12-02 12:21:50,376 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 3770 transitions. Word has length 391 [2018-12-02 12:21:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:50,376 INFO L480 AbstractCegarLoop]: Abstraction has 2882 states and 3770 transitions. [2018-12-02 12:21:50,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 3770 transitions. [2018-12-02 12:21:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-12-02 12:21:50,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:50,380 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:50,380 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:50,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:50,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1002052894, now seen corresponding path program 1 times [2018-12-02 12:21:50,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:50,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:50,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:50,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:50,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:50,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:50,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:21:50,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:50,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:21:50,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:21:50,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:21:50,539 INFO L87 Difference]: Start difference. First operand 2882 states and 3770 transitions. Second operand 6 states. [2018-12-02 12:21:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:50,602 INFO L93 Difference]: Finished difference Result 3787 states and 4908 transitions. [2018-12-02 12:21:50,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:21:50,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 384 [2018-12-02 12:21:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:50,607 INFO L225 Difference]: With dead ends: 3787 [2018-12-02 12:21:50,607 INFO L226 Difference]: Without dead ends: 2882 [2018-12-02 12:21:50,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2018-12-02 12:21:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2880. [2018-12-02 12:21:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-12-02 12:21:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3766 transitions. [2018-12-02 12:21:50,649 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3766 transitions. Word has length 384 [2018-12-02 12:21:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:50,650 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3766 transitions. [2018-12-02 12:21:50,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:21:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3766 transitions. [2018-12-02 12:21:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-12-02 12:21:50,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:50,652 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:50,652 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:50,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash 647580974, now seen corresponding path program 1 times [2018-12-02 12:21:50,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:50,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:50,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:50,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:50,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-12-02 12:21:50,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:50,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:21:50,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:50,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:21:50,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:21:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:50,809 INFO L87 Difference]: Start difference. First operand 2880 states and 3766 transitions. Second operand 7 states. [2018-12-02 12:21:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:50,863 INFO L93 Difference]: Finished difference Result 2962 states and 3846 transitions. [2018-12-02 12:21:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:21:50,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 384 [2018-12-02 12:21:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:50,866 INFO L225 Difference]: With dead ends: 2962 [2018-12-02 12:21:50,866 INFO L226 Difference]: Without dead ends: 2046 [2018-12-02 12:21:50,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:21:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2018-12-02 12:21:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2040. [2018-12-02 12:21:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-12-02 12:21:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2676 transitions. [2018-12-02 12:21:50,897 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2676 transitions. Word has length 384 [2018-12-02 12:21:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:50,897 INFO L480 AbstractCegarLoop]: Abstraction has 2040 states and 2676 transitions. [2018-12-02 12:21:50,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:21:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2676 transitions. [2018-12-02 12:21:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-12-02 12:21:50,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:50,900 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:50,900 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:50,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash 893817404, now seen corresponding path program 1 times [2018-12-02 12:21:50,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:50,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:50,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-02 12:21:51,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:51,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:51,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:51,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:51,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:51,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:51,156 INFO L87 Difference]: Start difference. First operand 2040 states and 2676 transitions. Second operand 3 states. [2018-12-02 12:21:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:51,195 INFO L93 Difference]: Finished difference Result 3980 states and 5239 transitions. [2018-12-02 12:21:51,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:51,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 422 [2018-12-02 12:21:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:51,198 INFO L225 Difference]: With dead ends: 3980 [2018-12-02 12:21:51,198 INFO L226 Difference]: Without dead ends: 2041 [2018-12-02 12:21:51,201 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2018-12-02 12:21:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2041. [2018-12-02 12:21:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2018-12-02 12:21:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2677 transitions. [2018-12-02 12:21:51,230 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2677 transitions. Word has length 422 [2018-12-02 12:21:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:51,230 INFO L480 AbstractCegarLoop]: Abstraction has 2041 states and 2677 transitions. [2018-12-02 12:21:51,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2677 transitions. [2018-12-02 12:21:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-12-02 12:21:51,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:51,233 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:51,233 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:51,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1354149563, now seen corresponding path program 1 times [2018-12-02 12:21:51,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:51,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:51,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:51,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:51,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-12-02 12:21:51,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:51,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:21:51,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:51,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:21:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:21:51,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:21:51,436 INFO L87 Difference]: Start difference. First operand 2041 states and 2677 transitions. Second operand 3 states. [2018-12-02 12:21:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:21:51,473 INFO L93 Difference]: Finished difference Result 3982 states and 5246 transitions. [2018-12-02 12:21:51,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:21:51,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2018-12-02 12:21:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:21:51,477 INFO L225 Difference]: With dead ends: 3982 [2018-12-02 12:21:51,477 INFO L226 Difference]: Without dead ends: 2042 [2018-12-02 12:21:51,479 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:21:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2018-12-02 12:21:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2018-12-02 12:21:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2018-12-02 12:21:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2678 transitions. [2018-12-02 12:21:51,510 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2678 transitions. Word has length 441 [2018-12-02 12:21:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:21:51,510 INFO L480 AbstractCegarLoop]: Abstraction has 2042 states and 2678 transitions. [2018-12-02 12:21:51,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:21:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2678 transitions. [2018-12-02 12:21:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-12-02 12:21:51,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:21:51,513 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:21:51,513 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:21:51,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:21:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash 843006866, now seen corresponding path program 1 times [2018-12-02 12:21:51,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:21:51,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:51,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:21:51,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:21:51,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:21:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:21:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-12-02 12:21:52,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:21:52,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:21:52,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:21:52,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:21:52,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:21:52,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:21:52,032 INFO L87 Difference]: Start difference. First operand 2042 states and 2678 transitions. Second operand 5 states. [2018-12-02 12:22:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:22:12,241 INFO L93 Difference]: Finished difference Result 3994 states and 5263 transitions. [2018-12-02 12:22:12,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:22:12,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2018-12-02 12:22:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:22:12,244 INFO L225 Difference]: With dead ends: 3994 [2018-12-02 12:22:12,244 INFO L226 Difference]: Without dead ends: 2053 [2018-12-02 12:22:12,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:22:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2018-12-02 12:22:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2046. [2018-12-02 12:22:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2018-12-02 12:22:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2684 transitions. [2018-12-02 12:22:12,278 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2684 transitions. Word has length 405 [2018-12-02 12:22:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:22:12,278 INFO L480 AbstractCegarLoop]: Abstraction has 2046 states and 2684 transitions. [2018-12-02 12:22:12,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:22:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2684 transitions. [2018-12-02 12:22:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-12-02 12:22:12,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:22:12,281 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:22:12,281 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:22:12,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:22:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2040486982, now seen corresponding path program 1 times [2018-12-02 12:22:12,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:22:12,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:12,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:22:12,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:12,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:22:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:22:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-02 12:22:12,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:22:12,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:22:12,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:22:12,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:22:12,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:22:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:22:12,626 INFO L87 Difference]: Start difference. First operand 2046 states and 2684 transitions. Second operand 5 states. [2018-12-02 12:22:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:22:35,810 INFO L93 Difference]: Finished difference Result 4004 states and 5278 transitions. [2018-12-02 12:22:35,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:22:35,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 422 [2018-12-02 12:22:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:22:35,813 INFO L225 Difference]: With dead ends: 4004 [2018-12-02 12:22:35,813 INFO L226 Difference]: Without dead ends: 2059 [2018-12-02 12:22:35,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:22:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2018-12-02 12:22:35,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2050. [2018-12-02 12:22:35,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2018-12-02 12:22:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2690 transitions. [2018-12-02 12:22:35,843 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2690 transitions. Word has length 422 [2018-12-02 12:22:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:22:35,844 INFO L480 AbstractCegarLoop]: Abstraction has 2050 states and 2690 transitions. [2018-12-02 12:22:35,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:22:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2690 transitions. [2018-12-02 12:22:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-12-02 12:22:35,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:22:35,846 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:22:35,846 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:22:35,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:22:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1189178738, now seen corresponding path program 1 times [2018-12-02 12:22:35,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:22:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:35,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:22:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:35,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:22:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:22:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-12-02 12:22:36,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:22:36,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:22:36,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:22:36,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:22:36,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:22:36,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:22:36,241 INFO L87 Difference]: Start difference. First operand 2050 states and 2690 transitions. Second operand 3 states. [2018-12-02 12:22:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:22:36,280 INFO L93 Difference]: Finished difference Result 4115 states and 5451 transitions. [2018-12-02 12:22:36,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:22:36,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 405 [2018-12-02 12:22:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:22:36,284 INFO L225 Difference]: With dead ends: 4115 [2018-12-02 12:22:36,284 INFO L226 Difference]: Without dead ends: 2166 [2018-12-02 12:22:36,286 INFO L631 BasicCegarLoop]: 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 [2018-12-02 12:22:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2018-12-02 12:22:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2049. [2018-12-02 12:22:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2018-12-02 12:22:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2687 transitions. [2018-12-02 12:22:36,316 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2687 transitions. Word has length 405 [2018-12-02 12:22:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:22:36,317 INFO L480 AbstractCegarLoop]: Abstraction has 2049 states and 2687 transitions. [2018-12-02 12:22:36,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:22:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2687 transitions. [2018-12-02 12:22:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-12-02 12:22:36,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:22:36,319 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:22:36,319 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:22:36,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:22:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1170324828, now seen corresponding path program 1 times [2018-12-02 12:22:36,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:22:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:22:36,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:36,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:22:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:22:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-02 12:22:36,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:22:36,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:22:36,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:22:36,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:22:36,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:22:36,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:22:36,669 INFO L87 Difference]: Start difference. First operand 2049 states and 2687 transitions. Second operand 4 states. [2018-12-02 12:22:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:22:45,009 INFO L93 Difference]: Finished difference Result 3499 states and 4531 transitions. [2018-12-02 12:22:45,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:22:45,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 424 [2018-12-02 12:22:45,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:22:45,011 INFO L225 Difference]: With dead ends: 3499 [2018-12-02 12:22:45,012 INFO L226 Difference]: Without dead ends: 1551 [2018-12-02 12:22:45,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:22:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2018-12-02 12:22:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1550. [2018-12-02 12:22:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1550 states. [2018-12-02 12:22:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1959 transitions. [2018-12-02 12:22:45,036 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1959 transitions. Word has length 424 [2018-12-02 12:22:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:22:45,036 INFO L480 AbstractCegarLoop]: Abstraction has 1550 states and 1959 transitions. [2018-12-02 12:22:45,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:22:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1959 transitions. [2018-12-02 12:22:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-12-02 12:22:45,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:22:45,038 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:22:45,038 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:22:45,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:22:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1914179770, now seen corresponding path program 1 times [2018-12-02 12:22:45,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:22:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:22:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:45,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:22:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:22:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-12-02 12:22:45,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:22:45,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:22:45,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:22:45,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:22:45,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:22:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:22:45,396 INFO L87 Difference]: Start difference. First operand 1550 states and 1959 transitions. Second operand 4 states. [2018-12-02 12:22:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:22:50,160 INFO L93 Difference]: Finished difference Result 2511 states and 3110 transitions. [2018-12-02 12:22:50,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:22:50,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2018-12-02 12:22:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:22:50,162 INFO L225 Difference]: With dead ends: 2511 [2018-12-02 12:22:50,162 INFO L226 Difference]: Without dead ends: 1062 [2018-12-02 12:22:50,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:22:50,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-12-02 12:22:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1061. [2018-12-02 12:22:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2018-12-02 12:22:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1268 transitions. [2018-12-02 12:22:50,185 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1268 transitions. Word has length 407 [2018-12-02 12:22:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:22:50,185 INFO L480 AbstractCegarLoop]: Abstraction has 1061 states and 1268 transitions. [2018-12-02 12:22:50,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:22:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1268 transitions. [2018-12-02 12:22:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-12-02 12:22:50,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:22:50,189 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:22:50,189 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:22:50,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:22:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash -84703427, now seen corresponding path program 1 times [2018-12-02 12:22:50,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:22:50,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:50,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:22:50,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:22:50,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:22:50,237 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 12:22:50,237 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 12:22:50,237 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 12:22:50,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:22:50,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-02 12:22:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:22:50,547 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2018-12-02 12:22:50,549 INFO L205 CegarAbsIntRunner]: [59], [71], [72], [125], [128], [129], [130], [136], [137], [168], [170], [175], [177], [182], [184], [189], [191], [196], [198], [203], [205], [210], [212], [217], [219], [224], [226], [231], [233], [238], [240], [247], [254], [257], [277], [278], [283], [289], [291], [292], [451], [454], [456], [461], [462], [469], [470], [514], [517], [521], [523], [526], [629], [630], [632], [634], [639], [641], [648], [650], [658], [660], [662], [665], [666], [668], [670], [671], [672], [673], [759], [770], [773], [775], [780], [792], [793], [843], [844], [916], [917], [920], [926], [927], [928], [930], [931], [932], [933], [941], [942], [943], [944], [945], [946], [957], [958], [959], [961], [962], [965], [966], [967], [969], [973], [975], [980], [985], [987], [991], [994], [998], [1000], [1141], [1144], [1147], [1149], [1154], [1155], [1156], [1158], [1160], [1161], [1820], [1822], [1826], [1828], [1832], [1835], [1839], [1842], [1846], [1849], [1853], [1856], [1860], [1863], [1867], [1869], [1873], [1878], [1881], [1885], [1910], [1915], [1917], [1919], [1921], [1924], [1931], [1934], [1936], [1976], [1978], [1979], [1980], [1981], [1982], [1984], [1987], [1989], [1991], [1993], [1995], [1997], [1999], [2001], [2003], [2055], [2058], [2061], [2073], [2076], [2079], [2081], [2084], [2093], [2112], [2115], [2118], [2121], [2124], [2131], [2152], [2165], [2178], [2181], [2184], [2186], [2189], [2238], [2240], [2241], [2244], [2245], [2501], [2502], [2536], [2537], [2595], [2598], [2605], [2607], [2627], [2974], [2976], [2978], [2979], [2986], [2987], [2988], [2989], [2990], [2993], [3097], [3100], [3109], [3112], [3114], [3121], [3123], [3126], [3129], [3172], [3173], [3176], [3178], [3179], [3180], [3182], [3183], [3186], [3187], [3199], [3205], [3208], [3212], [3213], [3273], [3274], [3358], [3404], [3405], [3410], [3464], [3465], [3478], [3479], [3480], [3481], [3482], [3483], [3486], [3487], [3492], [3493], [3494], [3495], [3498], [3499], [3500], [3501], [3534], [3535], [3564], [3565], [3574], [3575], [3576], [3577], [3578], [3579], [3580], [3581], [3582], [3583], [3584], [3636], [3637], [3638], [3639], [3640], [3641], [3644], [3645], [3646], [3647], [3730], [3731], [3732], [3733], [3734], [3735], [3740], [3741], [3742], [3743], [3746], [3747], [3748], [3756], [3757], [3758], [3759], [3760], [3761], [3762], [3763], [3764], [3765], [3766], [3767], [3768], [3769], [3770], [3771], [3772], [3773], [3774], [3775], [3776], [3777], [3786], [3787], [3788], [3789], [3792], [3802], [3803], [3812], [3813], [3870], [3872], [3873], [3884], [3948], [3949], [3950], [3951], [3956], [3957], [3958], [3959], [3982], [3983], [3984], [3985], [3990], [3991], [3992], [4002], [4003], [4004], [4005], [4012], [4013], [4040], [4041], [4042] [2018-12-02 12:22:50,590 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:22:50,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:24:02,623 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 12:24:02,624 INFO L272 AbstractInterpreter]: Visited 300 different actions 1184 times. Merged at 26 different actions 104 times. Widened at 1 different actions 1 times. Performed 397942 root evaluator evaluations with a maximum evaluation depth of 11. Performed 397942 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 7 fixpoints after 6 different actions. Largest state had 1065 variables. [2018-12-02 12:24:02,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:24:02,631 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 12:24:06,901 INFO L227 lantSequenceWeakener]: Weakened 381 states. On average, predicates are now at 98.84% of their original sizes. [2018-12-02 12:24:06,901 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 12:24:12,609 INFO L418 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2018-12-02 12:24:12,610 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 12:24:12,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:24:12,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [120] imperfect sequences [] total 120 [2018-12-02 12:24:12,611 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:24:12,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-02 12:24:12,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-02 12:24:12,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=13664, Unknown=0, NotChecked=0, Total=14280 [2018-12-02 12:24:12,616 INFO L87 Difference]: Start difference. First operand 1061 states and 1268 transitions. Second operand 120 states. [2018-12-02 12:28:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:28:01,922 INFO L93 Difference]: Finished difference Result 2188 states and 2610 transitions. [2018-12-02 12:28:01,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-12-02 12:28:01,922 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 442 [2018-12-02 12:28:01,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:28:01,926 INFO L225 Difference]: With dead ends: 2188 [2018-12-02 12:28:01,926 INFO L226 Difference]: Without dead ends: 1228 [2018-12-02 12:28:01,933 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 537 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15469 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2163, Invalid=43847, Unknown=0, NotChecked=0, Total=46010 [2018-12-02 12:28:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-12-02 12:28:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1170. [2018-12-02 12:28:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2018-12-02 12:28:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1384 transitions. [2018-12-02 12:28:01,979 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1384 transitions. Word has length 442 [2018-12-02 12:28:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:28:01,979 INFO L480 AbstractCegarLoop]: Abstraction has 1170 states and 1384 transitions. [2018-12-02 12:28:01,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-02 12:28:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1384 transitions. [2018-12-02 12:28:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-12-02 12:28:01,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:28:01,983 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:28:01,984 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:28:01,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:28:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash -983424192, now seen corresponding path program 1 times [2018-12-02 12:28:01,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:28:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:28:01,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:28:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:28:01,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:28:02,056 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-02 12:28:02,056 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-02 12:28:02,057 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-02 12:28:02,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:28:02,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-02 12:28:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:28:02,390 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 468 with the following transitions: [2018-12-02 12:28:02,391 INFO L205 CegarAbsIntRunner]: [59], [71], [72], [125], [128], [129], [130], [136], [137], [168], [170], [175], [177], [182], [184], [189], [191], [196], [198], [203], [205], [210], [212], [217], [219], [224], [226], [231], [233], [238], [240], [247], [254], [257], [277], [278], [283], [289], [291], [292], [451], [454], [456], [461], [462], [469], [470], [514], [517], [521], [523], [527], [529], [534], [537], [541], [585], [587], [592], [594], [597], [601], [629], [630], [632], [634], [639], [641], [648], [650], [658], [660], [662], [665], [666], [668], [670], [671], [672], [673], [759], [770], [773], [775], [780], [792], [793], [843], [844], [916], [917], [920], [926], [927], [928], [930], [931], [932], [933], [941], [942], [943], [944], [945], [946], [947], [950], [955], [956], [957], [958], [959], [961], [962], [965], [966], [967], [969], [973], [975], [980], [985], [987], [991], [994], [998], [1000], [1141], [1144], [1147], [1149], [1154], [1155], [1156], [1158], [1160], [1161], [1820], [1822], [1826], [1828], [1832], [1835], [1839], [1842], [1846], [1849], [1853], [1856], [1860], [1863], [1867], [1869], [1873], [1878], [1881], [1885], [1910], [1915], [1917], [1919], [1921], [1924], [1931], [1934], [1936], [1976], [1978], [1979], [1980], [1981], [1982], [1984], [1987], [1989], [1991], [1993], [1995], [1997], [1999], [2001], [2003], [2055], [2058], [2061], [2073], [2076], [2079], [2081], [2084], [2093], [2112], [2115], [2118], [2121], [2124], [2131], [2152], [2165], [2178], [2181], [2184], [2186], [2189], [2238], [2240], [2241], [2244], [2245], [2501], [2502], [2536], [2537], [2595], [2598], [2605], [2607], [2627], [2974], [2976], [2978], [2979], [2986], [2987], [2988], [2989], [2990], [2993], [3097], [3100], [3109], [3112], [3114], [3121], [3123], [3126], [3129], [3172], [3173], [3176], [3178], [3179], [3180], [3182], [3183], [3186], [3187], [3194], [3196], [3197], [3199], [3205], [3208], [3212], [3213], [3273], [3274], [3358], [3404], [3405], [3410], [3464], [3465], [3466], [3467], [3478], [3479], [3480], [3481], [3482], [3483], [3486], [3487], [3492], [3493], [3494], [3495], [3498], [3499], [3500], [3501], [3534], [3535], [3564], [3565], [3572], [3573], [3574], [3575], [3576], [3577], [3578], [3579], [3580], [3581], [3582], [3583], [3584], [3636], [3637], [3638], [3639], [3640], [3641], [3644], [3645], [3646], [3647], [3730], [3731], [3732], [3733], [3734], [3735], [3740], [3741], [3742], [3743], [3746], [3747], [3748], [3756], [3757], [3758], [3759], [3760], [3761], [3762], [3763], [3764], [3765], [3766], [3767], [3768], [3769], [3770], [3771], [3772], [3773], [3774], [3775], [3776], [3777], [3786], [3787], [3788], [3789], [3792], [3802], [3803], [3812], [3813], [3870], [3872], [3873], [3884], [3948], [3949], [3950], [3951], [3956], [3957], [3958], [3959], [3982], [3983], [3984], [3985], [3990], [3991], [3992], [4002], [4003], [4004], [4005], [4008], [4009], [4012], [4013], [4040], [4041], [4042] [2018-12-02 12:28:02,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 12:28:02,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 12:29:26,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 12:29:26,429 INFO L272 AbstractInterpreter]: Visited 382 different actions 1343 times. Merged at 26 different actions 84 times. Never widened. Performed 473902 root evaluator evaluations with a maximum evaluation depth of 13. Performed 473902 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 5 fixpoints after 4 different actions. Largest state had 1065 variables. [2018-12-02 12:29:26,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:29:26,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 12:29:26,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:29:26,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4114aa05-8398-43af-a7cd-5c533fafb6cc/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:29:26,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:29:26,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 12:29:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-02 12:29:39,144 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-12-02 12:29:39,144 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:29:39,157 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 12:29:39,158 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 12:29:39,158 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 12:29:39,158 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 12:29:39,158 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 12:29:39,158 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 12:29:39,158 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 12:29:39,158 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-12-02 12:29:39,185 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-12-02 12:29:39,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:29:39 BoogieIcfgContainer [2018-12-02 12:29:39,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:29:39,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:29:39,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:29:39,186 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:29:39,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:21:26" (3/4) ... [2018-12-02 12:29:39,190 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 12:29:39,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:29:39,191 INFO L168 Benchmark]: Toolchain (without parser) took 634940.52 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.6 GB). Free memory was 936.1 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-02 12:29:39,192 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:29:39,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1801.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 936.1 MB in the beginning and 994.7 MB in the end (delta: -58.6 MB). Peak memory consumption was 241.3 MB. Max. memory is 11.5 GB. [2018-12-02 12:29:39,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.42 ms. Allocated memory is still 1.1 GB. Free memory was 994.7 MB in the beginning and 987.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 12:29:39,193 INFO L168 Benchmark]: Boogie Preprocessor took 134.89 ms. Allocated memory is still 1.1 GB. Free memory was 987.8 MB in the beginning and 936.0 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2018-12-02 12:29:39,193 INFO L168 Benchmark]: RCFGBuilder took 140210.57 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 936.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-02 12:29:39,194 INFO L168 Benchmark]: TraceAbstraction took 492722.34 ms. Allocated memory was 2.6 GB in the beginning and 5.6 GB in the end (delta: 3.0 GB). Free memory was 2.0 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-02 12:29:39,194 INFO L168 Benchmark]: Witness Printer took 3.96 ms. Allocated memory is still 5.6 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:29:39,196 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1801.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 936.1 MB in the beginning and 994.7 MB in the end (delta: -58.6 MB). Peak memory consumption was 241.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.42 ms. Allocated memory is still 1.1 GB. Free memory was 994.7 MB in the beginning and 987.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.89 ms. Allocated memory is still 1.1 GB. Free memory was 987.8 MB in the beginning and 936.0 MB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 140210.57 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 936.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * TraceAbstraction took 492722.34 ms. Allocated memory was 2.6 GB in the beginning and 5.6 GB in the end (delta: 3.0 GB). Free memory was 2.0 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 3.96 ms. Allocated memory is still 5.6 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 9083]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 8556, overapproximation of bitwiseOr at line 6858, overapproximation of bitwiseAnd at line 6233, overapproximation of __builtin_object_size at line 5801. Possible FailurePath: [L5612] int LDV_IN_INTERRUPT = 1; [L5613] int ldv_state_variable_2 ; [L5614] struct file *mptctl_fops_group2 ; [L5615] int ref_cnt ; [L5616] void *mptctl_fops_group1 ; [L5617] int ldv_state_variable_1 ; [L5618] struct pci_dev *mptctl_driver_group0 ; [L5619] int ldv_state_variable_0 ; [L5872-L5875] static struct mutex mpctl_mutex = {{1}, {{{{{0}}, 3735899821U, 4294967295U, (void *)-1, {0, {0, 0}, "mpctl_mutex.wait_lock", 0, 0UL}}}}, {& mpctl_mutex.wait_list, & mpctl_mutex.wait_list}, 0, (void *)(& mpctl_mutex), {0, {0, 0}, "mpctl_mutex", 0, 0UL}}; [L5876] static u8 mptctl_id = 16U; [L5877] static u8 mptctl_taskmgmt_id = 16U; [L5902] static struct fasync_struct *async_queue = (struct fasync_struct *)0; [L8373-L8375] static struct file_operations const mptctl_fops = {& __this_module, & no_llseek, 0, 0, 0, 0, 0, 0, & mptctl_ioctl, & compat_mpctl_ioctl, 0, 0, 0, 0, 0, 0, 0, & mptctl_fasync, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L8376-L8377] static struct miscdevice mptctl_miscdev = {220, "mptctl", & mptctl_fops, {0, 0}, 0, 0, 0, 0, (unsigned short)0}; [L8530] static struct mpt_pci_driver mptctl_driver = {& mptctl_probe, & mptctl_remove}; [L8588] int ldv_retval_0 ; [L8589] int ldv_retval_1 ; [L8593] int ldv_retval_2 ; [L9136] static int ldv_mutex_i_mutex_of_inode = 1; [L9280] static int ldv_mutex_lock = 1; [L9424] static int ldv_mutex_mpctl_mutex = 1; [L9568] static int ldv_mutex_mutex_of__MPT_MGMT = 1; [L9712] static int ldv_mutex_mutex_of_device = 1; [L8615] struct pci_device_id *ldvarg0 ; [L8616] void *tmp ; [L8617] unsigned long ldvarg7 ; [L8618] int ldvarg3 ; [L8619] int ldvarg5 ; [L8620] int ldvarg6 ; [L8621] unsigned long ldvarg1 ; [L8622] unsigned int ldvarg8 ; [L8623] loff_t ldvarg4 ; [L8624] unsigned int ldvarg2 ; [L8625] int tmp___0 ; [L8626] int tmp___1 ; [L8627] int tmp___2 ; [L8628] int tmp___3 ; [L8630] CALL, EXPR ldv_init_zalloc(32UL) [L5484] void *p ; [L5485] void *tmp ; [L5487] EXPR, FCALL calloc(1UL, size) [L5487] tmp = calloc(1UL, size) [L5488] p = tmp [L5490] return (p); [L8630] RET, EXPR ldv_init_zalloc(32UL) [L8630] tmp = ldv_init_zalloc(32UL) [L8631] ldvarg0 = (struct pci_device_id *)tmp [L8632] FCALL ldv_initialize() [L8633] CALL ldv_memset((void *)(& ldvarg7), 0, 8UL) [L5495] void *tmp ; [L5497] EXPR, FCALL memset(s, c, n) [L5497] tmp = memset(s, c, n) [L5498] return (tmp); [L8633] RET ldv_memset((void *)(& ldvarg7), 0, 8UL) [L8634] CALL ldv_memset((void *)(& ldvarg3), 0, 4UL) [L5495] void *tmp ; [L5497] EXPR, FCALL memset(s, c, n) [L5497] tmp = memset(s, c, n) [L5498] return (tmp); [L8634] RET ldv_memset((void *)(& ldvarg3), 0, 4UL) [L8635] CALL ldv_memset((void *)(& ldvarg5), 0, 4UL) [L5495] void *tmp ; [L5497] EXPR, FCALL memset(s, c, n) [L5497] tmp = memset(s, c, n) [L5498] return (tmp); [L8635] RET ldv_memset((void *)(& ldvarg5), 0, 4UL) [L8636] CALL ldv_memset((void *)(& ldvarg6), 0, 4UL) [L5495] void *tmp ; [L5497] EXPR, FCALL memset(s, c, n) [L5497] tmp = memset(s, c, n) [L5498] return (tmp); [L8636] RET ldv_memset((void *)(& ldvarg6), 0, 4UL) [L8637] CALL ldv_memset((void *)(& ldvarg1), 0, 8UL) [L5495] void *tmp ; [L5497] EXPR, FCALL memset(s, c, n) [L5497] tmp = memset(s, c, n) [L5498] return (tmp); [L8637] RET ldv_memset((void *)(& ldvarg1), 0, 8UL) [L8638] CALL ldv_memset((void *)(& ldvarg8), 0, 4UL) [L5495] void *tmp ; [L5497] EXPR, FCALL memset(s, c, n) [L5497] tmp = memset(s, c, n) [L5498] return (tmp); [L8638] RET ldv_memset((void *)(& ldvarg8), 0, 4UL) [L8639] CALL ldv_memset((void *)(& ldvarg4), 0, 8UL) [L5495] void *tmp ; [L5497] EXPR, FCALL memset(s, c, n) [L5497] tmp = memset(s, c, n) [L5498] return (tmp); [L8639] RET ldv_memset((void *)(& ldvarg4), 0, 8UL) [L8640] CALL ldv_memset((void *)(& ldvarg2), 0, 4UL) [L5495] void *tmp ; [L5497] EXPR, FCALL memset(s, c, n) [L5497] tmp = memset(s, c, n) [L5498] return (tmp); [L8640] RET ldv_memset((void *)(& ldvarg2), 0, 4UL) [L8641] ldv_state_variable_1 = 0 [L8642] ref_cnt = 0 [L8643] ldv_state_variable_0 = 1 [L8644] ldv_state_variable_2 = 0 [L8646] tmp___0 = __VERIFIER_nondet_int() [L8648] case 0: [L8678] case 1: [L8679] COND TRUE ldv_state_variable_0 != 0 [L8680] tmp___2 = __VERIFIER_nondet_int() [L8682] case 0: [L8690] case 1: [L8691] COND TRUE ldv_state_variable_0 == 1 [L8692] CALL, EXPR mptctl_init() [L8533] int err ; [L8534] int where ; [L8536] where = 1 [L8538] CALL mpt_device_driver_register(& mptctl_driver, 1) [L9997] return __VERIFIER_nondet_int(); [L8538] RET mpt_device_driver_register(& mptctl_driver, 1) [L8539] CALL, EXPR ldv_misc_register_32(& mptctl_miscdev) [L9036] ldv_func_ret_type___2 ldv_func_res ; [L9037] int tmp ; [L9039] CALL, EXPR misc_register(misc) [L9964] return __VERIFIER_nondet_int(); [L9039] RET, EXPR misc_register(misc) [L9039] tmp = misc_register(misc) [L9040] ldv_func_res = tmp [L9041] ldv_state_variable_2 = 1 [L9042] CALL ldv_file_operations_2() [L8596] void *tmp ; [L8598] CALL, EXPR ldv_init_zalloc(1000UL) [L5484] void *p ; [L5485] void *tmp ; [L5487] EXPR, FCALL calloc(1UL, size) [L5487] tmp = calloc(1UL, size) [L5488] p = tmp [L5490] return (p); [L8598] RET, EXPR ldv_init_zalloc(1000UL) [L8598] mptctl_fops_group1 = ldv_init_zalloc(1000UL) [L8599] CALL, EXPR ldv_init_zalloc(504UL) [L5484] void *p ; [L5485] void *tmp ; [L5487] EXPR, FCALL calloc(1UL, size) [L5487] tmp = calloc(1UL, size) [L5488] p = tmp [L5490] return (p); [L8599] RET, EXPR ldv_init_zalloc(504UL) [L8599] tmp = ldv_init_zalloc(504UL) [L8600] mptctl_fops_group2 = (struct file *)tmp [L9042] RET ldv_file_operations_2() [L9043] return (ldv_func_res); [L8539] RET, EXPR ldv_misc_register_32(& mptctl_miscdev) [L8539] err = ldv_misc_register_32(& mptctl_miscdev) [L8540] COND FALSE !(err < 0) [L8546] mptctl_miscdev.name [L8546] mptctl_miscdev.minor [L8547] where = where + 1 [L8548] CALL, EXPR mpt_register(& mptctl_reply, 1, (char *)"mptctl_reply") [L10027] return __VERIFIER_nondet_uchar(); [L8548] RET, EXPR mpt_register(& mptctl_reply, 1, (char *)"mptctl_reply") [L8548] mptctl_id = mpt_register(& mptctl_reply, 1, (char *)"mptctl_reply") [L8549] COND FALSE !((unsigned int )mptctl_id == 0U || (unsigned int )mptctl_id > 15U) [L8556] CALL, EXPR mpt_register(& mptctl_taskmgmt_reply, 1, (char *)"mptctl_taskmgmt_reply") [L10027] return __VERIFIER_nondet_uchar(); [L8556] RET, EXPR mpt_register(& mptctl_taskmgmt_reply, 1, (char *)"mptctl_taskmgmt_reply") [L8556] mptctl_taskmgmt_id = mpt_register(& mptctl_taskmgmt_reply, 1, (char *)"mptctl_taskmgmt_reply") [L8557] COND FALSE !((unsigned int )mptctl_taskmgmt_id == 0U || (unsigned int )mptctl_taskmgmt_id > 15U) [L8565] CALL mpt_reset_register((int )mptctl_id, & mptctl_ioc_reset) [L10034] return __VERIFIER_nondet_int(); [L8565] RET mpt_reset_register((int )mptctl_id, & mptctl_ioc_reset) [L8566] CALL mpt_event_register((int )mptctl_id, & mptctl_event_process) [L10004] return __VERIFIER_nondet_int(); [L8566] RET mpt_event_register((int )mptctl_id, & mptctl_event_process) [L8567] return (0); [L8692] RET, EXPR mptctl_init() [L8692] ldv_retval_1 = mptctl_init() [L8693] COND TRUE ldv_retval_1 == 0 [L8694] ldv_state_variable_0 = 3 [L8695] ldv_state_variable_1 = 1 [L8696] CALL ldv_initialize_mpt_pci_driver_1() [L8606] void *tmp ; [L8608] tmp = __VERIFIER_nondet_pointer() [L8609] mptctl_driver_group0 = (struct pci_dev *)tmp [L8696] RET ldv_initialize_mpt_pci_driver_1() [L8699] COND FALSE !(ldv_retval_1 != 0) [L8646] tmp___0 = __VERIFIER_nondet_int() [L8648] case 0: [L8678] case 1: [L8714] case 2: [L8715] COND TRUE ldv_state_variable_2 != 0 [L8716] tmp___3 = __VERIFIER_nondet_int() [L8718] case 0: [L8725] case 1: [L8737] case 2: [L8744] case 3: [L8751] case 4: [L8752] COND TRUE ldv_state_variable_2 == 1 [L8753] CALL, EXPR ldv_open_2() [L9948] return __VERIFIER_nondet_int(); [L8753] RET, EXPR ldv_open_2() [L8753] ldv_retval_2 = ldv_open_2() [L8754] COND TRUE ldv_retval_2 == 0 [L8755] ldv_state_variable_2 = 2 [L8756] ref_cnt = ref_cnt + 1 [L8646] tmp___0 = __VERIFIER_nondet_int() [L8648] case 0: [L8678] case 1: [L8714] case 2: [L8715] COND TRUE ldv_state_variable_2 != 0 [L8716] tmp___3 = __VERIFIER_nondet_int() [L8718] case 0: [L8719] COND TRUE ldv_state_variable_2 == 2 [L8720] EXPR \read(ldvarg8) [L8720] EXPR \read(ldvarg7) [L8720] CALL compat_mpctl_ioctl(mptctl_fops_group2, ldvarg8, ldvarg7) [L8475] long ret ; [L8476] int tmp ; [L8477] int tmp___0 ; [L8479] CALL ldv_mutex_lock_30(& mpctl_mutex) [L9021] CALL ldv_mutex_lock_mpctl_mutex(ldv_func_arg1) [L9462] COND FALSE !(ldv_mutex_mpctl_mutex != 1) [L9466] ldv_mutex_mpctl_mutex = 2 [L9021] RET ldv_mutex_lock_mpctl_mutex(ldv_func_arg1) [L9022] FCALL mutex_lock(ldv_func_arg1) [L8479] RET ldv_mutex_lock_30(& mpctl_mutex) [L8481] case 3227282705U: [L8482] case 3226758417U: [L8483] case 3227020561U: [L8484] case 3222564114U: [L8485] case 3222564117U: [L8486] case 3222301974U: [L8487] case 3223088407U: [L8488] case 3222039832U: [L8489] case 2154060308U: [L8490] case 2150652437U: [L8491] case 3225185555U: [L8494] case 3224923412U: [L8498] case 3222039823U: [L8499] CALL compat_mptfwxfer_ioctl(f, cmd, arg) [L8380] struct mpt_fw_xfer32 kfw32 ; [L8381] struct mpt_fw_xfer kfw ; [L8382] MPT_ADAPTER *iocp ; [L8383] int iocnum ; [L8384] int iocnumX ; [L8385] int nonblock ; [L8386] int ret ; [L8387] unsigned long tmp ; [L8389] iocp = (MPT_ADAPTER *)0 [L8390] EXPR filp->f_flags [L8390] nonblock = (int )filp->f_flags & 2048 [L8391] CALL, EXPR copy_from_user((void *)(& kfw32), (void const *)arg, 12UL) [L5797] int sz ; [L5798] unsigned long tmp ; [L5799] long tmp___0 ; [L5801] tmp = __builtin_object_size((void const *)to, 0) [L5802] sz = (int )tmp [L5803] FCALL __might_fault("./arch/x86/include/asm/uaccess.h", 697) [L5804] CALL, EXPR ldv__builtin_expect((long )(sz < 0 || (unsigned long )sz >= n), 1L) [L5535] return (exp); [L5804] RET, EXPR ldv__builtin_expect((long )(sz < 0 || (unsigned long )sz >= n), 1L) [L5804] tmp___0 = ldv__builtin_expect((long )(sz < 0 || (unsigned long )sz >= n), 1L) [L5805] COND TRUE tmp___0 != 0L [L5806] CALL, EXPR _copy_from_user(to, from, (unsigned int )n) [L9907] return __VERIFIER_nondet_ulong(); [L5806] RET, EXPR _copy_from_user(to, from, (unsigned int )n) [L5806] n = _copy_from_user(to, from, (unsigned int )n) [L5810] return (n); [L8391] RET, EXPR copy_from_user((void *)(& kfw32), (void const *)arg, 12UL) [L8391] tmp = copy_from_user((void *)(& kfw32), (void const *)arg, 12UL) [L8392] COND FALSE !(tmp != 0UL) [L8396] EXPR kfw32.iocnum [L8396] iocnumX = (int )kfw32.iocnum & 255 [L8397] CALL, EXPR mpt_verify_adapter(iocnumX, & iocp) [L10046] return __VERIFIER_nondet_int(); [L8397] RET, EXPR mpt_verify_adapter(iocnumX, & iocp) [L8397] iocnum = mpt_verify_adapter(iocnumX, & iocp) [L8398] iocnum < 0 || (unsigned long )iocp == (unsigned long )((MPT_ADAPTER *)0) [L8398] EXPR \read(*iocp) [L8398] iocnum < 0 || (unsigned long )iocp == (unsigned long )((MPT_ADAPTER *)0) [L8398] COND FALSE !(iocnum < 0 || (unsigned long )iocp == (unsigned long )((MPT_ADAPTER *)0)) [L8403] EXPR \read(*iocp) [L8403] CALL, EXPR mptctl_syscall_down(iocp, nonblock) [L5905] int rc ; [L5906] int tmp ; [L5907] int tmp___0 ; [L5909] rc = 0 [L5910] COND TRUE nonblock != 0 [L5911] CALL, EXPR ldv_mutex_trylock_12(& ioc->ioctl_cmds.mutex) [L8866] ldv_func_ret_type___0 ldv_func_res ; [L8867] int tmp ; [L8868] int tmp___0 ; [L8870] CALL, EXPR mutex_trylock(ldv_func_arg1) [L10057] return __VERIFIER_nondet_int(); [L8870] RET, EXPR mutex_trylock(ldv_func_arg1) [L8870] tmp = mutex_trylock(ldv_func_arg1) [L8871] ldv_func_res = tmp [L8872] CALL, EXPR ldv_mutex_trylock_mutex_of__MPT_MGMT(ldv_func_arg1) [L9616] int is_mutex_held_by_another_thread ; [L9618] COND FALSE !(ldv_mutex_mutex_of__MPT_MGMT != 1) [L9622] CALL, EXPR ldv_undef_int() [L5503] int tmp ; [L5505] tmp = __VERIFIER_nondet_int() [L5506] return (tmp); [L9622] RET, EXPR ldv_undef_int() [L9622] is_mutex_held_by_another_thread = ldv_undef_int() [L9623] COND FALSE !(is_mutex_held_by_another_thread != 0) [L9626] ldv_mutex_mutex_of__MPT_MGMT = 2 [L9627] return (1); [L8872] RET, EXPR ldv_mutex_trylock_mutex_of__MPT_MGMT(ldv_func_arg1) [L8872] tmp___0 = ldv_mutex_trylock_mutex_of__MPT_MGMT(ldv_func_arg1) [L8873] return (tmp___0); [L5911] RET, EXPR ldv_mutex_trylock_12(& ioc->ioctl_cmds.mutex) [L5911] tmp = ldv_mutex_trylock_12(& ioc->ioctl_cmds.mutex) [L5912] COND FALSE !(tmp == 0) [L5923] return (rc); [L8403] RET, EXPR mptctl_syscall_down(iocp, nonblock) [L8403] ret = mptctl_syscall_down(iocp, nonblock) [L8404] COND FALSE !(ret != 0) [L8408] EXPR \read(*iocp) [L8408] EXPR iocp->debug_level [L8408] COND TRUE (iocp->debug_level & 131072) != 0 [L8409] \read(*iocp) [L8412] kfw.iocnum = (unsigned int )iocnum [L8413] EXPR kfw32.fwlen [L8413] kfw.fwlen = kfw32.fwlen [L8414] EXPR kfw32.bufp [L8414] CALL, EXPR compat_ptr(kfw32.bufp) [L5788] return ((void *)((unsigned long )uptr)); [L8414] RET, EXPR compat_ptr(kfw32.bufp) [L8414] kfw.bufp = compat_ptr(kfw32.bufp) [L8415] EXPR kfw.iocnum [L8415] EXPR kfw.bufp [L8415] EXPR kfw.fwlen [L8415] CALL mptctl_do_fw_download((int )kfw.iocnum, (char *)kfw.bufp, (size_t )kfw.fwlen) [L6540] FWDownload_t *dlmsg ; [L6541] MPT_FRAME_HDR *mf ; [L6542] MPT_ADAPTER *iocp ; [L6543] FWDownloadTCSGE_t *ptsge ; [L6544] MptSge_t *sgl ; [L6545] MptSge_t *sgIn ; [L6546] char *sgOut ; [L6547] struct buflist *buflist ; [L6548] struct buflist *bl ; [L6549] dma_addr_t sgl_dma ; [L6550] int ret ; [L6551] int numfrags ; [L6552] int maxfrags ; [L6553] int n ; [L6554] u32 sgdir ; [L6555] u32 nib ; [L6556] int fw_bytes_copied ; [L6557] int i ; [L6558] int sge_offset ; [L6559] u16 iocstat ; [L6560] pFWDownloadReply_t ReplyMsg ; [L6561] unsigned long timeleft ; [L6562] int tmp ; [L6563] U8 tmp___0 ; [L6564] U8 tmp___1 ; [L6565] unsigned long tmp___2 ; [L6566] u32 tmp___3 ; [L6568] numfrags = 0 [L6569] n = 0 [L6570] fw_bytes_copied = 0 [L6571] sge_offset = 0 [L6572] ReplyMsg = (pFWDownloadReply_t )0 [L6573] CALL, EXPR mpt_verify_adapter(ioc, & iocp) [L10046] return __VERIFIER_nondet_int(); [L6573] RET, EXPR mpt_verify_adapter(ioc, & iocp) [L6573] tmp = mpt_verify_adapter(ioc, & iocp) [L6574] COND FALSE !(tmp < 0) [L6578] EXPR \read(*iocp) [L6578] CALL, EXPR mpt_get_msg_frame((int )mptctl_id, iocp) [L10014] CALL, EXPR external_alloc() [L10076] return __VERIFIER_external_alloc(); [L10014] RET, EXPR external_alloc() [L10014] return (MPT_FRAME_HDR *)external_alloc(); [L6578] RET, EXPR mpt_get_msg_frame((int )mptctl_id, iocp) [L6578] mf = mpt_get_msg_frame((int )mptctl_id, iocp) [L6579] COND FALSE !((unsigned long )mf == (unsigned long )((MPT_FRAME_HDR *)0)) [L6584] EXPR \read(*iocp) [L6584] EXPR iocp->debug_level [L6584] COND TRUE (iocp->debug_level & 131072) != 0 [L6585] \read(*iocp) [L6589] EXPR \read(*iocp) [L6589] EXPR iocp->debug_level [L6589] COND TRUE (iocp->debug_level & 131072) != 0 [L6590] \read(*iocp) [L6593] EXPR \read(*iocp) [L6593] EXPR iocp->debug_level [L6593] COND TRUE (iocp->debug_level & 131072) != 0 [L6594] \read(*iocp) [L6597] EXPR \read(*iocp) [L6597] EXPR iocp->debug_level [L6597] COND TRUE (iocp->debug_level & 131072) != 0 [L6598] \read(*iocp) [L6601] dlmsg = (FWDownload_t *)mf [L6602] ptsge = (FWDownloadTCSGE_t *)(& dlmsg->SGL) [L6603] sgOut = (char *)ptsge + 1U [L6604] dlmsg->ImageType = 1U [L6605] dlmsg->Reserved = 0U [L6606] dlmsg->ChainOffset = 0U [L6607] dlmsg->Function = 9U [L6608] tmp___1 = 0U [L6609] dlmsg->Reserved1[2] = tmp___1 [L6610] tmp___0 = tmp___1 [L6611] dlmsg->Reserved1[1] = tmp___0 [L6612] dlmsg->Reserved1[0] = tmp___0 [L6613] EXPR \read(*iocp) [L6613] EXPR iocp->facts.MsgVersion [L6613] COND TRUE (unsigned int )iocp->facts.MsgVersion > 260U [L6614] dlmsg->MsgFlags = 1U [L6618] ptsge->Reserved = 0U [L6619] ptsge->ContextSize = 0U [L6620] ptsge->DetailsLength = 12U [L6621] ptsge->Flags = 0U [L6622] ptsge->Reserved_0100_Checksum = 0U [L6623] ptsge->ImageOffset = 0U [L6624] ptsge->ImageSize = (unsigned int )fwlen [L6625] sgdir = 67108864U [L6626] sge_offset = 28 [L6628] EXPR \read(*iocp) [L6627-L6628] CALL, EXPR kbuf_alloc_2_sgl((int )fwlen, sgdir, sge_offset, & numfrags, & buflist, & sgl_dma, iocp) [L6746] MptSge_t *sglbuf ; [L6747] struct buflist *buflist ; [L6748] MptSge_t *sgl ; [L6749] int numfrags ; [L6750] int fragcnt ; [L6751] int alloc_sz ; [L6752] int _min1 ; [L6753] int _min2 ; [L6754] int bytes_allocd ; [L6755] int this_alloc ; [L6756] dma_addr_t pa ; [L6757] int i ; [L6758] int buflist_ent ; [L6759] int sg_spill ; [L6760] int dir ; [L6761] void *tmp ; [L6762] void *tmp___0 ; [L6763] int _min1___0 ; [L6764] int _min2___0 ; [L6765] void *tmp___1 ; [L6766] dma_addr_t dma_addr ; [L6767] dma_addr_t dma_addr___0 ; [L6768] u8 *kptr ; [L6769] int len ; [L6771] sglbuf = (MptSge_t *)0 [L6772] buflist = (struct buflist *)0 [L6773] numfrags = 0 [L6774] fragcnt = 0 [L6775] _min1 = bytes [L6776] _min2 = 131072 [L6777] EXPR _min1 < _min2 ? _min1 : _min2 [L6777] alloc_sz = _min1 < _min2 ? _min1 : _min2 [L6778] bytes_allocd = 0 [L6779] sg_spill = 9 [L6780] *frags = 0 [L6781] *blp = (struct buflist *)0 [L6782] i = 74 [L6783] CALL, EXPR kzalloc((size_t )i, 131280U) [L5606] void *tmp ; [L5608] CALL, EXPR kmalloc(size, flags | 32768U) [L5598] void *tmp___2 ; [L5600] CALL, EXPR __kmalloc(size, flags) [L5594] CALL, EXPR ldv_malloc(size) [L5450] void *p ; [L5451] void *tmp ; [L5452] int tmp___0 ; [L5454] tmp___0 = __VERIFIER_nondet_int() [L5455] COND TRUE tmp___0 != 0 [L5456] return ((void *)0); [L5594] RET, EXPR ldv_malloc(size) [L5594] return ldv_malloc(size); [L5600] RET, EXPR __kmalloc(size, flags) [L5600] tmp___2 = __kmalloc(size, flags) [L5601] return (tmp___2); [L5608] RET, EXPR kmalloc(size, flags | 32768U) [L5608] tmp = kmalloc(size, flags | 32768U) [L5609] return (tmp); [L6783] RET, EXPR kzalloc((size_t )i, 131280U) [L6783] tmp = kzalloc((size_t )i, 131280U) [L6784] buflist = (struct buflist *)tmp [L6785] COND FALSE !((unsigned long )buflist == (unsigned long )((struct buflist *)0)) [L6789] buflist_ent = 0 [L6790] EXPR ioc->pcidev [L6790] CALL, EXPR pci_alloc_consistent(ioc->pcidev, 592UL, sglbuf_dma) [L5733] void *tmp ; [L5735] EXPR (unsigned long )hwdev != (unsigned long )((struct pci_dev *)0) ? & hwdev->dev : (struct device *)0 [L5735-L5736] CALL, EXPR dma_alloc_attrs((unsigned long )hwdev != (unsigned long )((struct pci_dev *)0) ? & hwdev->dev : (struct device *)0, size, dma_handle, 32U, (struct dma_attrs *)0) [L9931] CALL, EXPR external_alloc() [L10076] return __VERIFIER_external_alloc(); [L9931] RET, EXPR external_alloc() [L9931] return (void *)external_alloc(); [L5735-L5736] RET, EXPR dma_alloc_attrs((unsigned long )hwdev != (unsigned long )((struct pci_dev *)0) ? & hwdev->dev : (struct device *)0, size, dma_handle, 32U, (struct dma_attrs *)0) [L5735-L5736] tmp = dma_alloc_attrs((unsigned long )hwdev != (unsigned long )((struct pci_dev *)0) ? & hwdev->dev : (struct device *)0, size, dma_handle, 32U, (struct dma_attrs *)0) [L5737] return (tmp); [L6790] RET, EXPR pci_alloc_consistent(ioc->pcidev, 592UL, sglbuf_dma) [L6790] tmp___0 = pci_alloc_consistent(ioc->pcidev, 592UL, sglbuf_dma) [L6791] sglbuf = (MptSge_t *)tmp___0 [L6792] COND FALSE !((unsigned long )sglbuf == (unsigned long )((MptSge_t *)0)) [L6796] COND TRUE (sgdir & 67108864U) != 0U [L6797] dir = 1 [L6801] sgl = sglbuf [L6802] EXPR ioc->req_sz [L6802] EXPR ioc->SGE_size [L6802] sg_spill = (ioc->req_sz - sge_offset) / (int )ioc->SGE_size + -1 [L6853] COND FALSE !(bytes_allocd < bytes) [L6858] EXPR (sgl + 0xffffffffffffffffUL)->FlagsLength [L6858] (sgl + 0xffffffffffffffffUL)->FlagsLength = (sgl + 0xffffffffffffffffUL)->FlagsLength | 3238002688U [L6859] *frags = numfrags [L6860] *blp = buflist [L6861] EXPR ioc->debug_level [L6861] COND FALSE !((ioc->debug_level & 131072) != 0) [L6866] EXPR ioc->debug_level [L6866] COND TRUE (ioc->debug_level & 131072) != 0 [L6871] return (sglbuf); [L6871] return (sglbuf); [L6627-L6628] RET, EXPR kbuf_alloc_2_sgl((int )fwlen, sgdir, sge_offset, & numfrags, & buflist, & sgl_dma, iocp) [L6627-L6628] sgl = kbuf_alloc_2_sgl((int )fwlen, sgdir, sge_offset, & numfrags, & buflist, & sgl_dma, iocp) [L6629] COND FALSE !((unsigned long )sgl == (unsigned long )((MptSge_t *)0)) [L6633] EXPR \read(*iocp) [L6633] EXPR iocp->req_sz [L6633] EXPR \read(*iocp) [L6633] EXPR iocp->SGE_size [L6633] maxfrags = (int )(((unsigned long )iocp->req_sz - 28UL) / (unsigned long )iocp->SGE_size) [L6634] EXPR \read(numfrags) [L6634] COND FALSE !(numfrags > maxfrags) [L6639] EXPR \read(*iocp) [L6639] EXPR iocp->debug_level [L6639] COND TRUE (iocp->debug_level & 131072) != 0 [L6640] \read(*iocp) [L6641] \read(numfrags) [L6644] ret = -14 [L6645] sgIn = sgl [L6646] EXPR \read(*buflist) [L6646] bl = buflist [L6647] i = 0 [L6673] EXPR \read(numfrags) [L6673] COND FALSE !(i < numfrags) [L6677] ReplyMsg = (pFWDownloadReply_t )0 [L6678] EXPR \read(*iocp) [L6678] EXPR dlmsg->MsgContext [L6678] iocp->ioctl_cmds.msg_context = dlmsg->MsgContext [L6679] EXPR \read(*iocp) [L6679] iocp->ioctl_cmds.status = 4U [L6680] EXPR \read(*iocp) [L6680] FCALL mpt_put_msg_frame((int )mptctl_id, iocp, mf) [L6682] EXPR \read(*iocp) [L6682] CALL, EXPR wait_for_completion_timeout(& iocp->ioctl_cmds.done, 15000UL) [L10072] return __VERIFIER_nondet_ulong(); [L6682] RET, EXPR wait_for_completion_timeout(& iocp->ioctl_cmds.done, 15000UL) [L6682] timeleft = wait_for_completion_timeout(& iocp->ioctl_cmds.done, 15000UL) [L6683] EXPR \read(*iocp) [L6683] EXPR iocp->ioctl_cmds.status [L6683] COND TRUE ((int )iocp->ioctl_cmds.status & 2) == 0 [L6684] ret = -62 [L6685] \read(*iocp) [L6686] EXPR \read(*iocp) [L6686] EXPR iocp->ioctl_cmds.status [L6686] COND FALSE !(((int )iocp->ioctl_cmds.status & 8) != 0) [L6691] COND TRUE timeleft == 0UL [L6692] EXPR \read(*iocp) [L6692] CALL, EXPR mpt_GetIocState(iocp, 0) [L9968] return __VERIFIER_nondet_uint(); [L6692] RET, EXPR mpt_GetIocState(iocp, 0) [L6692] tmp___3 = mpt_GetIocState(iocp, 0) [L6693] \read(*iocp) [L6695] EXPR \read(*iocp) [L6695] CALL mptctl_timeout_expired(iocp, mf) [L6206] unsigned long flags ; [L6207] int ret_val ; [L6208] SCSIIORequest_t *scsi_req ; [L6209] u8 function ; [L6210] raw_spinlock_t *tmp ; [L6212] ret_val = -1 [L6213] scsi_req = (SCSIIORequest_t *)mf [L6214] EXPR mf->u.hdr.Function [L6214] function = mf->u.hdr.Function [L6215] EXPR ioc->debug_level [L6215] COND TRUE (ioc->debug_level & 256) != 0 [L6219] COND FALSE !(mpt_fwfault_debug != 0) [L6223] CALL, EXPR spinlock_check(& ioc->taskmgmt_lock) [L5567] return (& lock->__annonCompField17.rlock); [L6223] RET, EXPR spinlock_check(& ioc->taskmgmt_lock) [L6223] tmp = spinlock_check(& ioc->taskmgmt_lock) [L6224] CALL, EXPR _raw_spin_lock_irqsave(tmp) [L9915] return __VERIFIER_nondet_ulong(); [L6224] RET, EXPR _raw_spin_lock_irqsave(tmp) [L6224] flags = _raw_spin_lock_irqsave(tmp) [L6225] EXPR ioc->ioc_reset_in_progress [L6225] COND FALSE !((unsigned int )ioc->ioc_reset_in_progress != 0U) [L6232] CALL spin_unlock_irqrestore(& ioc->taskmgmt_lock, flags) [L5573] FCALL _raw_spin_unlock_irqrestore(& lock->__annonCompField17.rlock, flags) [L6232] RET spin_unlock_irqrestore(& ioc->taskmgmt_lock, flags) [L6233] EXPR ioc->ioctl_cmds.status [L6233] ioc->ioctl_cmds.status = (unsigned int )ioc->ioctl_cmds.status & 251U [L6234] EXPR ioc->bus_type [L6234] COND TRUE (unsigned int )ioc->bus_type == 2U [L6235] COND TRUE (unsigned int )function == 0U [L6236] EXPR scsi_req->Bus [L6236] EXPR scsi_req->TargetID [L6236] CALL mptctl_do_taskmgmt(ioc, 3, (int )scsi_req->Bus, (int )scsi_req->TargetID) [L6049] MPT_FRAME_HDR *mf ; [L6050] SCSITaskMgmt_t *pScsiTm ; [L6051] SCSITaskMgmtReply_t *pScsiTmReply ; [L6052] int ii ; [L6053] int retval ; [L6054] unsigned long timeout ; [L6055] unsigned long time_count ; [L6056] u16 iocstatus ; [L6057] int tmp ; [L6058] unsigned long tmp___0 ; [L6060] CALL ldv_mutex_lock_14(& ioc->taskmgmt_cmds.mutex) [L8893] CALL ldv_mutex_lock_mutex_of__MPT_MGMT(ldv_func_arg1) [L9606] COND TRUE ldv_mutex_mutex_of__MPT_MGMT != 1 [L9607] CALL ldv_error() [L9083] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 157 procedures, 1661 locations, 1 error locations. UNKNOWN Result, 492.6s OverallTime, 38 OverallIterations, 8 TraceHistogramMax, 303.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80240 SDtfs, 18772 SDslu, 206412 SDs, 0 SdLazy, 9461 SolverSat, 1348 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 166.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 722 GetRequests, 401 SyntacticMatches, 6 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15469 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6141occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 156.1s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9978519060697999 AbsIntWeakeningRatio, 3.3378684807256236 AbsIntAvgWeakeningVarsNumRemoved, 703.718820861678 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 388 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 14.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 12700 NumberOfCodeBlocks, 12700 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 11288 ConstructedInterpolants, 0 QuantifiedInterpolants, 4147770 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 10750/10750 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...