./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i -s /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/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 c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i -s /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/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 c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:53:46,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:53:46,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:53:46,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:53:46,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:53:46,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:53:46,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:53:46,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:53:46,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:53:46,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:53:46,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:53:46,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:53:46,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:53:46,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:53:46,101 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:53:46,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:53:46,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:53:46,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:53:46,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:53:46,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:53:46,108 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:53:46,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:53:46,110 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:53:46,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:53:46,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:53:46,112 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:53:46,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:53:46,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:53:46,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:53:46,114 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:53:46,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:53:46,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:53:46,116 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:53:46,116 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:53:46,117 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:53:46,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:53:46,117 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-18 17:53:46,128 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:53:46,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:53:46,129 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:53:46,129 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:53:46,129 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:53:46,129 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:53:46,129 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:53:46,129 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:53:46,129 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:53:46,130 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:53:46,130 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-18 17:53:46,130 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:53:46,130 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:53:46,130 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:53:46,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:53:46,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:53:46,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:53:46,132 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:53:46,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:53:46,132 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:53:46,132 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:53:46,132 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:53:46,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:53:46,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:53:46,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:53:46,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:53:46,134 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-18 17:53:46,135 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_22eb686a-18db-4abb-b420-f1d1fa99da75/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 -> c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a [2018-11-18 17:53:46,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:53:46,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:53:46,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:53:46,166 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:53:46,167 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:53:46,167 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-18 17:53:46,203 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data/a5f38a0ce/dbddab1d3ea942a192c72da320045cf8/FLAG185b3f239 [2018-11-18 17:53:46,711 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:53:46,711 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-18 17:53:46,729 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data/a5f38a0ce/dbddab1d3ea942a192c72da320045cf8/FLAG185b3f239 [2018-11-18 17:53:47,185 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data/a5f38a0ce/dbddab1d3ea942a192c72da320045cf8 [2018-11-18 17:53:47,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:53:47,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:53:47,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:53:47,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:53:47,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:53:47,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:53:47" (1/1) ... [2018-11-18 17:53:47,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0a92f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:47, skipping insertion in model container [2018-11-18 17:53:47,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:53:47" (1/1) ... [2018-11-18 17:53:47,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:53:47,254 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:53:47,991 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:53:48,026 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:53:48,312 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:53:48,363 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:53:48,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48 WrapperNode [2018-11-18 17:53:48,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:53:48,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:53:48,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:53:48,364 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:53:48,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... [2018-11-18 17:53:48,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... [2018-11-18 17:53:48,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:53:48,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:53:48,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:53:48,403 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:53:48,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... [2018-11-18 17:53:48,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... [2018-11-18 17:53:48,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... [2018-11-18 17:53:48,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... [2018-11-18 17:53:48,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... [2018-11-18 17:53:48,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... [2018-11-18 17:53:48,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... [2018-11-18 17:53:48,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:53:48,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:53:48,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:53:48,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:53:48,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/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-11-18 17:53:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2018-11-18 17:53:48,571 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2018-11-18 17:53:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-18 17:53:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2018-11-18 17:53:48,571 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2018-11-18 17:53:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-18 17:53:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:53:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:53:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 17:53:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-18 17:53:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-18 17:53:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:53:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2018-11-18 17:53:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2018-11-18 17:53:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2018-11-18 17:53:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-18 17:53:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:53:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-18 17:53:48,575 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-18 17:53:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 17:53:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 17:53:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-18 17:53:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-18 17:53:48,577 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-18 17:53:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:53:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-18 17:53:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2018-11-18 17:53:48,577 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2018-11-18 17:53:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-18 17:53:48,577 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-18 17:53:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-18 17:53:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-18 17:53:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-18 17:53:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-18 17:53:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-18 17:53:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-18 17:53:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-18 17:53:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-18 17:53:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-18 17:53:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-18 17:53:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-18 17:53:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-18 17:53:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-18 17:53:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-18 17:53:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-18 17:53:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-18 17:53:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 17:53:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-18 17:53:48,584 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-18 17:53:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-18 17:53:48,585 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-18 17:53:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-18 17:53:48,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-18 17:53:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-18 17:53:48,585 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-18 17:53:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-18 17:53:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-18 17:53:48,585 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-18 17:53:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-18 17:53:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-18 17:53:48,586 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-18 17:53:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:53:48,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:53:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-18 17:53:48,586 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-18 17:53:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 17:53:48,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 17:53:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-18 17:53:48,589 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-18 17:53:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:53:48,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:53:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-18 17:53:49,130 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 17:53:49,130 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 17:53:51,905 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:53:51,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:53:51 BoogieIcfgContainer [2018-11-18 17:53:51,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:53:51,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:53:51,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:53:51,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:53:51,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:53:47" (1/3) ... [2018-11-18 17:53:51,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c188a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:53:51, skipping insertion in model container [2018-11-18 17:53:51,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:53:48" (2/3) ... [2018-11-18 17:53:51,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c188a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:53:51, skipping insertion in model container [2018-11-18 17:53:51,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:53:51" (3/3) ... [2018-11-18 17:53:51,913 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-18 17:53:51,922 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:53:51,929 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:53:51,942 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:53:51,969 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:53:51,969 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:53:51,969 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:53:51,969 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:53:51,970 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:53:51,970 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:53:51,970 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:53:51,970 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:53:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states. [2018-11-18 17:53:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:53:51,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:51,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:53:51,996 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:52,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:52,001 INFO L82 PathProgramCache]: Analyzing trace with hash -726289799, now seen corresponding path program 1 times [2018-11-18 17:53:52,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:52,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:52,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:52,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:52,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:52,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:52,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:53:52,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:52,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:53:52,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:53:52,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:53:52,404 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 3 states. [2018-11-18 17:53:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:52,586 INFO L93 Difference]: Finished difference Result 489 states and 632 transitions. [2018-11-18 17:53:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:53:52,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 17:53:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:52,600 INFO L225 Difference]: With dead ends: 489 [2018-11-18 17:53:52,600 INFO L226 Difference]: Without dead ends: 313 [2018-11-18 17:53:52,604 INFO L604 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-11-18 17:53:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-18 17:53:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2018-11-18 17:53:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-18 17:53:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 362 transitions. [2018-11-18 17:53:52,666 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 362 transitions. Word has length 23 [2018-11-18 17:53:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:52,666 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 362 transitions. [2018-11-18 17:53:52,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:53:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 362 transitions. [2018-11-18 17:53:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:53:52,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:52,667 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:53:52,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:52,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:52,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1040292026, now seen corresponding path program 1 times [2018-11-18 17:53:52,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:52,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:52,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:52,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:52,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:52,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:52,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:53:52,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:52,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:53:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:53:52,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:53:52,809 INFO L87 Difference]: Start difference. First operand 309 states and 362 transitions. Second operand 3 states. [2018-11-18 17:53:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:52,866 INFO L93 Difference]: Finished difference Result 886 states and 1055 transitions. [2018-11-18 17:53:52,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:53:52,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 17:53:52,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:52,876 INFO L225 Difference]: With dead ends: 886 [2018-11-18 17:53:52,876 INFO L226 Difference]: Without dead ends: 589 [2018-11-18 17:53:52,878 INFO L604 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-11-18 17:53:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-11-18 17:53:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 582. [2018-11-18 17:53:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-18 17:53:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 686 transitions. [2018-11-18 17:53:52,927 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 686 transitions. Word has length 24 [2018-11-18 17:53:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:52,927 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 686 transitions. [2018-11-18 17:53:52,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:53:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 686 transitions. [2018-11-18 17:53:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 17:53:52,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:52,928 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:53:52,928 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:52,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash -59450481, now seen corresponding path program 1 times [2018-11-18 17:53:52,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:52,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:52,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:53:53,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:53,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:53:53,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:53,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:53:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:53:53,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:53:53,082 INFO L87 Difference]: Start difference. First operand 582 states and 686 transitions. Second operand 3 states. [2018-11-18 17:53:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:53,301 INFO L93 Difference]: Finished difference Result 1185 states and 1415 transitions. [2018-11-18 17:53:53,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:53:53,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 17:53:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:53,304 INFO L225 Difference]: With dead ends: 1185 [2018-11-18 17:53:53,305 INFO L226 Difference]: Without dead ends: 621 [2018-11-18 17:53:53,306 INFO L604 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-11-18 17:53:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-18 17:53:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-11-18 17:53:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-18 17:53:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 736 transitions. [2018-11-18 17:53:53,352 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 736 transitions. Word has length 48 [2018-11-18 17:53:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:53,352 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 736 transitions. [2018-11-18 17:53:53,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:53:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 736 transitions. [2018-11-18 17:53:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 17:53:53,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:53,354 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:53:53,355 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:53,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash -183772311, now seen corresponding path program 1 times [2018-11-18 17:53:53,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:53,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:53,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:53,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:53,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:53,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:53,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:53:53,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:53,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:53:53,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:53:53,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:53:53,540 INFO L87 Difference]: Start difference. First operand 621 states and 736 transitions. Second operand 5 states. [2018-11-18 17:53:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:53,628 INFO L93 Difference]: Finished difference Result 939 states and 1117 transitions. [2018-11-18 17:53:53,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:53:53,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-11-18 17:53:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:53,634 INFO L225 Difference]: With dead ends: 939 [2018-11-18 17:53:53,634 INFO L226 Difference]: Without dead ends: 629 [2018-11-18 17:53:53,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:53:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-11-18 17:53:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2018-11-18 17:53:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-11-18 17:53:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 744 transitions. [2018-11-18 17:53:53,669 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 744 transitions. Word has length 83 [2018-11-18 17:53:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:53,669 INFO L480 AbstractCegarLoop]: Abstraction has 629 states and 744 transitions. [2018-11-18 17:53:53,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:53:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 744 transitions. [2018-11-18 17:53:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 17:53:53,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:53,672 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:53:53,673 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:53,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1805808040, now seen corresponding path program 1 times [2018-11-18 17:53:53,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:53,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:53,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:53,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:53,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:53,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:53,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:53:53,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:53,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:53:53,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:53:53,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:53:53,890 INFO L87 Difference]: Start difference. First operand 629 states and 744 transitions. Second operand 5 states. [2018-11-18 17:53:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:53,915 INFO L93 Difference]: Finished difference Result 1040 states and 1234 transitions. [2018-11-18 17:53:53,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:53:53,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-18 17:53:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:53,917 INFO L225 Difference]: With dead ends: 1040 [2018-11-18 17:53:53,918 INFO L226 Difference]: Without dead ends: 430 [2018-11-18 17:53:53,919 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:53:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-18 17:53:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2018-11-18 17:53:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-11-18 17:53:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 502 transitions. [2018-11-18 17:53:53,934 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 502 transitions. Word has length 89 [2018-11-18 17:53:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:53,934 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 502 transitions. [2018-11-18 17:53:53,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:53:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 502 transitions. [2018-11-18 17:53:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 17:53:53,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:53,936 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:53:53,936 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:53,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:53,936 INFO L82 PathProgramCache]: Analyzing trace with hash -271401303, now seen corresponding path program 1 times [2018-11-18 17:53:53,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:53,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:53,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:53,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:53,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:54,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:54,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:53:54,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:54,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:53:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:53:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:53:54,052 INFO L87 Difference]: Start difference. First operand 430 states and 502 transitions. Second operand 6 states. [2018-11-18 17:53:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:56,890 INFO L93 Difference]: Finished difference Result 781 states and 919 transitions. [2018-11-18 17:53:56,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:53:56,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-18 17:53:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:56,894 INFO L225 Difference]: With dead ends: 781 [2018-11-18 17:53:56,894 INFO L226 Difference]: Without dead ends: 778 [2018-11-18 17:53:56,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:53:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-18 17:53:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 748. [2018-11-18 17:53:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-11-18 17:53:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 887 transitions. [2018-11-18 17:53:56,928 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 887 transitions. Word has length 89 [2018-11-18 17:53:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:56,929 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 887 transitions. [2018-11-18 17:53:56,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:53:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 887 transitions. [2018-11-18 17:53:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 17:53:56,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:56,930 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:53:56,930 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:56,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:56,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1067052989, now seen corresponding path program 1 times [2018-11-18 17:53:56,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:56,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:56,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:56,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:56,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:57,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:57,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:53:57,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:57,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:53:57,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:53:57,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:53:57,019 INFO L87 Difference]: Start difference. First operand 748 states and 887 transitions. Second operand 6 states. [2018-11-18 17:53:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:59,094 INFO L93 Difference]: Finished difference Result 1484 states and 1775 transitions. [2018-11-18 17:53:59,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:53:59,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-18 17:53:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:59,098 INFO L225 Difference]: With dead ends: 1484 [2018-11-18 17:53:59,098 INFO L226 Difference]: Without dead ends: 746 [2018-11-18 17:53:59,100 INFO L604 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-11-18 17:53:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-18 17:53:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 725. [2018-11-18 17:53:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-18 17:53:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 871 transitions. [2018-11-18 17:53:59,132 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 871 transitions. Word has length 92 [2018-11-18 17:53:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:59,133 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 871 transitions. [2018-11-18 17:53:59,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:53:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 871 transitions. [2018-11-18 17:53:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 17:53:59,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:59,134 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:53:59,134 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:59,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:59,135 INFO L82 PathProgramCache]: Analyzing trace with hash -49644503, now seen corresponding path program 1 times [2018-11-18 17:53:59,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:59,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:59,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:59,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:59,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:59,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:53:59,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:59,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:53:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:53:59,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:53:59,229 INFO L87 Difference]: Start difference. First operand 725 states and 871 transitions. Second operand 5 states. [2018-11-18 17:53:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:59,261 INFO L93 Difference]: Finished difference Result 778 states and 931 transitions. [2018-11-18 17:53:59,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:53:59,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-18 17:53:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:59,269 INFO L225 Difference]: With dead ends: 778 [2018-11-18 17:53:59,269 INFO L226 Difference]: Without dead ends: 733 [2018-11-18 17:53:59,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:53:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-18 17:53:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2018-11-18 17:53:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-18 17:53:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 871 transitions. [2018-11-18 17:53:59,301 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 871 transitions. Word has length 102 [2018-11-18 17:53:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:59,302 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 871 transitions. [2018-11-18 17:53:59,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:53:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 871 transitions. [2018-11-18 17:53:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 17:53:59,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:59,303 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:53:59,303 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:59,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:59,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2062741269, now seen corresponding path program 1 times [2018-11-18 17:53:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:59,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:59,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:59,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:59,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:53:59,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:59,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:53:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:53:59,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:53:59,395 INFO L87 Difference]: Start difference. First operand 730 states and 871 transitions. Second operand 3 states. [2018-11-18 17:53:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:59,425 INFO L93 Difference]: Finished difference Result 1352 states and 1637 transitions. [2018-11-18 17:53:59,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:53:59,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-18 17:53:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:59,428 INFO L225 Difference]: With dead ends: 1352 [2018-11-18 17:53:59,429 INFO L226 Difference]: Without dead ends: 681 [2018-11-18 17:53:59,430 INFO L604 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-11-18 17:53:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-18 17:53:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-11-18 17:53:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-18 17:53:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 803 transitions. [2018-11-18 17:53:59,460 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 803 transitions. Word has length 103 [2018-11-18 17:53:59,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:59,460 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 803 transitions. [2018-11-18 17:53:59,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:53:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 803 transitions. [2018-11-18 17:53:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 17:53:59,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:59,461 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:53:59,462 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:59,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:59,462 INFO L82 PathProgramCache]: Analyzing trace with hash -949584166, now seen corresponding path program 1 times [2018-11-18 17:53:59,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:59,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:59,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:59,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:59,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:59,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:53:59,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:59,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:53:59,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:53:59,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:53:59,594 INFO L87 Difference]: Start difference. First operand 681 states and 803 transitions. Second operand 6 states. [2018-11-18 17:53:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:53:59,640 INFO L93 Difference]: Finished difference Result 1348 states and 1591 transitions. [2018-11-18 17:53:59,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:53:59,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-18 17:53:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:53:59,643 INFO L225 Difference]: With dead ends: 1348 [2018-11-18 17:53:59,643 INFO L226 Difference]: Without dead ends: 681 [2018-11-18 17:53:59,645 INFO L604 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-11-18 17:53:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-18 17:53:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2018-11-18 17:53:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-11-18 17:53:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 802 transitions. [2018-11-18 17:53:59,673 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 802 transitions. Word has length 105 [2018-11-18 17:53:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:53:59,673 INFO L480 AbstractCegarLoop]: Abstraction has 681 states and 802 transitions. [2018-11-18 17:53:59,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:53:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 802 transitions. [2018-11-18 17:53:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 17:53:59,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:53:59,674 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:53:59,675 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:53:59,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:53:59,675 INFO L82 PathProgramCache]: Analyzing trace with hash -978084456, now seen corresponding path program 1 times [2018-11-18 17:53:59,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:53:59,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:59,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:53:59,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:53:59,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:53:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:53:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:53:59,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:53:59,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 17:53:59,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:53:59,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 17:53:59,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:53:59,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:53:59,898 INFO L87 Difference]: Start difference. First operand 681 states and 802 transitions. Second operand 8 states. [2018-11-18 17:54:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:04,537 INFO L93 Difference]: Finished difference Result 1394 states and 1732 transitions. [2018-11-18 17:54:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 17:54:04,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-11-18 17:54:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:04,541 INFO L225 Difference]: With dead ends: 1394 [2018-11-18 17:54:04,541 INFO L226 Difference]: Without dead ends: 1030 [2018-11-18 17:54:04,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:54:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-11-18 17:54:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 832. [2018-11-18 17:54:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-11-18 17:54:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 981 transitions. [2018-11-18 17:54:04,569 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 981 transitions. Word has length 105 [2018-11-18 17:54:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:04,570 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 981 transitions. [2018-11-18 17:54:04,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 17:54:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 981 transitions. [2018-11-18 17:54:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 17:54:04,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:04,571 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:04,571 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:04,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1595997708, now seen corresponding path program 1 times [2018-11-18 17:54:04,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:54:04,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:54:04,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:54:04,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:54:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:04,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:04,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:54:04,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:54:04,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:54:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:54:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:04,669 INFO L87 Difference]: Start difference. First operand 832 states and 981 transitions. Second operand 5 states. [2018-11-18 17:54:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:04,712 INFO L93 Difference]: Finished difference Result 1269 states and 1496 transitions. [2018-11-18 17:54:04,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:54:04,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-11-18 17:54:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:04,714 INFO L225 Difference]: With dead ends: 1269 [2018-11-18 17:54:04,715 INFO L226 Difference]: Without dead ends: 477 [2018-11-18 17:54:04,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-11-18 17:54:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2018-11-18 17:54:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-18 17:54:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 552 transitions. [2018-11-18 17:54:04,738 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 552 transitions. Word has length 119 [2018-11-18 17:54:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:04,738 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 552 transitions. [2018-11-18 17:54:04,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:54:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 552 transitions. [2018-11-18 17:54:04,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 17:54:04,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:04,739 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:04,740 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:04,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:04,740 INFO L82 PathProgramCache]: Analyzing trace with hash -104742771, now seen corresponding path program 1 times [2018-11-18 17:54:04,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:54:04,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:54:04,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:04,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:54:04,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:54:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:04,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:04,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:54:04,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:54:04,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:54:04,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:54:04,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:54:04,861 INFO L87 Difference]: Start difference. First operand 477 states and 552 transitions. Second operand 6 states. [2018-11-18 17:54:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:07,311 INFO L93 Difference]: Finished difference Result 773 states and 902 transitions. [2018-11-18 17:54:07,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:54:07,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-18 17:54:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:07,315 INFO L225 Difference]: With dead ends: 773 [2018-11-18 17:54:07,316 INFO L226 Difference]: Without dead ends: 768 [2018-11-18 17:54:07,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:54:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-11-18 17:54:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 734. [2018-11-18 17:54:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-18 17:54:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 863 transitions. [2018-11-18 17:54:07,355 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 863 transitions. Word has length 119 [2018-11-18 17:54:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:07,356 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 863 transitions. [2018-11-18 17:54:07,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:54:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 863 transitions. [2018-11-18 17:54:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 17:54:07,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:07,357 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:07,357 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:07,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1682848400, now seen corresponding path program 1 times [2018-11-18 17:54:07,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:54:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:54:07,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:54:07,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:54:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:07,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:07,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:54:07,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:54:07,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:54:07,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:54:07,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:07,510 INFO L87 Difference]: Start difference. First operand 734 states and 863 transitions. Second operand 5 states. [2018-11-18 17:54:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:07,573 INFO L93 Difference]: Finished difference Result 772 states and 903 transitions. [2018-11-18 17:54:07,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:54:07,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-11-18 17:54:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:07,577 INFO L225 Difference]: With dead ends: 772 [2018-11-18 17:54:07,577 INFO L226 Difference]: Without dead ends: 755 [2018-11-18 17:54:07,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:54:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-18 17:54:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 738. [2018-11-18 17:54:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-11-18 17:54:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 866 transitions. [2018-11-18 17:54:07,611 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 866 transitions. Word has length 126 [2018-11-18 17:54:07,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:07,612 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 866 transitions. [2018-11-18 17:54:07,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:54:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 866 transitions. [2018-11-18 17:54:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 17:54:07,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:07,613 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:07,613 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:07,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash 366909141, now seen corresponding path program 1 times [2018-11-18 17:54:07,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:54:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:54:07,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:54:07,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:54:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:07,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:54:07,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:54:07,718 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-11-18 17:54:07,719 INFO L202 CegarAbsIntRunner]: [0], [3], [12], [13], [14], [16], [21], [23], [24], [35], [37], [42], [46], [52], [54], [57], [59], [64], [66], [69], [81], [83], [88], [115], [116], [117], [118], [119], [121], [122], [125], [126], [164], [168], [174], [176], [180], [184], [185], [186], [187], [189], [191], [193], [198], [203], [205], [210], [212], [217], [219], [221], [223], [225], [227], [232], [234], [244], [245], [246], [284], [289], [291], [292], [293], [294], [296], [297], [298], [299], [300], [301], [306], [317], [321], [327], [329], [333], [337], [338], [339], [343], [346], [347], [356], [357], [358], [359], [362], [363], [364], [366], [367], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [402], [403], [404], [408], [409], [410] [2018-11-18 17:54:07,753 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:54:07,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:54:07,835 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.AssumptionBuilder.constructBoogieAssumeStatement(AssumptionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.getCachedCodeBlock(TermConjunctEvaluator.java:273) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:296) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-11-18 17:54:07,838 INFO L168 Benchmark]: Toolchain (without parser) took 20649.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -201.0 MB). Peak memory consumption was 84.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:07,839 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:54:07,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1173.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 235.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:07,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:54:07,840 INFO L168 Benchmark]: Boogie Preprocessor took 105.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:07,841 INFO L168 Benchmark]: RCFGBuilder took 3397.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.9 MB). Peak memory consumption was 204.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:07,841 INFO L168 Benchmark]: TraceAbstraction took 15931.44 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 55.1 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.6 MB). Peak memory consumption was 101.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:07,844 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1173.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 235.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3397.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.9 MB). Peak memory consumption was 204.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15931.44 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 55.1 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.6 MB). Peak memory consumption was 101.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 17:54:09,358 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:54:09,360 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:54:09,368 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:54:09,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:54:09,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:54:09,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:54:09,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:54:09,372 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:54:09,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:54:09,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:54:09,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:54:09,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:54:09,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:54:09,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:54:09,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:54:09,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:54:09,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:54:09,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:54:09,381 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:54:09,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:54:09,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:54:09,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:54:09,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:54:09,386 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:54:09,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:54:09,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:54:09,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:54:09,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:54:09,390 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:54:09,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:54:09,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:54:09,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:54:09,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:54:09,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:54:09,392 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:54:09,392 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf [2018-11-18 17:54:09,402 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:54:09,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:54:09,403 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:54:09,403 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:54:09,403 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:54:09,404 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:54:09,404 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:54:09,404 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:54:09,404 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:54:09,404 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:54:09,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:54:09,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:54:09,405 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:54:09,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:54:09,405 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:54:09,405 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 17:54:09,405 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 17:54:09,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:54:09,406 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:54:09,406 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:54:09,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:54:09,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:54:09,406 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:54:09,406 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:54:09,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:54:09,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:54:09,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:54:09,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:54:09,408 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 17:54:09,408 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:54:09,408 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 17:54:09,408 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 17:54:09,409 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_22eb686a-18db-4abb-b420-f1d1fa99da75/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 -> c4ab3a1b7a928c9fbfa3f31e196dab10da7fc09a [2018-11-18 17:54:09,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:54:09,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:54:09,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:54:09,451 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:54:09,451 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:54:09,452 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-18 17:54:09,496 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data/1826d0454/1138596a261a496eb30f0bc0c0fb4f87/FLAG793ff1931 [2018-11-18 17:54:09,938 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:54:09,938 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-18 17:54:09,954 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data/1826d0454/1138596a261a496eb30f0bc0c0fb4f87/FLAG793ff1931 [2018-11-18 17:54:10,254 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/data/1826d0454/1138596a261a496eb30f0bc0c0fb4f87 [2018-11-18 17:54:10,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:54:10,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:54:10,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:54:10,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:54:10,263 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:54:10,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:54:10" (1/1) ... [2018-11-18 17:54:10,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7795264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:10, skipping insertion in model container [2018-11-18 17:54:10,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:54:10" (1/1) ... [2018-11-18 17:54:10,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:54:10,332 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:54:11,029 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:54:11,098 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:54:11,351 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:54:11,394 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:54:11,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11 WrapperNode [2018-11-18 17:54:11,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:54:11,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:54:11,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:54:11,396 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:54:11,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... [2018-11-18 17:54:11,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... [2018-11-18 17:54:11,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:54:11,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:54:11,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:54:11,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:54:11,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... [2018-11-18 17:54:11,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... [2018-11-18 17:54:11,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... [2018-11-18 17:54:11,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... [2018-11-18 17:54:11,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... [2018-11-18 17:54:11,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... [2018-11-18 17:54:11,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... [2018-11-18 17:54:11,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:54:11,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:54:11,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:54:11,500 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:54:11,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/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-11-18 17:54:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2018-11-18 17:54:11,554 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2018-11-18 17:54:11,554 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-18 17:54:11,554 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2018-11-18 17:54:11,554 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2018-11-18 17:54:11,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-18 17:54:11,554 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-18 17:54:11,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:54:11,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:54:11,555 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-18 17:54:11,555 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-18 17:54:11,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:54:11,555 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2018-11-18 17:54:11,555 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2018-11-18 17:54:11,555 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2018-11-18 17:54:11,556 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-18 17:54:11,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-18 17:54:11,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:54:11,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 17:54:11,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2018-11-18 17:54:11,556 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-18 17:54:11,556 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-18 17:54:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 17:54:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-18 17:54:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-18 17:54:11,557 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-18 17:54:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:54:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-18 17:54:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2018-11-18 17:54:11,557 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2018-11-18 17:54:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-18 17:54:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-18 17:54:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-18 17:54:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-18 17:54:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-18 17:54:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-18 17:54:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-18 17:54:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-18 17:54:11,561 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-18 17:54:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-18 17:54:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-18 17:54:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2018-11-18 17:54:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-18 17:54:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-18 17:54:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 17:54:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-18 17:54:11,562 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-18 17:54:11,563 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-18 17:54:11,563 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-18 17:54:11,563 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-18 17:54:11,563 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-18 17:54:11,563 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-18 17:54:11,563 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-18 17:54:11,563 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-18 17:54:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-18 17:54:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-18 17:54:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-18 17:54:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-18 17:54:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-18 17:54:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 17:54:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2018-11-18 17:54:11,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2018-11-18 17:54:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2018-11-18 17:54:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-18 17:54:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-18 17:54:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-18 17:54:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-18 17:54:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-18 17:54:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-18 17:54:11,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:54:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:54:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-18 17:54:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-18 17:54:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 17:54:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 17:54:11,566 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-18 17:54:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-18 17:54:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:54:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:54:11,567 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-18 17:54:11,860 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 17:54:11,860 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 17:54:14,784 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:54:14,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:54:14 BoogieIcfgContainer [2018-11-18 17:54:14,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:54:14,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:54:14,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:54:14,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:54:14,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:54:10" (1/3) ... [2018-11-18 17:54:14,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aa81ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:54:14, skipping insertion in model container [2018-11-18 17:54:14,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:54:11" (2/3) ... [2018-11-18 17:54:14,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aa81ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:54:14, skipping insertion in model container [2018-11-18 17:54:14,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:54:14" (3/3) ... [2018-11-18 17:54:14,791 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i.pp.i [2018-11-18 17:54:14,799 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:54:14,806 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:54:14,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:54:14,844 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:54:14,845 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:54:14,845 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:54:14,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:54:14,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:54:14,846 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:54:14,846 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:54:14,846 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:54:14,846 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:54:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states. [2018-11-18 17:54:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:54:14,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:14,869 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:54:14,872 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:14,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:14,877 INFO L82 PathProgramCache]: Analyzing trace with hash -513421581, now seen corresponding path program 1 times [2018-11-18 17:54:14,882 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:14,882 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:14,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:15,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:54:15,157 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:15,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:15,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:54:15,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:54:15,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:54:15,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:54:15,188 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 3 states. [2018-11-18 17:54:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:15,291 INFO L93 Difference]: Finished difference Result 489 states and 632 transitions. [2018-11-18 17:54:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:54:15,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 17:54:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:15,305 INFO L225 Difference]: With dead ends: 489 [2018-11-18 17:54:15,305 INFO L226 Difference]: Without dead ends: 313 [2018-11-18 17:54:15,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-11-18 17:54:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-18 17:54:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2018-11-18 17:54:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-18 17:54:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 362 transitions. [2018-11-18 17:54:15,368 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 362 transitions. Word has length 23 [2018-11-18 17:54:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:15,369 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 362 transitions. [2018-11-18 17:54:15,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:54:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 362 transitions. [2018-11-18 17:54:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:54:15,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:15,370 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:54:15,370 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:15,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1263662371, now seen corresponding path program 1 times [2018-11-18 17:54:15,371 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:15,371 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:15,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:15,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:54:15,559 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:15,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:15,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:54:15,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:54:15,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:54:15,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:54:15,567 INFO L87 Difference]: Start difference. First operand 309 states and 362 transitions. Second operand 3 states. [2018-11-18 17:54:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:15,610 INFO L93 Difference]: Finished difference Result 886 states and 1055 transitions. [2018-11-18 17:54:15,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:54:15,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 17:54:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:15,615 INFO L225 Difference]: With dead ends: 886 [2018-11-18 17:54:15,615 INFO L226 Difference]: Without dead ends: 589 [2018-11-18 17:54:15,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-11-18 17:54:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-11-18 17:54:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 582. [2018-11-18 17:54:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-18 17:54:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 686 transitions. [2018-11-18 17:54:15,654 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 686 transitions. Word has length 24 [2018-11-18 17:54:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:15,654 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 686 transitions. [2018-11-18 17:54:15,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:54:15,654 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 686 transitions. [2018-11-18 17:54:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 17:54:15,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:15,656 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:54:15,656 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:15,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash 652431516, now seen corresponding path program 1 times [2018-11-18 17:54:15,657 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:15,657 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:15,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:15,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:54:15,854 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:15,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:15,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:54:15,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:54:15,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:54:15,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:54:15,857 INFO L87 Difference]: Start difference. First operand 582 states and 686 transitions. Second operand 6 states. [2018-11-18 17:54:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:15,904 INFO L93 Difference]: Finished difference Result 1150 states and 1357 transitions. [2018-11-18 17:54:15,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:54:15,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-18 17:54:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:15,908 INFO L225 Difference]: With dead ends: 1150 [2018-11-18 17:54:15,908 INFO L226 Difference]: Without dead ends: 582 [2018-11-18 17:54:15,910 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-11-18 17:54:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-11-18 17:54:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2018-11-18 17:54:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-11-18 17:54:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 685 transitions. [2018-11-18 17:54:15,931 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 685 transitions. Word has length 48 [2018-11-18 17:54:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:15,931 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 685 transitions. [2018-11-18 17:54:15,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:54:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 685 transitions. [2018-11-18 17:54:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 17:54:15,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:15,932 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:54:15,933 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:15,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:15,933 INFO L82 PathProgramCache]: Analyzing trace with hash -191573986, now seen corresponding path program 1 times [2018-11-18 17:54:15,934 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:15,934 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:15,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:16,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:54:16,096 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:16,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:16,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:54:16,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:54:16,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:54:16,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:54:16,100 INFO L87 Difference]: Start difference. First operand 582 states and 685 transitions. Second operand 3 states. [2018-11-18 17:54:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:16,148 INFO L93 Difference]: Finished difference Result 1185 states and 1414 transitions. [2018-11-18 17:54:16,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:54:16,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 17:54:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:16,152 INFO L225 Difference]: With dead ends: 1185 [2018-11-18 17:54:16,152 INFO L226 Difference]: Without dead ends: 621 [2018-11-18 17:54:16,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-11-18 17:54:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-18 17:54:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-11-18 17:54:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-18 17:54:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 735 transitions. [2018-11-18 17:54:16,179 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 735 transitions. Word has length 48 [2018-11-18 17:54:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:16,179 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 735 transitions. [2018-11-18 17:54:16,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:54:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 735 transitions. [2018-11-18 17:54:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 17:54:16,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:16,181 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:16,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:16,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash 424921850, now seen corresponding path program 1 times [2018-11-18 17:54:16,182 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:16,182 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:16,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:16,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:16,612 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:16,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:16,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:54:16,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:54:16,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:54:16,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:16,616 INFO L87 Difference]: Start difference. First operand 621 states and 735 transitions. Second operand 5 states. [2018-11-18 17:54:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:16,669 INFO L93 Difference]: Finished difference Result 939 states and 1116 transitions. [2018-11-18 17:54:16,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:54:16,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-11-18 17:54:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:16,673 INFO L225 Difference]: With dead ends: 939 [2018-11-18 17:54:16,674 INFO L226 Difference]: Without dead ends: 629 [2018-11-18 17:54:16,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-11-18 17:54:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2018-11-18 17:54:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-11-18 17:54:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 743 transitions. [2018-11-18 17:54:16,692 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 743 transitions. Word has length 83 [2018-11-18 17:54:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:16,693 INFO L480 AbstractCegarLoop]: Abstraction has 629 states and 743 transitions. [2018-11-18 17:54:16,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:54:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 743 transitions. [2018-11-18 17:54:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 17:54:16,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:16,695 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:16,695 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:16,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:16,695 INFO L82 PathProgramCache]: Analyzing trace with hash 237669011, now seen corresponding path program 1 times [2018-11-18 17:54:16,696 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:16,696 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:16,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:17,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:17,142 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:17,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:17,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:54:17,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:54:17,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:54:17,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:17,146 INFO L87 Difference]: Start difference. First operand 629 states and 743 transitions. Second operand 5 states. [2018-11-18 17:54:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:17,185 INFO L93 Difference]: Finished difference Result 1040 states and 1233 transitions. [2018-11-18 17:54:17,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:54:17,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-11-18 17:54:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:17,188 INFO L225 Difference]: With dead ends: 1040 [2018-11-18 17:54:17,188 INFO L226 Difference]: Without dead ends: 430 [2018-11-18 17:54:17,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-18 17:54:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2018-11-18 17:54:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-11-18 17:54:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 501 transitions. [2018-11-18 17:54:17,199 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 501 transitions. Word has length 89 [2018-11-18 17:54:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:17,199 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 501 transitions. [2018-11-18 17:54:17,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:54:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 501 transitions. [2018-11-18 17:54:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 17:54:17,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:17,201 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:17,201 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:17,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:17,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1839540332, now seen corresponding path program 1 times [2018-11-18 17:54:17,202 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:17,202 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:17,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:17,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:17,584 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:17,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:17,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:54:17,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:54:17,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:54:17,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:54:17,587 INFO L87 Difference]: Start difference. First operand 430 states and 501 transitions. Second operand 6 states. [2018-11-18 17:54:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:24,682 INFO L93 Difference]: Finished difference Result 1316 states and 1552 transitions. [2018-11-18 17:54:24,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:54:24,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-18 17:54:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:24,686 INFO L225 Difference]: With dead ends: 1316 [2018-11-18 17:54:24,687 INFO L226 Difference]: Without dead ends: 990 [2018-11-18 17:54:24,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:54:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-11-18 17:54:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 851. [2018-11-18 17:54:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-18 17:54:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 997 transitions. [2018-11-18 17:54:24,716 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 997 transitions. Word has length 89 [2018-11-18 17:54:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:24,716 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 997 transitions. [2018-11-18 17:54:24,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:54:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 997 transitions. [2018-11-18 17:54:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 17:54:24,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:24,717 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:24,718 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:24,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:24,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2108091764, now seen corresponding path program 1 times [2018-11-18 17:54:24,719 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:24,720 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:24,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:24,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:24,964 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (9)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 17:54:24,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:24,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:54:24,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:54:24,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:54:24,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:54:24,969 INFO L87 Difference]: Start difference. First operand 851 states and 997 transitions. Second operand 6 states. [2018-11-18 17:54:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:27,090 INFO L93 Difference]: Finished difference Result 1750 states and 2059 transitions. [2018-11-18 17:54:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:54:27,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-11-18 17:54:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:27,094 INFO L225 Difference]: With dead ends: 1750 [2018-11-18 17:54:27,095 INFO L226 Difference]: Without dead ends: 908 [2018-11-18 17:54:27,097 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 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-11-18 17:54:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-11-18 17:54:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 782. [2018-11-18 17:54:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-11-18 17:54:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 914 transitions. [2018-11-18 17:54:27,132 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 914 transitions. Word has length 92 [2018-11-18 17:54:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:27,133 INFO L480 AbstractCegarLoop]: Abstraction has 782 states and 914 transitions. [2018-11-18 17:54:27,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:54:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 914 transitions. [2018-11-18 17:54:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 17:54:27,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:27,134 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:27,134 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:27,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash 392638415, now seen corresponding path program 1 times [2018-11-18 17:54:27,136 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:27,136 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:27,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:27,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:27,541 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:27,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:27,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:54:27,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:54:27,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:54:27,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:54:27,546 INFO L87 Difference]: Start difference. First operand 782 states and 914 transitions. Second operand 3 states. [2018-11-18 17:54:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:27,568 INFO L93 Difference]: Finished difference Result 1513 states and 1804 transitions. [2018-11-18 17:54:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:54:27,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-18 17:54:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:27,570 INFO L225 Difference]: With dead ends: 1513 [2018-11-18 17:54:27,571 INFO L226 Difference]: Without dead ends: 748 [2018-11-18 17:54:27,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 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-11-18 17:54:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-18 17:54:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 741. [2018-11-18 17:54:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-11-18 17:54:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 861 transitions. [2018-11-18 17:54:27,592 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 861 transitions. Word has length 102 [2018-11-18 17:54:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:27,593 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 861 transitions. [2018-11-18 17:54:27,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:54:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 861 transitions. [2018-11-18 17:54:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 17:54:27,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:27,594 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:27,594 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:27,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash -250267990, now seen corresponding path program 1 times [2018-11-18 17:54:27,594 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:27,595 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:27,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:27,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:28,023 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:28,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:28,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:54:28,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:54:28,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:54:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:28,027 INFO L87 Difference]: Start difference. First operand 741 states and 861 transitions. Second operand 5 states. [2018-11-18 17:54:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:28,070 INFO L93 Difference]: Finished difference Result 801 states and 924 transitions. [2018-11-18 17:54:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:54:28,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-18 17:54:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:28,073 INFO L225 Difference]: With dead ends: 801 [2018-11-18 17:54:28,073 INFO L226 Difference]: Without dead ends: 749 [2018-11-18 17:54:28,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-11-18 17:54:28,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 746. [2018-11-18 17:54:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-11-18 17:54:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 864 transitions. [2018-11-18 17:54:28,094 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 864 transitions. Word has length 104 [2018-11-18 17:54:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:28,094 INFO L480 AbstractCegarLoop]: Abstraction has 746 states and 864 transitions. [2018-11-18 17:54:28,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:54:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 864 transitions. [2018-11-18 17:54:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 17:54:28,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:28,096 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:28,096 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:28,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:28,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1542543291, now seen corresponding path program 1 times [2018-11-18 17:54:28,097 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:28,097 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:28,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:28,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:28,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:28,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:28,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:54:28,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:54:28,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:54:28,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:28,629 INFO L87 Difference]: Start difference. First operand 746 states and 864 transitions. Second operand 5 states. [2018-11-18 17:54:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:28,681 INFO L93 Difference]: Finished difference Result 1187 states and 1379 transitions. [2018-11-18 17:54:28,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:54:28,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-11-18 17:54:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:28,683 INFO L225 Difference]: With dead ends: 1187 [2018-11-18 17:54:28,683 INFO L226 Difference]: Without dead ends: 456 [2018-11-18 17:54:28,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-11-18 17:54:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2018-11-18 17:54:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-18 17:54:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 522 transitions. [2018-11-18 17:54:28,702 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 522 transitions. Word has length 119 [2018-11-18 17:54:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:28,702 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 522 transitions. [2018-11-18 17:54:28,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:54:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 522 transitions. [2018-11-18 17:54:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 17:54:28,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:28,703 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:28,704 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:28,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash -158197188, now seen corresponding path program 1 times [2018-11-18 17:54:28,704 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:28,705 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:28,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:29,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:29,282 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:29,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:29,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:54:29,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:54:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:54:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:54:29,285 INFO L87 Difference]: Start difference. First operand 456 states and 522 transitions. Second operand 6 states. [2018-11-18 17:54:36,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:36,180 INFO L93 Difference]: Finished difference Result 940 states and 1078 transitions. [2018-11-18 17:54:36,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:54:36,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-18 17:54:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:36,184 INFO L225 Difference]: With dead ends: 940 [2018-11-18 17:54:36,184 INFO L226 Difference]: Without dead ends: 899 [2018-11-18 17:54:36,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:54:36,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-11-18 17:54:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 772. [2018-11-18 17:54:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-11-18 17:54:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 886 transitions. [2018-11-18 17:54:36,218 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 886 transitions. Word has length 119 [2018-11-18 17:54:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:36,218 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 886 transitions. [2018-11-18 17:54:36,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:54:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 886 transitions. [2018-11-18 17:54:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 17:54:36,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:36,220 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:36,220 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:36,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:36,220 INFO L82 PathProgramCache]: Analyzing trace with hash -539096366, now seen corresponding path program 1 times [2018-11-18 17:54:36,221 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:36,221 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:36,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:36,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:36,505 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:36,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:36,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:54:36,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:54:36,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:54:36,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:54:36,508 INFO L87 Difference]: Start difference. First operand 772 states and 886 transitions. Second operand 5 states. [2018-11-18 17:54:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:36,593 INFO L93 Difference]: Finished difference Result 810 states and 926 transitions. [2018-11-18 17:54:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:54:36,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-11-18 17:54:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:36,595 INFO L225 Difference]: With dead ends: 810 [2018-11-18 17:54:36,595 INFO L226 Difference]: Without dead ends: 793 [2018-11-18 17:54:36,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:54:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-11-18 17:54:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 776. [2018-11-18 17:54:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-18 17:54:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 889 transitions. [2018-11-18 17:54:36,614 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 889 transitions. Word has length 126 [2018-11-18 17:54:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:36,615 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 889 transitions. [2018-11-18 17:54:36,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:54:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 889 transitions. [2018-11-18 17:54:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-18 17:54:36,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:36,616 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:36,616 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:36,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:36,616 INFO L82 PathProgramCache]: Analyzing trace with hash -450170399, now seen corresponding path program 1 times [2018-11-18 17:54:36,617 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:36,617 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:36,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:36,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:36,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:54:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:36,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:54:36,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:54:36,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:37,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:37,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:54:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:37,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 17:54:37,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 6 [2018-11-18 17:54:37,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:54:37,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:54:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:54:37,121 INFO L87 Difference]: Start difference. First operand 776 states and 889 transitions. Second operand 6 states. [2018-11-18 17:54:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:37,154 INFO L93 Difference]: Finished difference Result 1295 states and 1485 transitions. [2018-11-18 17:54:37,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:54:37,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-11-18 17:54:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:37,156 INFO L225 Difference]: With dead ends: 1295 [2018-11-18 17:54:37,156 INFO L226 Difference]: Without dead ends: 538 [2018-11-18 17:54:37,157 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:54:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-11-18 17:54:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-11-18 17:54:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-11-18 17:54:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 601 transitions. [2018-11-18 17:54:37,171 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 601 transitions. Word has length 131 [2018-11-18 17:54:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:37,172 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 601 transitions. [2018-11-18 17:54:37,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:54:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 601 transitions. [2018-11-18 17:54:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-18 17:54:37,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:37,173 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:37,173 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:37,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:37,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1515672982, now seen corresponding path program 1 times [2018-11-18 17:54:37,174 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:37,174 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:37,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:37,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:37,617 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:37,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:37,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:54:37,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:54:37,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:54:37,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:54:37,622 INFO L87 Difference]: Start difference. First operand 538 states and 601 transitions. Second operand 3 states. [2018-11-18 17:54:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:37,636 INFO L93 Difference]: Finished difference Result 541 states and 603 transitions. [2018-11-18 17:54:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:54:37,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-11-18 17:54:37,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:37,638 INFO L225 Difference]: With dead ends: 541 [2018-11-18 17:54:37,638 INFO L226 Difference]: Without dead ends: 200 [2018-11-18 17:54:37,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 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-11-18 17:54:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-18 17:54:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-11-18 17:54:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-18 17:54:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 215 transitions. [2018-11-18 17:54:37,648 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 215 transitions. Word has length 144 [2018-11-18 17:54:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:37,648 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 215 transitions. [2018-11-18 17:54:37,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:54:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 215 transitions. [2018-11-18 17:54:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-18 17:54:37,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:54:37,651 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:54:37,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:54:37,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:54:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1366366430, now seen corresponding path program 1 times [2018-11-18 17:54:37,652 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:54:37,652 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:54:37,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:54:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:54:37,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:54:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:54:37,927 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:54:37,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:54:37,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:54:37,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:54:37,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:54:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:54:37,930 INFO L87 Difference]: Start difference. First operand 200 states and 215 transitions. Second operand 6 states. [2018-11-18 17:54:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:54:40,028 INFO L93 Difference]: Finished difference Result 200 states and 215 transitions. [2018-11-18 17:54:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:54:40,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2018-11-18 17:54:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:54:40,028 INFO L225 Difference]: With dead ends: 200 [2018-11-18 17:54:40,029 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:54:40,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 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-11-18 17:54:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:54:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:54:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:54:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:54:40,030 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2018-11-18 17:54:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:54:40,030 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:54:40,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:54:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:54:40,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:54:40,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:54:40,753 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-11-18 17:54:41,775 INFO L425 ceAbstractionStarter]: For program point L3489(lines 3489 3493) no Hoare annotation was computed. [2018-11-18 17:54:41,775 INFO L425 ceAbstractionStarter]: For program point L3486(lines 3486 3493) no Hoare annotation was computed. [2018-11-18 17:54:41,775 INFO L425 ceAbstractionStarter]: For program point L3489-2(lines 3486 3493) no Hoare annotation was computed. [2018-11-18 17:54:41,775 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3473 3497) no Hoare annotation was computed. [2018-11-18 17:54:41,776 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3473 3497) no Hoare annotation was computed. [2018-11-18 17:54:41,776 INFO L428 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3473 3497) the Hoare annotation is: true [2018-11-18 17:54:41,776 INFO L428 ceAbstractionStarter]: At program point kbtab_initENTRY(lines 3928 3946) the Hoare annotation is: true [2018-11-18 17:54:41,776 INFO L425 ceAbstractionStarter]: For program point L3935(lines 3935 3939) no Hoare annotation was computed. [2018-11-18 17:54:41,776 INFO L425 ceAbstractionStarter]: For program point L3933-1(line 3933) no Hoare annotation was computed. [2018-11-18 17:54:41,776 INFO L428 ceAbstractionStarter]: At program point L3933(line 3933) the Hoare annotation is: true [2018-11-18 17:54:41,776 INFO L425 ceAbstractionStarter]: For program point kbtab_initFINAL(lines 3928 3946) no Hoare annotation was computed. [2018-11-18 17:54:41,776 INFO L428 ceAbstractionStarter]: At program point L3943(lines 3931 3945) the Hoare annotation is: true [2018-11-18 17:54:41,776 INFO L425 ceAbstractionStarter]: For program point kbtab_initEXIT(lines 3928 3946) no Hoare annotation was computed. [2018-11-18 17:54:41,776 INFO L421 ceAbstractionStarter]: At program point L3904(line 3904) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (not (= (_ bv1 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|))) [2018-11-18 17:54:41,776 INFO L425 ceAbstractionStarter]: For program point kbtab_disconnectFINAL(lines 3893 3909) no Hoare annotation was computed. [2018-11-18 17:54:41,776 INFO L425 ceAbstractionStarter]: For program point L3903-1(line 3903) no Hoare annotation was computed. [2018-11-18 17:54:41,776 INFO L421 ceAbstractionStarter]: At program point L3903(line 3903) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|)) (and (= (_ bv1 32) ~ldv_urb_state~0) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-18 17:54:41,776 INFO L425 ceAbstractionStarter]: For program point L3904-1(line 3904) no Hoare annotation was computed. [2018-11-18 17:54:41,777 INFO L425 ceAbstractionStarter]: For program point L3901-1(line 3901) no Hoare annotation was computed. [2018-11-18 17:54:41,777 INFO L421 ceAbstractionStarter]: At program point L3901(line 3901) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|)) (and (= (_ bv1 32) ~ldv_urb_state~0) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-18 17:54:41,777 INFO L425 ceAbstractionStarter]: For program point L3899-1(line 3899) no Hoare annotation was computed. [2018-11-18 17:54:41,777 INFO L421 ceAbstractionStarter]: At program point L3899(line 3899) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|)) (and (= (_ bv1 32) ~ldv_urb_state~0) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-18 17:54:41,777 INFO L421 ceAbstractionStarter]: At program point kbtab_disconnectENTRY(lines 3893 3909) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|)) (and (= (_ bv1 32) ~ldv_urb_state~0) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-18 17:54:41,777 INFO L425 ceAbstractionStarter]: For program point kbtab_disconnectEXIT(lines 3893 3909) no Hoare annotation was computed. [2018-11-18 17:54:41,777 INFO L425 ceAbstractionStarter]: For program point L3999(lines 3999 4003) no Hoare annotation was computed. [2018-11-18 17:54:41,777 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 3985 4076) no Hoare annotation was computed. [2018-11-18 17:54:41,777 INFO L425 ceAbstractionStarter]: For program point L4049-1(line 4049) no Hoare annotation was computed. [2018-11-18 17:54:41,777 INFO L421 ceAbstractionStarter]: At program point L4049(line 4049) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= (bvadd main_~ldv_s_kbtab_driver_usb_driver~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (_ bv0 32) ~res_kbtab_probe_3~0) (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,777 INFO L425 ceAbstractionStarter]: For program point L4033-1(line 4033) no Hoare annotation was computed. [2018-11-18 17:54:41,777 INFO L421 ceAbstractionStarter]: At program point L4033(line 4033) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= main_~ldv_s_kbtab_driver_usb_driver~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (_ bv0 32) ~res_kbtab_probe_3~0))) [2018-11-18 17:54:41,777 INFO L425 ceAbstractionStarter]: For program point L4025(lines 4025 4061) no Hoare annotation was computed. [2018-11-18 17:54:41,777 INFO L421 ceAbstractionStarter]: At program point L4063(lines 4005 4064) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| (_ bv0 32))) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,777 INFO L425 ceAbstractionStarter]: For program point L3997-1(line 3997) no Hoare annotation was computed. [2018-11-18 17:54:41,778 INFO L421 ceAbstractionStarter]: At program point L3997(line 3997) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (_ bv0 32) ~res_kbtab_probe_3~0)) (not (= |old(~res_kbtab_probe_3~0)| (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,778 INFO L421 ceAbstractionStarter]: At program point L4026(lines 4025 4061) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~res_kbtab_probe_3~0))) (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= main_~ldv_s_kbtab_driver_usb_driver~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) .cse0) (and (= (bvadd main_~ldv_s_kbtab_driver_usb_driver~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) .cse0 (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|)))) [2018-11-18 17:54:41,778 INFO L421 ceAbstractionStarter]: At program point L4059(lines 4006 4062) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~res_kbtab_probe_3~0))) (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= main_~ldv_s_kbtab_driver_usb_driver~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) .cse0) (and (= (bvadd main_~ldv_s_kbtab_driver_usb_driver~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) .cse0 (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|)))) [2018-11-18 17:54:41,778 INFO L425 ceAbstractionStarter]: For program point L4022(lines 4022 4061) no Hoare annotation was computed. [2018-11-18 17:54:41,778 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 4029 4060) no Hoare annotation was computed. [2018-11-18 17:54:41,778 INFO L425 ceAbstractionStarter]: For program point L4014(lines 4014 4018) no Hoare annotation was computed. [2018-11-18 17:54:41,778 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 3985 4076) no Hoare annotation was computed. [2018-11-18 17:54:41,778 INFO L425 ceAbstractionStarter]: For program point L4014-1(lines 4011 4018) no Hoare annotation was computed. [2018-11-18 17:54:41,778 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 4029 4060) no Hoare annotation was computed. [2018-11-18 17:54:41,778 INFO L425 ceAbstractionStarter]: For program point L4072(line 4072) no Hoare annotation was computed. [2018-11-18 17:54:41,778 INFO L421 ceAbstractionStarter]: At program point L4068(lines 3993 4075) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| (_ bv0 32))) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,778 INFO L425 ceAbstractionStarter]: For program point L4006-1(lines 4006 4062) no Hoare annotation was computed. [2018-11-18 17:54:41,778 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 3985 4076) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (_ bv0 32) ~res_kbtab_probe_3~0)) (not (= |old(~res_kbtab_probe_3~0)| (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,779 INFO L421 ceAbstractionStarter]: At program point L4023(lines 4022 4061) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~res_kbtab_probe_3~0))) (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= |old(~res_kbtab_probe_3~0)| (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= main_~ldv_s_kbtab_driver_usb_driver~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) .cse0) (and (= (bvadd main_~ldv_s_kbtab_driver_usb_driver~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) .cse0 (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|)))) [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point L4011(lines 4011 4018) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point L4007(line 4007) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point L4036(lines 4036 4040) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3415 3424) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L428 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3415 3424) the Hoare annotation is: true [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3415 3424) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point kbtab_exitFINAL(lines 3949 3958) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L428 ceAbstractionStarter]: At program point kbtab_exitENTRY(lines 3949 3958) the Hoare annotation is: true [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point kbtab_exitEXIT(lines 3949 3958) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L428 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3575 3585) the Hoare annotation is: true [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3575 3585) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3575 3585) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L428 ceAbstractionStarter]: At program point L3402(line 3402) the Hoare annotation is: true [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point kzallocEXIT(lines 3397 3406) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L425 ceAbstractionStarter]: For program point L3402-1(line 3402) no Hoare annotation was computed. [2018-11-18 17:54:41,779 INFO L428 ceAbstractionStarter]: At program point kzallocENTRY(lines 3397 3406) the Hoare annotation is: true [2018-11-18 17:54:41,780 INFO L425 ceAbstractionStarter]: For program point kzallocFINAL(lines 3397 3406) no Hoare annotation was computed. [2018-11-18 17:54:41,780 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopFINAL(lines 4087 4094) no Hoare annotation was computed. [2018-11-18 17:54:41,780 INFO L428 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4087 4094) the Hoare annotation is: true [2018-11-18 17:54:41,780 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4087 4094) no Hoare annotation was computed. [2018-11-18 17:54:41,780 INFO L428 ceAbstractionStarter]: At program point kmallocENTRY(lines 3386 3396) the Hoare annotation is: true [2018-11-18 17:54:41,780 INFO L425 ceAbstractionStarter]: For program point kmallocFINAL(lines 3386 3396) no Hoare annotation was computed. [2018-11-18 17:54:41,780 INFO L425 ceAbstractionStarter]: For program point kmallocEXIT(lines 3386 3396) no Hoare annotation was computed. [2018-11-18 17:54:41,780 INFO L421 ceAbstractionStarter]: At program point L4156(lines 4128 4161) the Hoare annotation is: (or (and (= (_ bv0 32) ~ldv_coherent_state~0) (not (= ((_ sign_extend 32) (bvadd usb_free_coherent_~addr.base usb_free_coherent_~addr.offset)) ((_ sign_extend 32) (_ bv0 32))))) (not (= (_ bv0 32) ~ldv_urb_state~0)) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|))) [2018-11-18 17:54:41,780 INFO L421 ceAbstractionStarter]: At program point usb_free_coherentENTRY(lines 4128 4161) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_urb_state~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|))) [2018-11-18 17:54:41,780 INFO L425 ceAbstractionStarter]: For program point L4134(lines 4133 4155) no Hoare annotation was computed. [2018-11-18 17:54:41,780 INFO L425 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4128 4161) no Hoare annotation was computed. [2018-11-18 17:54:41,780 INFO L425 ceAbstractionStarter]: For program point L4147-1(lines 4143 4149) no Hoare annotation was computed. [2018-11-18 17:54:41,780 INFO L421 ceAbstractionStarter]: At program point L4147(line 4147) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_urb_state~0)) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|))) [2018-11-18 17:54:41,780 INFO L425 ceAbstractionStarter]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2018-11-18 17:54:41,781 INFO L428 ceAbstractionStarter]: At program point L4137(line 4137) the Hoare annotation is: true [2018-11-18 17:54:41,781 INFO L425 ceAbstractionStarter]: For program point L4135(lines 4133 4155) no Hoare annotation was computed. [2018-11-18 17:54:41,781 INFO L425 ceAbstractionStarter]: For program point L4133-1(lines 4133 4155) no Hoare annotation was computed. [2018-11-18 17:54:41,781 INFO L421 ceAbstractionStarter]: At program point L4133loopEntry(lines 4133 4155) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_urb_state~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|))) [2018-11-18 17:54:41,781 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4099 4126) no Hoare annotation was computed. [2018-11-18 17:54:41,781 INFO L421 ceAbstractionStarter]: At program point usb_alloc_coherentENTRY(lines 4099 4126) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:54:41,781 INFO L425 ceAbstractionStarter]: For program point L4121(lines 4105 4122) no Hoare annotation was computed. [2018-11-18 17:54:41,781 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4099 4126) no Hoare annotation was computed. [2018-11-18 17:54:41,781 INFO L425 ceAbstractionStarter]: For program point L4112(lines 4112 4116) no Hoare annotation was computed. [2018-11-18 17:54:41,781 INFO L421 ceAbstractionStarter]: At program point L4106loopEntry(lines 4106 4120) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:54:41,782 INFO L425 ceAbstractionStarter]: For program point L4107(line 4107) no Hoare annotation was computed. [2018-11-18 17:54:41,782 INFO L425 ceAbstractionStarter]: For program point L4106-1(lines 4106 4120) no Hoare annotation was computed. [2018-11-18 17:54:41,782 INFO L428 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3427 3436) the Hoare annotation is: true [2018-11-18 17:54:41,782 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3427 3436) no Hoare annotation was computed. [2018-11-18 17:54:41,782 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3427 3436) no Hoare annotation was computed. [2018-11-18 17:54:41,782 INFO L425 ceAbstractionStarter]: For program point L3809-1(line 3809) no Hoare annotation was computed. [2018-11-18 17:54:41,782 INFO L421 ceAbstractionStarter]: At program point L3809(line 3809) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,782 INFO L421 ceAbstractionStarter]: At program point L3834(line 3834) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd kbtab_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,782 INFO L425 ceAbstractionStarter]: For program point L3834-1(line 3834) no Hoare annotation was computed. [2018-11-18 17:54:41,783 INFO L421 ceAbstractionStarter]: At program point L3814(line 3814) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd kbtab_probe_~error~0 (_ bv12 32)) (_ bv0 32)))) [2018-11-18 17:54:41,783 INFO L425 ceAbstractionStarter]: For program point L3814-1(line 3814) no Hoare annotation was computed. [2018-11-18 17:54:41,783 INFO L425 ceAbstractionStarter]: For program point L3868(lines 3868 3872) no Hoare annotation was computed. [2018-11-18 17:54:41,783 INFO L421 ceAbstractionStarter]: At program point L3860(line 3860) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd kbtab_probe_~error~0 (_ bv12 32)) (_ bv0 32)) (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,783 INFO L425 ceAbstractionStarter]: For program point L3860-1(line 3860) no Hoare annotation was computed. [2018-11-18 17:54:41,783 INFO L421 ceAbstractionStarter]: At program point L3885(lines 3807 3891) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= (_ bv0 32) kbtab_probe_~error~0))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,783 INFO L425 ceAbstractionStarter]: For program point L3819(lines 3819 3823) no Hoare annotation was computed. [2018-11-18 17:54:41,783 INFO L421 ceAbstractionStarter]: At program point L3848(line 3848) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd kbtab_probe_~error~0 (_ bv12 32)) (_ bv0 32)) (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,784 INFO L421 ceAbstractionStarter]: At program point L3881(lines 3807 3891) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (not (= (_ bv0 32) kbtab_probe_~error~0)))) [2018-11-18 17:54:41,784 INFO L425 ceAbstractionStarter]: For program point L3848-1(line 3848) no Hoare annotation was computed. [2018-11-18 17:54:41,784 INFO L421 ceAbstractionStarter]: At program point L3844(line 3844) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd kbtab_probe_~error~0 (_ bv12 32)) (_ bv0 32)) (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,784 INFO L425 ceAbstractionStarter]: For program point L3844-1(line 3844) no Hoare annotation was computed. [2018-11-18 17:54:41,784 INFO L425 ceAbstractionStarter]: For program point L3836(lines 3836 3840) no Hoare annotation was computed. [2018-11-18 17:54:41,784 INFO L421 ceAbstractionStarter]: At program point L3869(lines 3807 3891) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|) (not (= (_ bv0 32) kbtab_probe_~error~0))) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,784 INFO L421 ceAbstractionStarter]: At program point kbtab_probeENTRY(lines 3795 3892) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,784 INFO L425 ceAbstractionStarter]: For program point L3828(lines 3828 3832) no Hoare annotation was computed. [2018-11-18 17:54:41,784 INFO L425 ceAbstractionStarter]: For program point L3861-1(lines 3861 3862) no Hoare annotation was computed. [2018-11-18 17:54:41,785 INFO L421 ceAbstractionStarter]: At program point L3861(lines 3861 3862) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd kbtab_probe_~error~0 (_ bv12 32)) (_ bv0 32)) (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,785 INFO L425 ceAbstractionStarter]: For program point kbtab_probeFINAL(lines 3795 3892) no Hoare annotation was computed. [2018-11-18 17:54:41,785 INFO L425 ceAbstractionStarter]: For program point L3816(lines 3816 3823) no Hoare annotation was computed. [2018-11-18 17:54:41,785 INFO L421 ceAbstractionStarter]: At program point L3812(line 3812) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd kbtab_probe_~error~0 (_ bv12 32)) (_ bv0 32)))) [2018-11-18 17:54:41,785 INFO L421 ceAbstractionStarter]: At program point L3874(line 3874) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,785 INFO L425 ceAbstractionStarter]: For program point L3812-1(line 3812) no Hoare annotation was computed. [2018-11-18 17:54:41,785 INFO L425 ceAbstractionStarter]: For program point L3874-1(line 3874) no Hoare annotation was computed. [2018-11-18 17:54:41,785 INFO L425 ceAbstractionStarter]: For program point kbtab_probeEXIT(lines 3795 3892) no Hoare annotation was computed. [2018-11-18 17:54:41,785 INFO L425 ceAbstractionStarter]: For program point L3825-1(line 3825) no Hoare annotation was computed. [2018-11-18 17:54:41,786 INFO L421 ceAbstractionStarter]: At program point L3825(line 3825) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd kbtab_probe_~error~0 (_ bv12 32)) (_ bv0 32)))) [2018-11-18 17:54:41,786 INFO L421 ceAbstractionStarter]: At program point L3850(line 3850) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd kbtab_probe_~error~0 (_ bv12 32)) (_ bv0 32)) (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,786 INFO L425 ceAbstractionStarter]: For program point L3883-1(line 3883) no Hoare annotation was computed. [2018-11-18 17:54:41,786 INFO L421 ceAbstractionStarter]: At program point L3883(line 3883) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (not (= (_ bv0 32) kbtab_probe_~error~0)))) [2018-11-18 17:54:41,786 INFO L425 ceAbstractionStarter]: For program point L3850-1(line 3850) no Hoare annotation was computed. [2018-11-18 17:54:41,786 INFO L425 ceAbstractionStarter]: For program point L3879-1(line 3879) no Hoare annotation was computed. [2018-11-18 17:54:41,786 INFO L421 ceAbstractionStarter]: At program point L3879(line 3879) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd ~ldv_urb_state~0 (_ bv4294967295 32)) |old(~ldv_urb_state~0)|) (not (= (_ bv0 32) kbtab_probe_~error~0))) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:54:41,786 INFO L428 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3527 3536) the Hoare annotation is: true [2018-11-18 17:54:41,786 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3527 3536) no Hoare annotation was computed. [2018-11-18 17:54:41,787 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3527 3536) no Hoare annotation was computed. [2018-11-18 17:54:41,787 INFO L421 ceAbstractionStarter]: At program point L4210(line 4210) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) ~ldv_coherent_state~0))) [2018-11-18 17:54:41,787 INFO L425 ceAbstractionStarter]: For program point L4206(lines 4206 4212) no Hoare annotation was computed. [2018-11-18 17:54:41,787 INFO L425 ceAbstractionStarter]: For program point L4210-1(lines 4206 4212) no Hoare annotation was computed. [2018-11-18 17:54:41,787 INFO L425 ceAbstractionStarter]: For program point L4198(lines 4196 4218) no Hoare annotation was computed. [2018-11-18 17:54:41,787 INFO L425 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4191 4224) no Hoare annotation was computed. [2018-11-18 17:54:41,787 INFO L428 ceAbstractionStarter]: At program point L4200(line 4200) the Hoare annotation is: true [2018-11-18 17:54:41,787 INFO L421 ceAbstractionStarter]: At program point L4196loopEntry(lines 4196 4218) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) ~ldv_coherent_state~0)) (= (_ bv1 32) ~ldv_urb_state~0)) [2018-11-18 17:54:41,787 INFO L421 ceAbstractionStarter]: At program point usb_free_urbENTRY(lines 4191 4224) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) ~ldv_coherent_state~0)) (= (_ bv1 32) ~ldv_urb_state~0)) [2018-11-18 17:54:41,788 INFO L425 ceAbstractionStarter]: For program point L4196-1(lines 4196 4218) no Hoare annotation was computed. [2018-11-18 17:54:41,788 INFO L421 ceAbstractionStarter]: At program point L4219(lines 4191 4224) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) ~ldv_coherent_state~0)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (not (= ((_ sign_extend 32) (bvadd usb_free_urb_~urb.offset usb_free_urb_~urb.base)) ((_ sign_extend 32) (_ bv0 32)))))) [2018-11-18 17:54:41,788 INFO L425 ceAbstractionStarter]: For program point L4197(lines 4196 4218) no Hoare annotation was computed. [2018-11-18 17:54:41,788 INFO L425 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3445 3460) no Hoare annotation was computed. [2018-11-18 17:54:41,788 INFO L425 ceAbstractionStarter]: For program point L3453(lines 3453 3457) no Hoare annotation was computed. [2018-11-18 17:54:41,788 INFO L425 ceAbstractionStarter]: For program point L3453-2(lines 3453 3457) no Hoare annotation was computed. [2018-11-18 17:54:41,788 INFO L428 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3445 3460) the Hoare annotation is: true [2018-11-18 17:54:41,788 INFO L425 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3445 3460) no Hoare annotation was computed. [2018-11-18 17:54:41,788 INFO L428 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3505 3511) the Hoare annotation is: true [2018-11-18 17:54:41,788 INFO L425 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3505 3511) no Hoare annotation was computed. [2018-11-18 17:54:41,789 INFO L425 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3505 3511) no Hoare annotation was computed. [2018-11-18 17:54:41,789 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3512 3514) no Hoare annotation was computed. [2018-11-18 17:54:41,789 INFO L428 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3512 3514) the Hoare annotation is: true [2018-11-18 17:54:41,789 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3512 3514) no Hoare annotation was computed. [2018-11-18 17:54:41,789 INFO L425 ceAbstractionStarter]: For program point L3513(line 3513) no Hoare annotation was computed. [2018-11-18 17:54:41,789 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:54:41,789 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) [2018-11-18 17:54:41,789 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:54:41,789 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3437 3444) no Hoare annotation was computed. [2018-11-18 17:54:41,789 INFO L428 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3437 3444) the Hoare annotation is: true [2018-11-18 17:54:41,789 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3437 3444) no Hoare annotation was computed. [2018-11-18 17:54:41,790 INFO L428 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4226 4246) the Hoare annotation is: true [2018-11-18 17:54:41,790 INFO L421 ceAbstractionStarter]: At program point L4241(line 4241) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:54:41,790 INFO L425 ceAbstractionStarter]: For program point L4241-1(lines 4226 4246) no Hoare annotation was computed. [2018-11-18 17:54:41,790 INFO L421 ceAbstractionStarter]: At program point L4234(line 4234) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:54:41,790 INFO L425 ceAbstractionStarter]: For program point L4234-1(lines 4229 4245) no Hoare annotation was computed. [2018-11-18 17:54:41,790 INFO L425 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4226 4246) no Hoare annotation was computed. [2018-11-18 17:54:41,790 INFO L421 ceAbstractionStarter]: At program point usb_alloc_urbENTRY(lines 4163 4189) the Hoare annotation is: (or (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) ~ldv_coherent_state~0))) [2018-11-18 17:54:41,790 INFO L425 ceAbstractionStarter]: For program point L4184(lines 4168 4185) no Hoare annotation was computed. [2018-11-18 17:54:41,790 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4163 4189) no Hoare annotation was computed. [2018-11-18 17:54:41,790 INFO L425 ceAbstractionStarter]: For program point L4175(lines 4175 4179) no Hoare annotation was computed. [2018-11-18 17:54:41,790 INFO L425 ceAbstractionStarter]: For program point L4170(line 4170) no Hoare annotation was computed. [2018-11-18 17:54:41,790 INFO L425 ceAbstractionStarter]: For program point L4169-1(lines 4169 4183) no Hoare annotation was computed. [2018-11-18 17:54:41,790 INFO L421 ceAbstractionStarter]: At program point L4169loopEntry(lines 4169 4183) the Hoare annotation is: (or (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (= ~res_kbtab_probe_3~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (not (= (_ bv1 32) ~ldv_coherent_state~0))) [2018-11-18 17:54:41,791 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4163 4189) no Hoare annotation was computed. [2018-11-18 17:54:41,791 INFO L428 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3462 3471) the Hoare annotation is: true [2018-11-18 17:54:41,791 INFO L425 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3462 3471) no Hoare annotation was computed. [2018-11-18 17:54:41,791 INFO L425 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3462 3471) no Hoare annotation was computed. [2018-11-18 17:54:41,791 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:54:41,791 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (_ bv0 32) ~ldv_coherent_state~0) (= (_ bv0 32) ~res_kbtab_probe_3~0)) [2018-11-18 17:54:41,791 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:54:41,791 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:54:41,791 INFO L428 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4077 4083) the Hoare annotation is: true [2018-11-18 17:54:41,791 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4077 4083) no Hoare annotation was computed. [2018-11-18 17:54:41,791 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4077 4083) no Hoare annotation was computed. [2018-11-18 17:54:41,791 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4081) no Hoare annotation was computed. [2018-11-18 17:54:41,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:54:41 BoogieIcfgContainer [2018-11-18 17:54:41,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:54:41,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:54:41,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:54:41,810 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:54:41,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:54:14" (3/4) ... [2018-11-18 17:54:41,814 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:54:41,819 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2018-11-18 17:54:41,819 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2018-11-18 17:54:41,819 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_disconnect [2018-11-18 17:54:41,819 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:54:41,819 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2018-11-18 17:54:41,819 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2018-11-18 17:54:41,819 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_to_input_id [2018-11-18 17:54:41,819 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-11-18 17:54:41,819 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_probe [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_drvdata [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_make_path [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_allocate_device [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure interface_to_usbdev [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-18 17:54:41,820 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2018-11-18 17:54:41,821 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register [2018-11-18 17:54:41,821 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-18 17:54:41,833 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 210 nodes and edges [2018-11-18 17:54:41,833 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 97 nodes and edges [2018-11-18 17:54:41,834 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2018-11-18 17:54:41,835 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-18 17:54:41,835 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-18 17:54:41,835 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 17:54:41,836 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 17:54:41,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:54:41,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || (((ldv_urb_state == \old(ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0bv32) && \old(ldv_coherent_state) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3)) || (((~bvadd16(ldv_s_kbtab_driver_usb_driver, 4294967295bv32) == 0bv32 && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3) && ~bvadd16(ldv_urb_state, 4294967295bv32) == \old(ldv_urb_state)) [2018-11-18 17:54:41,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:54:41,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0bv32 == ldv_coherent_state && !(~sign_extendFrom16To32(~bvadd16(addr, addr)) == ~sign_extendFrom16To32(0bv32))) || !(0bv32 == ldv_urb_state)) || !(1bv32 == \old(ldv_coherent_state)) [2018-11-18 17:54:41,854 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(res_kbtab_probe_3 == 0bv32) || !(1bv32 == \old(ldv_urb_state))) || !(1bv32 == ldv_coherent_state)) || (ldv_urb_state == 0bv32 && !(~sign_extendFrom16To32(~bvadd16(urb, urb)) == ~sign_extendFrom16To32(0bv32))) [2018-11-18 17:54:41,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || (((ldv_urb_state == \old(ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0bv32) && \old(ldv_coherent_state) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3)) || (((~bvadd16(ldv_s_kbtab_driver_usb_driver, 4294967295bv32) == 0bv32 && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3) && ~bvadd16(ldv_urb_state, 4294967295bv32) == \old(ldv_urb_state)) [2018-11-18 17:54:41,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == \old(ldv_coherent_state)) || !(res_kbtab_probe_3 == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == \old(ldv_urb_state) && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && !(0bv32 == error)) [2018-11-18 17:54:41,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || (((ldv_urb_state == \old(ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0bv32) && \old(ldv_coherent_state) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3)) || (((~bvadd16(ldv_s_kbtab_driver_usb_driver, 4294967295bv32) == 0bv32 && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3) && ~bvadd16(ldv_urb_state, 4294967295bv32) == \old(ldv_urb_state)) [2018-11-18 17:54:41,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == \old(ldv_coherent_state)) || !(res_kbtab_probe_3 == 0bv32)) || ((ldv_urb_state == \old(ldv_urb_state) && \old(ldv_coherent_state) == ldv_coherent_state) && !(0bv32 == error))) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:54:41,855 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == ldv_urb_state) || \old(ldv_coherent_state) == ldv_coherent_state) || !(1bv32 == \old(ldv_coherent_state)) [2018-11-18 17:54:41,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(res_kbtab_probe_3 == 0bv32) || !(1bv32 == \old(ldv_urb_state))) || !(1bv32 == ldv_coherent_state)) || 1bv32 == ldv_urb_state [2018-11-18 17:54:41,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == \old(ldv_coherent_state)) || \old(ldv_coherent_state) == ldv_coherent_state) || !(res_kbtab_probe_3 == 0bv32)) || !(0bv32 == ldv_urb_state) [2018-11-18 17:54:41,856 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == \old(ldv_urb_state) || !(res_kbtab_probe_3 == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || !(1bv32 == ldv_coherent_state) [2018-11-18 17:54:41,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0bv32 == \old(ldv_coherent_state)) || ((~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state && ~bvadd16(ldv_urb_state, 4294967295bv32) == \old(ldv_urb_state)) && !(0bv32 == error))) || !(res_kbtab_probe_3 == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:54:41,898 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_22eb686a-18db-4abb-b420-f1d1fa99da75/bin-2019/utaipan/witness.graphml [2018-11-18 17:54:41,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:54:41,899 INFO L168 Benchmark]: Toolchain (without parser) took 31641.58 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 659.6 MB). Free memory was 944.4 MB in the beginning and 842.1 MB in the end (delta: 102.3 MB). Peak memory consumption was 761.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:41,899 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:54:41,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1135.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 243.8 MB). Free memory was 944.4 MB in the beginning and 969.7 MB in the end (delta: -25.3 MB). Peak memory consumption was 238.1 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:41,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.19 ms. Allocated memory is still 1.3 GB. Free memory is still 969.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:54:41,900 INFO L168 Benchmark]: Boogie Preprocessor took 70.74 ms. Allocated memory is still 1.3 GB. Free memory was 969.7 MB in the beginning and 955.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:41,900 INFO L168 Benchmark]: RCFGBuilder took 3284.81 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 90.2 MB). Free memory was 955.2 MB in the beginning and 1.3 GB in the end (delta: -301.8 MB). Peak memory consumption was 228.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:41,900 INFO L168 Benchmark]: TraceAbstraction took 27024.54 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 325.6 MB). Free memory was 1.3 GB in the beginning and 859.5 MB in the end (delta: 397.4 MB). Peak memory consumption was 723.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:41,901 INFO L168 Benchmark]: Witness Printer took 88.42 ms. Allocated memory is still 1.7 GB. Free memory was 859.5 MB in the beginning and 842.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:54:41,902 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1135.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 243.8 MB). Free memory was 944.4 MB in the beginning and 969.7 MB in the end (delta: -25.3 MB). Peak memory consumption was 238.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.19 ms. Allocated memory is still 1.3 GB. Free memory is still 969.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.74 ms. Allocated memory is still 1.3 GB. Free memory was 969.7 MB in the beginning and 955.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3284.81 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 90.2 MB). Free memory was 955.2 MB in the beginning and 1.3 GB in the end (delta: -301.8 MB). Peak memory consumption was 228.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27024.54 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 325.6 MB). Free memory was 1.3 GB in the beginning and 859.5 MB in the end (delta: 397.4 MB). Peak memory consumption was 723.0 MB. Max. memory is 11.5 GB. * Witness Printer took 88.42 ms. Allocated memory is still 1.7 GB. Free memory was 859.5 MB in the beginning and 842.1 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4081]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4106]: Loop Invariant Derived loop invariant: ((!(0bv32 == \old(ldv_coherent_state)) || \old(ldv_coherent_state) == ldv_coherent_state) || !(res_kbtab_probe_3 == 0bv32)) || !(0bv32 == ldv_urb_state) - InvariantResult [Line: 4191]: Loop Invariant Derived loop invariant: ((!(res_kbtab_probe_3 == 0bv32) || !(1bv32 == \old(ldv_urb_state))) || !(1bv32 == ldv_coherent_state)) || (ldv_urb_state == 0bv32 && !(~sign_extendFrom16To32(~bvadd16(urb, urb)) == ~sign_extendFrom16To32(0bv32))) - InvariantResult [Line: 4169]: Loop Invariant Derived loop invariant: ((ldv_urb_state == \old(ldv_urb_state) || !(res_kbtab_probe_3 == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || !(1bv32 == ldv_coherent_state) - InvariantResult [Line: 4005]: Loop Invariant Derived loop invariant: ((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4128]: Loop Invariant Derived loop invariant: ((0bv32 == ldv_coherent_state && !(~sign_extendFrom16To32(~bvadd16(addr, addr)) == ~sign_extendFrom16To32(0bv32))) || !(0bv32 == ldv_urb_state)) || !(1bv32 == \old(ldv_coherent_state)) - InvariantResult [Line: 4006]: Loop Invariant Derived loop invariant: (((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || (((ldv_urb_state == \old(ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0bv32) && \old(ldv_coherent_state) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3)) || (((~bvadd16(ldv_s_kbtab_driver_usb_driver, 4294967295bv32) == 0bv32 && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3) && ~bvadd16(ldv_urb_state, 4294967295bv32) == \old(ldv_urb_state)) - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: ((!(0bv32 == \old(ldv_coherent_state)) || !(res_kbtab_probe_3 == 0bv32)) || ((ldv_urb_state == \old(ldv_urb_state) && \old(ldv_coherent_state) == ldv_coherent_state) && !(0bv32 == error))) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: ((!(res_kbtab_probe_3 == 0bv32) || !(1bv32 == \old(ldv_urb_state))) || !(1bv32 == ldv_coherent_state)) || 1bv32 == ldv_urb_state - InvariantResult [Line: 4133]: Loop Invariant Derived loop invariant: (!(0bv32 == ldv_urb_state) || \old(ldv_coherent_state) == ldv_coherent_state) || !(1bv32 == \old(ldv_coherent_state)) - InvariantResult [Line: 3993]: Loop Invariant Derived loop invariant: ((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4025]: Loop Invariant Derived loop invariant: (((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || (((ldv_urb_state == \old(ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0bv32) && \old(ldv_coherent_state) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3)) || (((~bvadd16(ldv_s_kbtab_driver_usb_driver, 4294967295bv32) == 0bv32 && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3) && ~bvadd16(ldv_urb_state, 4294967295bv32) == \old(ldv_urb_state)) - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: ((!(0bv32 == \old(ldv_coherent_state)) || !(res_kbtab_probe_3 == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == \old(ldv_urb_state) && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && !(0bv32 == error)) - InvariantResult [Line: 3931]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: ((!(0bv32 == \old(ldv_coherent_state)) || ((~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state && ~bvadd16(ldv_urb_state, 4294967295bv32) == \old(ldv_urb_state)) && !(0bv32 == error))) || !(res_kbtab_probe_3 == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4022]: Loop Invariant Derived loop invariant: (((!(0bv32 == \old(ldv_coherent_state)) || !(\old(res_kbtab_probe_3) == 0bv32)) || !(0bv32 == \old(ldv_urb_state))) || (((ldv_urb_state == \old(ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0bv32) && \old(ldv_coherent_state) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3)) || (((~bvadd16(ldv_s_kbtab_driver_usb_driver, 4294967295bv32) == 0bv32 && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && 0bv32 == res_kbtab_probe_3) && ~bvadd16(ldv_urb_state, 4294967295bv32) == \old(ldv_urb_state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 26 procedures, 186 locations, 1 error locations. SAFE Result, 26.9s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 18.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 3258 SDtfs, 1581 SDslu, 6952 SDs, 0 SdLazy, 1310 SolverSat, 391 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1895 GetRequests, 1839 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=851occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 430 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 2840 PreInvPairs, 2886 NumberOfFragments, 1068 HoareAnnotationTreeSize, 2840 FomulaSimplifications, 128 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 70 FomulaSimplificationsInter, 1276 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1639 NumberOfCodeBlocks, 1639 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1882 ConstructedInterpolants, 0 QuantifiedInterpolants, 311757 SizeOfPredicates, 45 NumberOfNonLiveVariables, 7312 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 138/154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...