./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6b79800b0012dbc4aca68e544b1d0e24c4a91e91 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-15 10:51:18,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-15 10:51:18,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-15 10:51:18,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-15 10:51:18,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-15 10:51:18,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-15 10:51:18,911 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-15 10:51:18,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-15 10:51:18,915 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-15 10:51:18,916 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-15 10:51:18,917 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-15 10:51:18,917 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-15 10:51:18,918 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-15 10:51:18,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-15 10:51:18,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-15 10:51:18,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-15 10:51:18,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-15 10:51:18,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-15 10:51:18,927 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-15 10:51:18,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-15 10:51:18,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-15 10:51:18,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-15 10:51:18,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-15 10:51:18,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-15 10:51:18,936 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-15 10:51:18,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-15 10:51:18,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-15 10:51:18,940 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-15 10:51:18,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-15 10:51:18,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-15 10:51:18,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-15 10:51:18,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-15 10:51:18,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-15 10:51:18,944 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-15 10:51:18,945 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-15 10:51:18,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-15 10:51:18,946 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-01-15 10:51:18,962 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-15 10:51:18,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-15 10:51:18,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-15 10:51:18,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-15 10:51:18,965 INFO L133 SettingsManager]: * Use SBE=true [2019-01-15 10:51:18,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-15 10:51:18,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-15 10:51:18,966 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-15 10:51:18,966 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-15 10:51:18,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-15 10:51:18,966 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-15 10:51:18,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-15 10:51:18,967 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-15 10:51:18,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-15 10:51:18,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-15 10:51:18,967 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-15 10:51:18,967 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-15 10:51:18,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-15 10:51:18,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-15 10:51:18,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-15 10:51:18,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-15 10:51:18,970 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-15 10:51:18,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-15 10:51:18,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-15 10:51:18,970 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-15 10:51:18,970 INFO L133 SettingsManager]: * To the following directory=dump/ 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b79800b0012dbc4aca68e544b1d0e24c4a91e91 [2019-01-15 10:51:19,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-15 10:51:19,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-15 10:51:19,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-15 10:51:19,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-15 10:51:19,039 INFO L276 PluginConnector]: CDTParser initialized [2019-01-15 10:51:19,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i [2019-01-15 10:51:19,112 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e639f339/98c075c068fb4de2ac18149474e8bfc1/FLAGf6f142d38 [2019-01-15 10:51:19,807 INFO L307 CDTParser]: Found 1 translation units. [2019-01-15 10:51:19,809 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i [2019-01-15 10:51:19,854 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e639f339/98c075c068fb4de2ac18149474e8bfc1/FLAGf6f142d38 [2019-01-15 10:51:19,925 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e639f339/98c075c068fb4de2ac18149474e8bfc1 [2019-01-15 10:51:19,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-15 10:51:19,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-15 10:51:19,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-15 10:51:19,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-15 10:51:19,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-15 10:51:19,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 10:51:19" (1/1) ... [2019-01-15 10:51:19,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bce595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:19, skipping insertion in model container [2019-01-15 10:51:19,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 10:51:19" (1/1) ... [2019-01-15 10:51:19,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-15 10:51:20,064 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-15 10:51:21,260 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 10:51:21,319 INFO L191 MainTranslator]: Completed pre-run [2019-01-15 10:51:21,563 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 10:51:21,634 INFO L195 MainTranslator]: Completed translation [2019-01-15 10:51:21,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21 WrapperNode [2019-01-15 10:51:21,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-15 10:51:21,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-15 10:51:21,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-15 10:51:21,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-15 10:51:21,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... [2019-01-15 10:51:21,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... [2019-01-15 10:51:21,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-15 10:51:21,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-15 10:51:21,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-15 10:51:21,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-15 10:51:21,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... [2019-01-15 10:51:21,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... [2019-01-15 10:51:21,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... [2019-01-15 10:51:21,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... [2019-01-15 10:51:21,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... [2019-01-15 10:51:21,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... [2019-01-15 10:51:21,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... [2019-01-15 10:51:21,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-15 10:51:21,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-15 10:51:21,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-15 10:51:21,922 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-15 10:51:21,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-15 10:51:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-15 10:51:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-15 10:51:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-15 10:51:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-15 10:51:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-15 10:51:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-15 10:51:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-15 10:51:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-15 10:51:22,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-15 10:51:22,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-15 10:51:22,513 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-15 10:51:24,386 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-01-15 10:51:24,387 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-01-15 10:51:24,389 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-15 10:51:24,389 INFO L286 CfgBuilder]: Removed 135 assue(true) statements. [2019-01-15 10:51:24,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 10:51:24 BoogieIcfgContainer [2019-01-15 10:51:24,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-15 10:51:24,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-15 10:51:24,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-15 10:51:24,395 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-15 10:51:24,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.01 10:51:19" (1/3) ... [2019-01-15 10:51:24,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445ff6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 10:51:24, skipping insertion in model container [2019-01-15 10:51:24,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 10:51:21" (2/3) ... [2019-01-15 10:51:24,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445ff6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 10:51:24, skipping insertion in model container [2019-01-15 10:51:24,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 10:51:24" (3/3) ... [2019-01-15 10:51:24,399 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko_true-unreach-call.cil.out.i [2019-01-15 10:51:24,410 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-15 10:51:24,419 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-15 10:51:24,438 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-15 10:51:24,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-15 10:51:24,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-15 10:51:24,473 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-15 10:51:24,473 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-15 10:51:24,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-15 10:51:24,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-15 10:51:24,474 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-15 10:51:24,474 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-15 10:51:24,474 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-15 10:51:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-01-15 10:51:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-15 10:51:24,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:24,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:24,507 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:24,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1802507212, now seen corresponding path program 1 times [2019-01-15 10:51:24,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:24,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:24,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:24,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:25,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:25,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-15 10:51:25,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 10:51:25,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 10:51:25,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:51:25,088 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-01-15 10:51:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:25,360 INFO L93 Difference]: Finished difference Result 345 states and 479 transitions. [2019-01-15 10:51:25,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 10:51:25,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-15 10:51:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:25,380 INFO L225 Difference]: With dead ends: 345 [2019-01-15 10:51:25,380 INFO L226 Difference]: Without dead ends: 216 [2019-01-15 10:51:25,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:51:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-15 10:51:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 208. [2019-01-15 10:51:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-01-15 10:51:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 253 transitions. [2019-01-15 10:51:25,458 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 253 transitions. Word has length 11 [2019-01-15 10:51:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:25,458 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 253 transitions. [2019-01-15 10:51:25,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 10:51:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 253 transitions. [2019-01-15 10:51:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-15 10:51:25,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:25,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:25,461 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash 43147479, now seen corresponding path program 1 times [2019-01-15 10:51:25,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:25,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:25,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:25,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:25,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:25,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:25,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-15 10:51:25,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 10:51:25,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 10:51:25,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:51:25,600 INFO L87 Difference]: Start difference. First operand 208 states and 253 transitions. Second operand 3 states. [2019-01-15 10:51:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:25,806 INFO L93 Difference]: Finished difference Result 600 states and 732 transitions. [2019-01-15 10:51:25,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 10:51:25,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-15 10:51:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:25,817 INFO L225 Difference]: With dead ends: 600 [2019-01-15 10:51:25,819 INFO L226 Difference]: Without dead ends: 398 [2019-01-15 10:51:25,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:51:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-01-15 10:51:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2019-01-15 10:51:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-01-15 10:51:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 470 transitions. [2019-01-15 10:51:25,896 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 470 transitions. Word has length 12 [2019-01-15 10:51:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:25,899 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 470 transitions. [2019-01-15 10:51:25,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 10:51:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 470 transitions. [2019-01-15 10:51:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-15 10:51:25,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:25,901 INFO L402 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] [2019-01-15 10:51:25,901 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash 97836559, now seen corresponding path program 1 times [2019-01-15 10:51:25,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:25,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:25,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:25,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:26,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:26,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:51:26,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:51:26,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:51:26,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:26,169 INFO L87 Difference]: Start difference. First operand 384 states and 470 transitions. Second operand 5 states. [2019-01-15 10:51:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:26,767 INFO L93 Difference]: Finished difference Result 882 states and 1112 transitions. [2019-01-15 10:51:26,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-15 10:51:26,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-15 10:51:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:26,777 INFO L225 Difference]: With dead ends: 882 [2019-01-15 10:51:26,778 INFO L226 Difference]: Without dead ends: 505 [2019-01-15 10:51:26,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-15 10:51:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-01-15 10:51:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 455. [2019-01-15 10:51:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-01-15 10:51:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 571 transitions. [2019-01-15 10:51:26,832 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 571 transitions. Word has length 27 [2019-01-15 10:51:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:26,832 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 571 transitions. [2019-01-15 10:51:26,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:51:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 571 transitions. [2019-01-15 10:51:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-15 10:51:26,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:26,835 INFO L402 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] [2019-01-15 10:51:26,835 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:26,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1015401359, now seen corresponding path program 1 times [2019-01-15 10:51:26,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:26,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:26,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:26,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:26,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:27,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:27,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 10:51:27,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:51:27,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:51:27,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:27,156 INFO L87 Difference]: Start difference. First operand 455 states and 571 transitions. Second operand 4 states. [2019-01-15 10:51:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:27,448 INFO L93 Difference]: Finished difference Result 915 states and 1147 transitions. [2019-01-15 10:51:27,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:27,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-01-15 10:51:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:27,454 INFO L225 Difference]: With dead ends: 915 [2019-01-15 10:51:27,454 INFO L226 Difference]: Without dead ends: 680 [2019-01-15 10:51:27,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-01-15 10:51:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 459. [2019-01-15 10:51:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-01-15 10:51:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 575 transitions. [2019-01-15 10:51:27,496 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 575 transitions. Word has length 43 [2019-01-15 10:51:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:27,497 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 575 transitions. [2019-01-15 10:51:27,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:51:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 575 transitions. [2019-01-15 10:51:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-15 10:51:27,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:27,501 INFO L402 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] [2019-01-15 10:51:27,501 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2036405118, now seen corresponding path program 1 times [2019-01-15 10:51:27,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:27,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:27,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:27,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:27,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:27,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:27,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 10:51:27,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:51:27,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:51:27,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:27,811 INFO L87 Difference]: Start difference. First operand 459 states and 575 transitions. Second operand 4 states. [2019-01-15 10:51:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:27,939 INFO L93 Difference]: Finished difference Result 961 states and 1206 transitions. [2019-01-15 10:51:27,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:27,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-01-15 10:51:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:27,944 INFO L225 Difference]: With dead ends: 961 [2019-01-15 10:51:27,944 INFO L226 Difference]: Without dead ends: 511 [2019-01-15 10:51:27,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-01-15 10:51:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 314. [2019-01-15 10:51:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-15 10:51:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 388 transitions. [2019-01-15 10:51:27,978 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 388 transitions. Word has length 47 [2019-01-15 10:51:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:27,978 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 388 transitions. [2019-01-15 10:51:27,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:51:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 388 transitions. [2019-01-15 10:51:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-15 10:51:27,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:27,980 INFO L402 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] [2019-01-15 10:51:27,981 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1015336764, now seen corresponding path program 1 times [2019-01-15 10:51:27,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:27,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:27,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:27,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:27,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:28,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:28,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:51:28,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:51:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:51:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:28,196 INFO L87 Difference]: Start difference. First operand 314 states and 388 transitions. Second operand 4 states. [2019-01-15 10:51:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:28,599 INFO L93 Difference]: Finished difference Result 554 states and 683 transitions. [2019-01-15 10:51:28,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:28,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-01-15 10:51:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:28,605 INFO L225 Difference]: With dead ends: 554 [2019-01-15 10:51:28,605 INFO L226 Difference]: Without dead ends: 550 [2019-01-15 10:51:28,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:28,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-01-15 10:51:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 528. [2019-01-15 10:51:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-01-15 10:51:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 660 transitions. [2019-01-15 10:51:28,654 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 660 transitions. Word has length 47 [2019-01-15 10:51:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:28,655 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 660 transitions. [2019-01-15 10:51:28,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:51:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 660 transitions. [2019-01-15 10:51:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-15 10:51:28,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:28,657 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-15 10:51:28,657 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1949403581, now seen corresponding path program 1 times [2019-01-15 10:51:28,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:28,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:29,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:29,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:51:29,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:51:29,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:51:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:29,043 INFO L87 Difference]: Start difference. First operand 528 states and 660 transitions. Second operand 5 states. [2019-01-15 10:51:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:29,549 INFO L93 Difference]: Finished difference Result 1079 states and 1338 transitions. [2019-01-15 10:51:29,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-15 10:51:29,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-15 10:51:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:29,555 INFO L225 Difference]: With dead ends: 1079 [2019-01-15 10:51:29,555 INFO L226 Difference]: Without dead ends: 553 [2019-01-15 10:51:29,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-15 10:51:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-01-15 10:51:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 517. [2019-01-15 10:51:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-01-15 10:51:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 641 transitions. [2019-01-15 10:51:29,631 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 641 transitions. Word has length 49 [2019-01-15 10:51:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:29,631 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 641 transitions. [2019-01-15 10:51:29,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:51:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 641 transitions. [2019-01-15 10:51:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-15 10:51:29,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:29,635 INFO L402 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, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:29,636 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1249342346, now seen corresponding path program 1 times [2019-01-15 10:51:29,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:29,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:29,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:29,987 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-01-15 10:51:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:29,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:29,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:51:29,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 10:51:29,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 10:51:29,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:51:29,996 INFO L87 Difference]: Start difference. First operand 517 states and 641 transitions. Second operand 3 states. [2019-01-15 10:51:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:30,200 INFO L93 Difference]: Finished difference Result 1001 states and 1237 transitions. [2019-01-15 10:51:30,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 10:51:30,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-01-15 10:51:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:30,207 INFO L225 Difference]: With dead ends: 1001 [2019-01-15 10:51:30,208 INFO L226 Difference]: Without dead ends: 518 [2019-01-15 10:51:30,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:51:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-01-15 10:51:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 489. [2019-01-15 10:51:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-01-15 10:51:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 595 transitions. [2019-01-15 10:51:30,302 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 595 transitions. Word has length 54 [2019-01-15 10:51:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:30,303 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 595 transitions. [2019-01-15 10:51:30,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 10:51:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 595 transitions. [2019-01-15 10:51:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-15 10:51:30,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:30,307 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:30,308 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:30,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2015730543, now seen corresponding path program 1 times [2019-01-15 10:51:30,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:30,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:30,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:30,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:30,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:30,724 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-15 10:51:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:30,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:30,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 10:51:30,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:51:30,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:51:30,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:30,747 INFO L87 Difference]: Start difference. First operand 489 states and 595 transitions. Second operand 4 states. [2019-01-15 10:51:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:31,021 INFO L93 Difference]: Finished difference Result 730 states and 883 transitions. [2019-01-15 10:51:31,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:31,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-01-15 10:51:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:31,027 INFO L225 Difference]: With dead ends: 730 [2019-01-15 10:51:31,027 INFO L226 Difference]: Without dead ends: 704 [2019-01-15 10:51:31,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-01-15 10:51:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 493. [2019-01-15 10:51:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-01-15 10:51:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 599 transitions. [2019-01-15 10:51:31,094 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 599 transitions. Word has length 56 [2019-01-15 10:51:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:31,094 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 599 transitions. [2019-01-15 10:51:31,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:51:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 599 transitions. [2019-01-15 10:51:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-15 10:51:31,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:31,096 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:31,096 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:31,100 INFO L82 PathProgramCache]: Analyzing trace with hash -247920110, now seen corresponding path program 1 times [2019-01-15 10:51:31,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:31,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:31,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:31,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:31,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:31,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:51:31,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:51:31,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:51:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:31,351 INFO L87 Difference]: Start difference. First operand 493 states and 599 transitions. Second operand 5 states. [2019-01-15 10:51:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:31,596 INFO L93 Difference]: Finished difference Result 980 states and 1191 transitions. [2019-01-15 10:51:31,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 10:51:31,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-15 10:51:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:31,600 INFO L225 Difference]: With dead ends: 980 [2019-01-15 10:51:31,600 INFO L226 Difference]: Without dead ends: 493 [2019-01-15 10:51:31,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-15 10:51:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-01-15 10:51:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-01-15 10:51:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-01-15 10:51:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 598 transitions. [2019-01-15 10:51:31,674 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 598 transitions. Word has length 57 [2019-01-15 10:51:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:31,675 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 598 transitions. [2019-01-15 10:51:31,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:51:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 598 transitions. [2019-01-15 10:51:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-15 10:51:31,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:31,676 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:31,676 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1290419920, now seen corresponding path program 1 times [2019-01-15 10:51:31,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:31,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:31,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:31,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:32,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:32,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:51:32,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:51:32,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:51:32,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:32,098 INFO L87 Difference]: Start difference. First operand 493 states and 598 transitions. Second operand 4 states. [2019-01-15 10:51:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:32,769 INFO L93 Difference]: Finished difference Result 1329 states and 1625 transitions. [2019-01-15 10:51:32,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:32,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-15 10:51:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:32,776 INFO L225 Difference]: With dead ends: 1329 [2019-01-15 10:51:32,777 INFO L226 Difference]: Without dead ends: 1041 [2019-01-15 10:51:32,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-01-15 10:51:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 844. [2019-01-15 10:51:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-01-15 10:51:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1035 transitions. [2019-01-15 10:51:32,916 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1035 transitions. Word has length 57 [2019-01-15 10:51:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:32,916 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1035 transitions. [2019-01-15 10:51:32,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:51:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1035 transitions. [2019-01-15 10:51:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-15 10:51:32,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:32,917 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:32,919 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1563249264, now seen corresponding path program 1 times [2019-01-15 10:51:32,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:32,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:32,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:32,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:32,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:33,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:33,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 10:51:33,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:51:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:51:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:33,173 INFO L87 Difference]: Start difference. First operand 844 states and 1035 transitions. Second operand 4 states. [2019-01-15 10:51:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:33,437 INFO L93 Difference]: Finished difference Result 1261 states and 1538 transitions. [2019-01-15 10:51:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:33,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-01-15 10:51:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:33,441 INFO L225 Difference]: With dead ends: 1261 [2019-01-15 10:51:33,441 INFO L226 Difference]: Without dead ends: 490 [2019-01-15 10:51:33,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:33,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-01-15 10:51:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 469. [2019-01-15 10:51:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-01-15 10:51:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 567 transitions. [2019-01-15 10:51:33,506 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 567 transitions. Word has length 63 [2019-01-15 10:51:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:33,507 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 567 transitions. [2019-01-15 10:51:33,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:51:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 567 transitions. [2019-01-15 10:51:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-15 10:51:33,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:33,509 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:33,510 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:33,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1703797874, now seen corresponding path program 1 times [2019-01-15 10:51:33,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:33,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:33,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:33,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:33,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:51:33,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:51:33,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:51:33,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:33,754 INFO L87 Difference]: Start difference. First operand 469 states and 567 transitions. Second operand 4 states. [2019-01-15 10:51:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:34,288 INFO L93 Difference]: Finished difference Result 771 states and 930 transitions. [2019-01-15 10:51:34,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:34,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-01-15 10:51:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:34,296 INFO L225 Difference]: With dead ends: 771 [2019-01-15 10:51:34,296 INFO L226 Difference]: Without dead ends: 764 [2019-01-15 10:51:34,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-01-15 10:51:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 715. [2019-01-15 10:51:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-01-15 10:51:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 872 transitions. [2019-01-15 10:51:34,428 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 872 transitions. Word has length 63 [2019-01-15 10:51:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:34,428 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 872 transitions. [2019-01-15 10:51:34,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:51:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 872 transitions. [2019-01-15 10:51:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-15 10:51:34,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:34,429 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:34,429 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash 967629456, now seen corresponding path program 1 times [2019-01-15 10:51:34,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:34,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:34,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:34,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:34,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:34,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:34,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 10:51:34,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:51:34,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:51:34,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:34,644 INFO L87 Difference]: Start difference. First operand 715 states and 872 transitions. Second operand 4 states. [2019-01-15 10:51:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:34,997 INFO L93 Difference]: Finished difference Result 841 states and 1028 transitions. [2019-01-15 10:51:35,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:35,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-15 10:51:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:35,006 INFO L225 Difference]: With dead ends: 841 [2019-01-15 10:51:35,007 INFO L226 Difference]: Without dead ends: 832 [2019-01-15 10:51:35,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-01-15 10:51:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 719. [2019-01-15 10:51:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-01-15 10:51:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 872 transitions. [2019-01-15 10:51:35,122 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 872 transitions. Word has length 64 [2019-01-15 10:51:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:35,122 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 872 transitions. [2019-01-15 10:51:35,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:51:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 872 transitions. [2019-01-15 10:51:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-15 10:51:35,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:35,123 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-15 10:51:35,123 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1689795513, now seen corresponding path program 1 times [2019-01-15 10:51:35,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:35,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:35,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:35,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:35,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:35,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-15 10:51:35,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-15 10:51:35,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:35,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-15 10:51:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:35,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-15 10:51:35,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-01-15 10:51:35,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:51:35,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:51:35,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:35,877 INFO L87 Difference]: Start difference. First operand 719 states and 872 transitions. Second operand 5 states. [2019-01-15 10:51:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:36,289 INFO L93 Difference]: Finished difference Result 1037 states and 1268 transitions. [2019-01-15 10:51:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:36,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-01-15 10:51:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:36,293 INFO L225 Difference]: With dead ends: 1037 [2019-01-15 10:51:36,293 INFO L226 Difference]: Without dead ends: 346 [2019-01-15 10:51:36,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-01-15 10:51:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 314. [2019-01-15 10:51:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-15 10:51:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 357 transitions. [2019-01-15 10:51:36,454 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 357 transitions. Word has length 68 [2019-01-15 10:51:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:36,454 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 357 transitions. [2019-01-15 10:51:36,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:51:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 357 transitions. [2019-01-15 10:51:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-15 10:51:36,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:36,456 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:36,456 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:36,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:36,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2027570376, now seen corresponding path program 1 times [2019-01-15 10:51:36,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:36,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:36,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:36,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:36,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:36,848 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-15 10:51:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:36,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:36,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:51:36,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 10:51:36,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 10:51:36,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:51:36,856 INFO L87 Difference]: Start difference. First operand 314 states and 357 transitions. Second operand 3 states. [2019-01-15 10:51:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:37,022 INFO L93 Difference]: Finished difference Result 515 states and 587 transitions. [2019-01-15 10:51:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 10:51:37,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-01-15 10:51:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:37,024 INFO L225 Difference]: With dead ends: 515 [2019-01-15 10:51:37,024 INFO L226 Difference]: Without dead ends: 242 [2019-01-15 10:51:37,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 10:51:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-15 10:51:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-01-15 10:51:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-15 10:51:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2019-01-15 10:51:37,073 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 77 [2019-01-15 10:51:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:37,073 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2019-01-15 10:51:37,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 10:51:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2019-01-15 10:51:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-15 10:51:37,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:37,074 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 10:51:37,075 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:37,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:37,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1039963939, now seen corresponding path program 1 times [2019-01-15 10:51:37,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:37,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:37,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:37,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:37,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:37,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 10:51:37,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 10:51:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 10:51:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:37,662 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand 4 states. [2019-01-15 10:51:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:37,974 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2019-01-15 10:51:37,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-15 10:51:37,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-01-15 10:51:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:37,976 INFO L225 Difference]: With dead ends: 244 [2019-01-15 10:51:37,976 INFO L226 Difference]: Without dead ends: 211 [2019-01-15 10:51:37,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 10:51:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-15 10:51:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 132. [2019-01-15 10:51:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-15 10:51:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2019-01-15 10:51:38,013 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 79 [2019-01-15 10:51:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:38,014 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2019-01-15 10:51:38,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 10:51:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2019-01-15 10:51:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-15 10:51:38,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 10:51:38,015 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-15 10:51:38,016 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 10:51:38,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 10:51:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1761187395, now seen corresponding path program 1 times [2019-01-15 10:51:38,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 10:51:38,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 10:51:38,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:38,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 10:51:38,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 10:51:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 10:51:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 10:51:38,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 10:51:38,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-15 10:51:38,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-15 10:51:38,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-15 10:51:38,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-15 10:51:38,349 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand 5 states. [2019-01-15 10:51:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 10:51:38,809 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2019-01-15 10:51:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 10:51:38,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-15 10:51:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 10:51:38,810 INFO L225 Difference]: With dead ends: 132 [2019-01-15 10:51:38,810 INFO L226 Difference]: Without dead ends: 0 [2019-01-15 10:51:38,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-15 10:51:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-15 10:51:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-15 10:51:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-15 10:51:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-15 10:51:38,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-01-15 10:51:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 10:51:38,812 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-15 10:51:38,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-15 10:51:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-15 10:51:38,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-15 10:51:38,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-15 10:51:38,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:38,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:38,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:38,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:38,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:38,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:38,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:38,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:39,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-15 10:51:40,569 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2019-01-15 10:51:40,944 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-01-15 10:51:41,557 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-01-15 10:51:42,334 WARN L181 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 18 [2019-01-15 10:51:42,597 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-15 10:51:43,158 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-01-15 10:51:43,417 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-01-15 10:51:43,703 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-01-15 10:51:44,136 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-01-15 10:51:44,371 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-01-15 10:51:44,608 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-01-15 10:51:45,236 INFO L448 ceAbstractionStarter]: For program point L3801(lines 3801 3804) no Hoare annotation was computed. [2019-01-15 10:51:45,236 INFO L444 ceAbstractionStarter]: At program point L4231(lines 4230 4232) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,237 INFO L448 ceAbstractionStarter]: For program point L4066(lines 4066 4069) no Hoare annotation was computed. [2019-01-15 10:51:45,237 INFO L448 ceAbstractionStarter]: For program point L4034(lines 1 4254) no Hoare annotation was computed. [2019-01-15 10:51:45,237 INFO L448 ceAbstractionStarter]: For program point L4034-2(lines 1 4254) no Hoare annotation was computed. [2019-01-15 10:51:45,237 INFO L448 ceAbstractionStarter]: For program point L4034-1(lines 1 4254) no Hoare annotation was computed. [2019-01-15 10:51:45,237 INFO L448 ceAbstractionStarter]: For program point L4034-4(lines 4178 4183) no Hoare annotation was computed. [2019-01-15 10:51:45,237 INFO L448 ceAbstractionStarter]: For program point L4034-3(lines 1 4254) no Hoare annotation was computed. [2019-01-15 10:51:45,238 INFO L444 ceAbstractionStarter]: At program point L4034-5(lines 4169 4186) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-01-15 10:51:45,238 INFO L444 ceAbstractionStarter]: At program point L4134(lines 4112 4136) the Hoare annotation is: (let ((.cse1 (<= ~ldv_coherent_state~0 1)) (.cse2 (<= 1 ~ldv_coherent_state~0)) (.cse0 (= 0 |ULTIMATE.start_usb_alloc_urb_#res.offset|)) (.cse3 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0))) (or (and (or (not (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (not .cse0)) .cse1 .cse2 (<= ~ldv_urb_state~0 1) .cse3 (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse1 .cse2 .cse0 (= ~ldv_urb_state~0 0) .cse3 (= 0 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res.base|)))) [2019-01-15 10:51:45,238 INFO L448 ceAbstractionStarter]: For program point L3969(line 3969) no Hoare annotation was computed. [2019-01-15 10:51:45,238 INFO L448 ceAbstractionStarter]: For program point L3903(lines 3903 3906) no Hoare annotation was computed. [2019-01-15 10:51:45,238 INFO L444 ceAbstractionStarter]: At program point L4234(lines 4172 4177) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-15 10:51:45,239 INFO L448 ceAbstractionStarter]: For program point L3475(lines 3475 3482) no Hoare annotation was computed. [2019-01-15 10:51:45,239 INFO L448 ceAbstractionStarter]: For program point L4037-1(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,239 INFO L448 ceAbstractionStarter]: For program point L4037(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,239 INFO L448 ceAbstractionStarter]: For program point L4037-3(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,239 INFO L448 ceAbstractionStarter]: For program point L4037-2(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,239 INFO L448 ceAbstractionStarter]: For program point L4037-5(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,239 INFO L448 ceAbstractionStarter]: For program point L4037-4(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,240 INFO L448 ceAbstractionStarter]: For program point L3839(lines 3839 3842) no Hoare annotation was computed. [2019-01-15 10:51:45,240 INFO L444 ceAbstractionStarter]: At program point L4203(lines 4202 4204) the Hoare annotation is: (let ((.cse1 (= ~ldv_coherent_state~0 0)) (.cse0 (= ~ldv_urb_state~0 0))) (or (and (and .cse0 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) .cse1) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse3 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (<= (+ .cse2 1) 0) (<= (+ (* 18446744073709551616 .cse2) 1) .cse3)))) (let ((.cse5 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (<= (+ .cse4 1) 0) (< (* 18446744073709551616 .cse4) .cse5)))) .cse1 .cse0 (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2019-01-15 10:51:45,240 INFO L444 ceAbstractionStarter]: At program point L3840(lines 3781 3861) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,240 INFO L448 ceAbstractionStarter]: For program point L3444(lines 3444 3448) no Hoare annotation was computed. [2019-01-15 10:51:45,240 INFO L448 ceAbstractionStarter]: For program point L3444-2(lines 3444 3448) no Hoare annotation was computed. [2019-01-15 10:51:45,241 INFO L444 ceAbstractionStarter]: At program point L4105-1(lines 4081 4110) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (<= (+ (* 18446744073709551616 .cse0) 1) .cse1)))) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (<= (+ .cse2 1) 0) (< (* 18446744073709551616 .cse2) .cse3)))) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-01-15 10:51:45,241 INFO L444 ceAbstractionStarter]: At program point L4105(lines 4081 4110) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (<= (+ .cse5 1) 0) (< (* 18446744073709551616 .cse5) .cse6))))) (.cse1 (= ~ldv_coherent_state~0 0)) (.cse2 (= ~ldv_urb_state~0 0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse4 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (<= (+ .cse3 1) 0) (<= (+ (* 18446744073709551616 .cse3) 1) .cse4)))) .cse0 .cse1 .cse2 (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2019-01-15 10:51:45,241 INFO L448 ceAbstractionStarter]: For program point L3973(lines 3973 3978) no Hoare annotation was computed. [2019-01-15 10:51:45,241 INFO L448 ceAbstractionStarter]: For program point L3808(lines 3808 3811) no Hoare annotation was computed. [2019-01-15 10:51:45,241 INFO L448 ceAbstractionStarter]: For program point L3478(lines 3478 3482) no Hoare annotation was computed. [2019-01-15 10:51:45,241 INFO L448 ceAbstractionStarter]: For program point L3478-2(lines 3475 3482) no Hoare annotation was computed. [2019-01-15 10:51:45,241 INFO L448 ceAbstractionStarter]: For program point L4074(lines 4059 4075) no Hoare annotation was computed. [2019-01-15 10:51:45,241 INFO L448 ceAbstractionStarter]: For program point L3975-1(lines 3973 3978) no Hoare annotation was computed. [2019-01-15 10:51:45,241 INFO L448 ceAbstractionStarter]: For program point L3975(lines 3975 3978) no Hoare annotation was computed. [2019-01-15 10:51:45,242 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,242 INFO L444 ceAbstractionStarter]: At program point L4207(lines 4206 4208) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,242 INFO L444 ceAbstractionStarter]: At program point L3910(lines 3899 3912) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and (not (= ULTIMATE.start_kbtab_init_~retval~1 0)) .cse0 .cse1) (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2019-01-15 10:51:45,242 INFO L444 ceAbstractionStarter]: At program point L4241(lines 4240 4242) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-01-15 10:51:45,242 INFO L444 ceAbstractionStarter]: At program point L4142loopEntry(lines 4142 4161) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,242 INFO L444 ceAbstractionStarter]: At program point L4142-2loopEntry(lines 4142 4161) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-01-15 10:51:45,242 INFO L444 ceAbstractionStarter]: At program point L3911(lines 3897 3913) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0))) (or (and (not (= ULTIMATE.start_kbtab_init_~retval~1 0)) (or (<= 1 |ULTIMATE.start_kbtab_init_#res|) (<= (+ |ULTIMATE.start_kbtab_init_#res| 1) 0)) .cse0 .cse1) (and .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0)))) [2019-01-15 10:51:45,242 INFO L444 ceAbstractionStarter]: At program point L3416(lines 3410 3418) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-01-15 10:51:45,243 INFO L444 ceAbstractionStarter]: At program point L3449(lines 3437 3451) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,243 INFO L448 ceAbstractionStarter]: For program point L4143-1(lines 4142 4161) no Hoare annotation was computed. [2019-01-15 10:51:45,243 INFO L448 ceAbstractionStarter]: For program point L4143(lines 4142 4161) no Hoare annotation was computed. [2019-01-15 10:51:45,243 INFO L444 ceAbstractionStarter]: At program point L4077(lines 4054 4079) the Hoare annotation is: (let ((.cse0 (= ~ldv_urb_state~0 0)) (.cse1 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0)) (.cse2 (= 0 |ULTIMATE.start_usb_alloc_coherent_#res.offset|))) (or (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 (= 0 ~res_kbtab_probe_3~0) (or (not .cse2) (not (= |ULTIMATE.start_usb_alloc_coherent_#res.base| 0))) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and (= 0 |ULTIMATE.start_usb_alloc_coherent_#res.base|) (= ~ldv_coherent_state~0 0) .cse0 .cse1 .cse2 (= 0 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)))) [2019-01-15 10:51:45,243 INFO L444 ceAbstractionStarter]: At program point L4210(lines 4209 4211) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,243 INFO L448 ceAbstractionStarter]: For program point L4144(lines 4142 4161) no Hoare annotation was computed. [2019-01-15 10:51:45,243 INFO L444 ceAbstractionStarter]: At program point L4210-1(lines 4209 4211) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,243 INFO L444 ceAbstractionStarter]: At program point L4210-2(lines 4209 4211) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,244 INFO L448 ceAbstractionStarter]: For program point L4144-1(lines 4142 4161) no Hoare annotation was computed. [2019-01-15 10:51:45,244 INFO L444 ceAbstractionStarter]: At program point L3484(lines 3463 3486) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,244 INFO L451 ceAbstractionStarter]: At program point L4046(lines 4046 4047) the Hoare annotation is: true [2019-01-15 10:51:45,244 INFO L451 ceAbstractionStarter]: At program point L4046-2(lines 4046 4047) the Hoare annotation is: true [2019-01-15 10:51:45,244 INFO L451 ceAbstractionStarter]: At program point L4046-1(lines 4046 4047) the Hoare annotation is: true [2019-01-15 10:51:45,244 INFO L451 ceAbstractionStarter]: At program point L4046-3(lines 4046 4047) the Hoare annotation is: true [2019-01-15 10:51:45,244 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,244 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,244 INFO L444 ceAbstractionStarter]: At program point L3519(lines 3513 3521) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,245 INFO L444 ceAbstractionStarter]: At program point L4213(lines 4212 4214) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-01-15 10:51:45,245 INFO L448 ceAbstractionStarter]: For program point L3982(lines 3982 4018) no Hoare annotation was computed. [2019-01-15 10:51:45,245 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,245 INFO L444 ceAbstractionStarter]: At program point L4016(lines 3968 4019) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse0 (= 0 |ULTIMATE.start_kbtab_probe_#res|)) (.cse2 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse5 (<= 1 ~ldv_urb_state~0)) (.cse4 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (and .cse4 (and (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (<= (+ .cse6 1) 0) (< (* 18446744073709551616 .cse6) .cse7)))) .cse1))) (and .cse0 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 (<= ~ldv_urb_state~0 1) .cse4 .cse5) (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) .cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2019-01-15 10:51:45,245 INFO L444 ceAbstractionStarter]: At program point L3983(lines 3982 4018) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse0 (= 0 |ULTIMATE.start_kbtab_probe_#res|)) (.cse2 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse5 (<= 1 ~ldv_urb_state~0)) (.cse4 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (and .cse4 (and (let ((.cse7 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse6 (div .cse7 18446744073709551616))) (or (<= (+ .cse6 1) 0) (< (* 18446744073709551616 .cse6) .cse7)))) .cse1))) (and .cse0 (<= ~ldv_coherent_state~0 1) .cse2 .cse3 (<= ~ldv_urb_state~0 1) .cse4 .cse5) (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) .cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2019-01-15 10:51:45,245 INFO L444 ceAbstractionStarter]: At program point L3851(lines 3781 3861) the Hoare annotation is: (let ((.cse2 (<= ~ldv_coherent_state~0 1)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse4 (= ~ldv_urb_state~0 0))) (or (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (<= (+ (* 18446744073709551616 .cse0) 1) .cse1)))) .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)))) [2019-01-15 10:51:45,246 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-15 10:51:45,246 INFO L444 ceAbstractionStarter]: At program point L3390(lines 3383 3392) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,246 INFO L444 ceAbstractionStarter]: At program point L3390-1(lines 3383 3392) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,246 INFO L444 ceAbstractionStarter]: At program point L4249-2(lines 4248 4250) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,246 INFO L444 ceAbstractionStarter]: At program point L4249-3(lines 4248 4250) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,246 INFO L444 ceAbstractionStarter]: At program point L4249(lines 4248 4250) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,246 INFO L444 ceAbstractionStarter]: At program point L4249-1(lines 4248 4250) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,247 INFO L444 ceAbstractionStarter]: At program point L4216(lines 3996 3999) the Hoare annotation is: (let ((.cse3 (not (= ~res_kbtab_probe_3~0 0))) (.cse4 (not (= |ULTIMATE.start_kbtab_probe_#res| 0))) (.cse8 (= ~ldv_urb_state~0 0)) (.cse0 (= 0 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse7 (= ~ldv_coherent_state~0 0))) (or (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) .cse0) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse2 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse1 (div .cse2 18446744073709551616))) (or (<= (+ .cse1 1) 0) (<= (+ (* 18446744073709551616 .cse1) 1) .cse2)))) .cse3 .cse4 (let ((.cse6 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse5 (div .cse6 18446744073709551616))) (or (<= (+ .cse5 1) 0) (< (* 18446744073709551616 .cse5) .cse6)))) .cse7 .cse8 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and (and .cse3 .cse4 .cse8 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse0) .cse7))) [2019-01-15 10:51:45,247 INFO L444 ceAbstractionStarter]: At program point L4117loopEntry(lines 4117 4130) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,247 INFO L444 ceAbstractionStarter]: At program point L4249-4(lines 4248 4250) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-01-15 10:51:45,247 INFO L448 ceAbstractionStarter]: For program point L3985(lines 3985 4018) no Hoare annotation was computed. [2019-01-15 10:51:45,247 INFO L448 ceAbstractionStarter]: For program point L4118(line 4118) no Hoare annotation was computed. [2019-01-15 10:51:45,247 INFO L448 ceAbstractionStarter]: For program point L4151(lines 4151 4156) no Hoare annotation was computed. [2019-01-15 10:51:45,247 INFO L444 ceAbstractionStarter]: At program point L4085loopEntry(lines 4085 4104) the Hoare annotation is: (let ((.cse2 (<= ~ldv_coherent_state~0 1)) (.cse3 (<= 1 ~ldv_coherent_state~0)) (.cse4 (= ~ldv_urb_state~0 0))) (or (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (<= (+ (* 18446744073709551616 .cse0) 1) .cse1)))) .cse2 .cse3 .cse4 (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse2 .cse3 .cse4 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)))) [2019-01-15 10:51:45,247 INFO L448 ceAbstractionStarter]: For program point L4151-2(lines 4151 4156) no Hoare annotation was computed. [2019-01-15 10:51:45,248 INFO L444 ceAbstractionStarter]: At program point L3986(lines 3985 4018) the Hoare annotation is: (let ((.cse3 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 1))) (.cse4 (not (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 ULTIMATE.start_main_~tmp___8~3))) (.cse6 (= 0 |ULTIMATE.start_kbtab_probe_#res|)) (.cse0 (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) (.cse7 (<= 1 ~ldv_coherent_state~0)) (.cse5 (= 0 ~res_kbtab_probe_3~0)) (.cse8 (<= 1 ~ldv_urb_state~0))) (or (and .cse0 (and (and (let ((.cse2 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse1 (div .cse2 18446744073709551616))) (or (<= (+ .cse1 1) 0) (< (* 18446744073709551616 .cse1) .cse2)))) .cse3 .cse4) .cse5)) (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) .cse5 .cse4 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse6 .cse0 (and .cse3 .cse7 .cse4) .cse5 .cse8) (and .cse6 (<= ~ldv_coherent_state~0 1) .cse0 .cse7 (<= ~ldv_urb_state~0 1) .cse5 .cse8))) [2019-01-15 10:51:45,248 INFO L444 ceAbstractionStarter]: At program point L4085-2loopEntry(lines 4085 4104) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (<= (+ (* 18446744073709551616 .cse0) 1) .cse1)))) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-01-15 10:51:45,248 INFO L448 ceAbstractionStarter]: For program point L4086(lines 4085 4104) no Hoare annotation was computed. [2019-01-15 10:51:45,248 INFO L444 ceAbstractionStarter]: At program point L4020(lines 3967 4021) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-15 10:51:45,248 INFO L448 ceAbstractionStarter]: For program point L4086-1(lines 4085 4104) no Hoare annotation was computed. [2019-01-15 10:51:45,248 INFO L444 ceAbstractionStarter]: At program point L3855(lines 3781 3861) the Hoare annotation is: (let ((.cse1 (= ~ldv_coherent_state~0 0)) (.cse0 (= ~ldv_urb_state~0 0))) (or (and (and .cse0 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0)) .cse1) (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse3 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (<= (+ .cse2 1) 0) (<= (+ (* 18446744073709551616 .cse2) 1) .cse3)))) (let ((.cse5 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse4 (div .cse5 18446744073709551616))) (or (<= (+ .cse4 1) 0) (< (* 18446744073709551616 .cse4) .cse5)))) .cse1 .cse0 (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)))) [2019-01-15 10:51:45,248 INFO L444 ceAbstractionStarter]: At program point L3459(lines 3453 3461) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-01-15 10:51:45,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,249 INFO L444 ceAbstractionStarter]: At program point L4219(lines 4218 4220) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-01-15 10:51:45,249 INFO L444 ceAbstractionStarter]: At program point L4252-1(lines 1 4254) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (<= (+ (* 18446744073709551616 .cse0) 1) .cse1)))) (let ((.cse3 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse2 (div .cse3 18446744073709551616))) (or (<= (+ .cse2 1) 0) (< (* 18446744073709551616 .cse2) .cse3)))) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-01-15 10:51:45,249 INFO L448 ceAbstractionStarter]: For program point L4252(lines 4252 4254) no Hoare annotation was computed. [2019-01-15 10:51:45,249 INFO L448 ceAbstractionStarter]: For program point L4087-1(lines 4085 4104) no Hoare annotation was computed. [2019-01-15 10:51:45,249 INFO L448 ceAbstractionStarter]: For program point L4087(lines 4085 4104) no Hoare annotation was computed. [2019-01-15 10:51:45,249 INFO L448 ceAbstractionStarter]: For program point L3790(lines 3790 3796) no Hoare annotation was computed. [2019-01-15 10:51:45,250 INFO L444 ceAbstractionStarter]: At program point L3427-1(lines 3421 3429) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-01-15 10:51:45,250 INFO L444 ceAbstractionStarter]: At program point L3427(lines 3421 3429) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,250 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-15 10:51:45,250 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-01-15 10:51:45,250 INFO L444 ceAbstractionStarter]: At program point L4189-1(lines 4188 4190) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,250 INFO L444 ceAbstractionStarter]: At program point L4189(lines 4188 4190) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,250 INFO L448 ceAbstractionStarter]: For program point L4123(lines 4123 4126) no Hoare annotation was computed. [2019-01-15 10:51:45,250 INFO L448 ceAbstractionStarter]: For program point L3793(lines 3793 3796) no Hoare annotation was computed. [2019-01-15 10:51:45,250 INFO L444 ceAbstractionStarter]: At program point L4223(lines 4222 4224) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,251 INFO L444 ceAbstractionStarter]: At program point L4223-1(lines 4222 4224) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,251 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-15 10:51:45,251 INFO L444 ceAbstractionStarter]: At program point L3860(lines 3770 3862) the Hoare annotation is: (let ((.cse5 (= ~ldv_coherent_state~0 0)) (.cse2 (not (= |ULTIMATE.start_kbtab_probe_#res| 0))) (.cse6 (= ~ldv_urb_state~0 0)) (.cse7 (= 0 ~res_kbtab_probe_3~0)) (.cse8 (= 0 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0))) (or (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (<= (+ (* 18446744073709551616 .cse0) 1) .cse1)))) .cse2 (let ((.cse4 (+ ULTIMATE.start_usb_free_coherent_~addr.base ULTIMATE.start_usb_free_coherent_~addr.offset))) (let ((.cse3 (div .cse4 18446744073709551616))) (or (<= (+ .cse3 1) 0) (< (* 18446744073709551616 .cse3) .cse4)))) .cse5 .cse6 .cse7 (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) (and .cse5 (and .cse2 .cse6 (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) .cse8)) (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) .cse7 (<= 1 ~ldv_urb_state~0) .cse8))) [2019-01-15 10:51:45,251 INFO L444 ceAbstractionStarter]: At program point L3497(lines 3494 3499) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,251 INFO L444 ceAbstractionStarter]: At program point L3564(lines 3557 3566) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,251 INFO L444 ceAbstractionStarter]: At program point L3399-1(lines 3393 3401) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,251 INFO L444 ceAbstractionStarter]: At program point L3399(lines 3393 3401) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,252 INFO L444 ceAbstractionStarter]: At program point L4060loopEntry(lines 4060 4073) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,252 INFO L444 ceAbstractionStarter]: At program point L4193(lines 4192 4194) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-01-15 10:51:45,252 INFO L448 ceAbstractionStarter]: For program point L4094(lines 4094 4099) no Hoare annotation was computed. [2019-01-15 10:51:45,252 INFO L448 ceAbstractionStarter]: For program point L4094-2(lines 4094 4099) no Hoare annotation was computed. [2019-01-15 10:51:45,252 INFO L448 ceAbstractionStarter]: For program point L4061(line 4061) no Hoare annotation was computed. [2019-01-15 10:51:45,252 INFO L448 ceAbstractionStarter]: For program point L3962(lines 3962 3965) no Hoare annotation was computed. [2019-01-15 10:51:45,252 INFO L444 ceAbstractionStarter]: At program point L3434(lines 3430 3436) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,252 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-15 10:51:45,252 INFO L444 ceAbstractionStarter]: At program point L3501(lines 3500 3502) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,252 INFO L444 ceAbstractionStarter]: At program point L4162(lines 4138 4167) the Hoare annotation is: (and (not (= ULTIMATE.start_kbtab_probe_~error~0 0)) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (<= (+ (* 18446744073709551616 .cse0) 1) .cse1)))) (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,253 INFO L444 ceAbstractionStarter]: At program point L4162-1(lines 4138 4167) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (let ((.cse1 (+ ULTIMATE.start_usb_free_urb_~urb.base ULTIMATE.start_usb_free_urb_~urb.offset))) (let ((.cse0 (div .cse1 18446744073709551616))) (or (<= (+ .cse0 1) 0) (<= (+ (* 18446744073709551616 .cse0) 1) .cse1)))) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-01-15 10:51:45,253 INFO L444 ceAbstractionStarter]: At program point L4031(lines 3949 4033) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2019-01-15 10:51:45,253 INFO L444 ceAbstractionStarter]: At program point L4197-1(lines 4196 4198) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,253 INFO L444 ceAbstractionStarter]: At program point L4197(lines 4196 4198) the Hoare annotation is: (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= (+ ULTIMATE.start_kbtab_probe_~error~0 12) 0) (<= 1 ~ldv_urb_state~0) (= ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0 0)) [2019-01-15 10:51:45,253 INFO L448 ceAbstractionStarter]: For program point L4131(lines 4116 4132) no Hoare annotation was computed. [2019-01-15 10:51:45,253 INFO L444 ceAbstractionStarter]: At program point L4197-2(lines 4196 4198) the Hoare annotation is: (and (= 0 |ULTIMATE.start_kbtab_probe_#res|) (<= ~ldv_coherent_state~0 1) (<= 1 ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0) (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 1) (= 0 ~res_kbtab_probe_3~0) (<= 1 ~ldv_urb_state~0)) [2019-01-15 10:51:45,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.01 10:51:45 BoogieIcfgContainer [2019-01-15 10:51:45,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-15 10:51:45,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-15 10:51:45,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-15 10:51:45,311 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-15 10:51:45,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 10:51:24" (3/4) ... [2019-01-15 10:51:45,316 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-15 10:51:45,342 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2019-01-15 10:51:45,344 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2019-01-15 10:51:45,345 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-01-15 10:51:45,347 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-15 10:51:45,402 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(retval == 0) && (1 <= \result || \result + 1 <= 0)) && ldv_coherent_state == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) [2019-01-15 10:51:45,404 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) || (1 <= ldv_s_kbtab_driver_usb_driver && 0 == res_kbtab_probe_3 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1))) || ((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) [2019-01-15 10:51:45,404 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) || (1 <= ldv_s_kbtab_driver_usb_driver && 0 == res_kbtab_probe_3 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1))) || ((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) [2019-01-15 10:51:45,404 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= ldv_s_kbtab_driver_usb_driver && ((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((0 == \result && 1 <= ldv_s_kbtab_driver_usb_driver) && (!(ldv_s_kbtab_driver_usb_driver == 1) && 1 <= ldv_coherent_state) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || ((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) [2019-01-15 10:51:45,410 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-01-15 10:51:45,410 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-01-15 10:51:45,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-01-15 10:51:45,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-01-15 10:51:45,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-01-15 10:51:45,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-01-15 10:51:45,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state [2019-01-15 10:51:45,412 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-01-15 10:51:45,418 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-01-15 10:51:45,418 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-01-15 10:51:45,418 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 [2019-01-15 10:51:45,419 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && !(\result == 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) || (ldv_coherent_state == 0 && ((!(\result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver)) || ((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && 0 == ldv_s_kbtab_driver_usb_driver) [2019-01-15 10:51:45,419 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && (!(0 == \result) || !(\result == 0))) && ldv_s_kbtab_driver_usb_driver == 0) || (((((0 == \result && ldv_coherent_state == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && 0 == ldv_s_kbtab_driver_usb_driver) [2019-01-15 10:51:45,419 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && 0 == ldv_s_kbtab_driver_usb_driver) || (((((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && !(res_kbtab_probe_3 == 0)) && !(\result == 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && ldv_coherent_state == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((!(res_kbtab_probe_3 == 0) && !(\result == 0)) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 0) [2019-01-15 10:51:45,427 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(\result == 0) || !(0 == \result)) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && 0 == \result) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver) && 0 == \result) [2019-01-15 10:51:45,623 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-15 10:51:45,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-15 10:51:45,625 INFO L168 Benchmark]: Toolchain (without parser) took 25695.45 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 426.2 MB). Free memory was 946.0 MB in the beginning and 925.6 MB in the end (delta: 20.4 MB). Peak memory consumption was 446.7 MB. Max. memory is 11.5 GB. [2019-01-15 10:51:45,625 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-15 10:51:45,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1703.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. [2019-01-15 10:51:45,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.13 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. [2019-01-15 10:51:45,626 INFO L168 Benchmark]: Boogie Preprocessor took 139.10 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-15 10:51:45,627 INFO L168 Benchmark]: RCFGBuilder took 2468.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.1 MB in the end (delta: 151.8 MB). Peak memory consumption was 151.8 MB. Max. memory is 11.5 GB. [2019-01-15 10:51:45,627 INFO L168 Benchmark]: TraceAbstraction took 20918.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 259.0 MB). Free memory was 948.1 MB in the beginning and 997.3 MB in the end (delta: -49.2 MB). Peak memory consumption was 291.2 MB. Max. memory is 11.5 GB. [2019-01-15 10:51:45,627 INFO L168 Benchmark]: Witness Printer took 313.09 ms. Allocated memory is still 1.5 GB. Free memory was 997.3 MB in the beginning and 925.6 MB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. [2019-01-15 10:51:45,629 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1703.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.0 MB). Peak memory consumption was 68.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 146.13 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 139.10 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2468.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.1 MB in the end (delta: 151.8 MB). Peak memory consumption was 151.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20918.77 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 259.0 MB). Free memory was 948.1 MB in the beginning and 997.3 MB in the end (delta: -49.2 MB). Peak memory consumption was 291.2 MB. Max. memory is 11.5 GB. * Witness Printer took 313.09 ms. Allocated memory is still 1.5 GB. Free memory was 997.3 MB in the beginning and 925.6 MB in the end (delta: 71.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 4054]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && (!(0 == \result) || !(\result == 0))) && ldv_s_kbtab_driver_usb_driver == 0) || (((((0 == \result && ldv_coherent_state == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == \result) && 0 == ldv_s_kbtab_driver_usb_driver) - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3996]: Loop Invariant Derived loop invariant: (((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && 0 == ldv_s_kbtab_driver_usb_driver) || (((((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && !(res_kbtab_probe_3 == 0)) && !(\result == 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && ldv_coherent_state == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((!(res_kbtab_probe_3 == 0) && !(\result == 0)) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 0) - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3453]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4117]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4222]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4172]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4248]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4169]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3383]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4230]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3985]: Loop Invariant Derived loop invariant: (((1 <= ldv_s_kbtab_driver_usb_driver && ((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1)) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((0 == \result && 1 <= ldv_s_kbtab_driver_usb_driver) && (!(ldv_s_kbtab_driver_usb_driver == 1) && 1 <= ldv_coherent_state) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || ((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) - InvariantResult [Line: 3383]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: (((((0 == \result && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3410]: Loop Invariant Derived loop invariant: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 3421]: Loop Invariant Derived loop invariant: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4138]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3437]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3421]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4212]: Loop Invariant Derived loop invariant: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: ((((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) || ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3430]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4138]: Loop Invariant Derived loop invariant: (((((0 == \result && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: ((((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) || ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver) - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3967]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3494]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: (((((((0 == \result && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) || (1 <= ldv_s_kbtab_driver_usb_driver && 0 == res_kbtab_probe_3 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1))) || ((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3982]: Loop Invariant Derived loop invariant: (((((((0 == \result && !(ldv_s_kbtab_driver_usb_driver == 1)) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) || (1 <= ldv_s_kbtab_driver_usb_driver && 0 == res_kbtab_probe_3 && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && !(ldv_s_kbtab_driver_usb_driver == 1))) || ((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state)) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: (((ldv_urb_state == 0 && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 0) || ((((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4209]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4060]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3899]: Loop Invariant Derived loop invariant: ((!(retval == 0) && ldv_coherent_state == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3500]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3949]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3513]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4046]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4202]: Loop Invariant Derived loop invariant: (((ldv_urb_state == 0 && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 0) || ((((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4188]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: (((((0 == \result && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3897]: Loop Invariant Derived loop invariant: (((!(retval == 0) && (1 <= \result || \result + 1 <= 0)) && ldv_coherent_state == 0) && ldv_urb_state == 0) || ((ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) - InvariantResult [Line: 3393]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: ((((((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr) && ldv_coherent_state == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver) || ((((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3770]: Loop Invariant Derived loop invariant: ((((((((!(error == 0) && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && !(\result == 0)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0) || (ldv_coherent_state == 0 && ((!(\result == 0) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver)) || ((((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && 0 == ldv_s_kbtab_driver_usb_driver) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4188]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3393]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4112]: Loop Invariant Derived loop invariant: ((((((((!(\result == 0) || !(0 == \result)) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0) || ((((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && 0 == \result) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == ldv_s_kbtab_driver_usb_driver) && 0 == \result) - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4142]: Loop Invariant Derived loop invariant: (((((!(error == 0) && ldv_coherent_state <= 1) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4192]: Loop Invariant Derived loop invariant: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 3557]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4142]: Loop Invariant Derived loop invariant: (((((0 == \result && ldv_coherent_state <= 1) && 1 <= ldv_s_kbtab_driver_usb_driver) && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && 1 <= ldv_urb_state - InvariantResult [Line: 4222]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state == 0) && error + 12 <= 0) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4196]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4240]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 3463]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state <= 1 && 1 <= ldv_coherent_state) && ldv_urb_state <= 1) && 0 == res_kbtab_probe_3) && error + 12 <= 0) && 1 <= ldv_urb_state) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 4218]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((0 == \result && ((urb + urb) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((urb + urb) / 18446744073709551616) + 1 <= urb + urb)) && ((addr + addr) / 18446744073709551616 + 1 <= 0 || 18446744073709551616 * ((addr + addr) / 18446744073709551616) < addr + addr)) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == res_kbtab_probe_3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 6 error locations. SAFE Result, 20.7s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 6.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 3031 SDtfs, 1869 SDslu, 4147 SDs, 0 SdLazy, 283 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=11, 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: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 1279 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 185 NumberOfFragments, 2151 HoareAnnotationTreeSize, 68 FomulaSimplifications, 126665 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 68 FomulaSimplificationsInter, 8225 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1036 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1017 ConstructedInterpolants, 0 QuantifiedInterpolants, 133976 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1065 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 13/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...