./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.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-usb-serial-ir-usb.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 1878e01b767e6e751a367f4dffe6089a256b4c0e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-13 06:14:29,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 06:14:29,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 06:14:29,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 06:14:29,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 06:14:29,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 06:14:29,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 06:14:29,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 06:14:29,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 06:14:29,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 06:14:29,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 06:14:29,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 06:14:29,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 06:14:29,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 06:14:29,213 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 06:14:29,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 06:14:29,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 06:14:29,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 06:14:29,220 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 06:14:29,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 06:14:29,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 06:14:29,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 06:14:29,227 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 06:14:29,228 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 06:14:29,228 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 06:14:29,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 06:14:29,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 06:14:29,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 06:14:29,232 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 06:14:29,233 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 06:14:29,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 06:14:29,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 06:14:29,235 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 06:14:29,235 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 06:14:29,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 06:14:29,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 06:14:29,238 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-01-13 06:14:29,261 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 06:14:29,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 06:14:29,263 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 06:14:29,263 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 06:14:29,263 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 06:14:29,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 06:14:29,264 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 06:14:29,264 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 06:14:29,264 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 06:14:29,264 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 06:14:29,264 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 06:14:29,264 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 06:14:29,265 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 06:14:29,265 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 06:14:29,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 06:14:29,265 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 06:14:29,265 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 06:14:29,265 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 06:14:29,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 06:14:29,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 06:14:29,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 06:14:29,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 06:14:29,266 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 06:14:29,266 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 06:14:29,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 06:14:29,267 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-13 06:14:29,267 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 -> 1878e01b767e6e751a367f4dffe6089a256b4c0e [2019-01-13 06:14:29,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 06:14:29,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 06:14:29,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 06:14:29,335 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 06:14:29,336 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 06:14:29,337 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko_true-unreach-call.cil.out.i [2019-01-13 06:14:29,405 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a33f8079/a499694075e148e990f35f06cb5f26ae/FLAG8debba679 [2019-01-13 06:14:30,171 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 06:14:30,173 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko_true-unreach-call.cil.out.i [2019-01-13 06:14:30,207 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a33f8079/a499694075e148e990f35f06cb5f26ae/FLAG8debba679 [2019-01-13 06:14:30,380 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a33f8079/a499694075e148e990f35f06cb5f26ae [2019-01-13 06:14:30,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 06:14:30,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 06:14:30,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 06:14:30,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 06:14:30,393 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 06:14:30,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 06:14:30" (1/1) ... [2019-01-13 06:14:30,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71175489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:30, skipping insertion in model container [2019-01-13 06:14:30,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 06:14:30" (1/1) ... [2019-01-13 06:14:30,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 06:14:30,527 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 06:14:31,764 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 06:14:31,818 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 06:14:32,052 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 06:14:32,134 INFO L195 MainTranslator]: Completed translation [2019-01-13 06:14:32,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32 WrapperNode [2019-01-13 06:14:32,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 06:14:32,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 06:14:32,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 06:14:32,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 06:14:32,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (1/1) ... [2019-01-13 06:14:32,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (1/1) ... [2019-01-13 06:14:32,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 06:14:32,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 06:14:32,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 06:14:32,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 06:14:32,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (1/1) ... [2019-01-13 06:14:32,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (1/1) ... [2019-01-13 06:14:32,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (1/1) ... [2019-01-13 06:14:32,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (1/1) ... [2019-01-13 06:14:32,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (1/1) ... [2019-01-13 06:14:32,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (1/1) ... [2019-01-13 06:14:32,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (1/1) ... [2019-01-13 06:14:32,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 06:14:32,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 06:14:32,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 06:14:32,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 06:14:32,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (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-13 06:14:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 06:14:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 06:14:32,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 06:14:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 06:14:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 06:14:32,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 06:14:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 06:14:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-13 06:14:32,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 06:14:32,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 06:14:33,333 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 06:14:33,341 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 06:14:33,345 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 06:14:33,349 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 06:14:33,390 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 06:14:37,403 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume !false; [2019-01-13 06:14:37,403 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume false; [2019-01-13 06:14:37,403 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2019-01-13 06:14:37,403 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2019-01-13 06:14:37,404 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##334: assume !false; [2019-01-13 06:14:37,404 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##333: assume false; [2019-01-13 06:14:37,404 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume !false; [2019-01-13 06:14:37,404 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume false; [2019-01-13 06:14:37,404 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##125: assume !false; [2019-01-13 06:14:37,404 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##124: assume false; [2019-01-13 06:14:37,406 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 06:14:37,406 INFO L286 CfgBuilder]: Removed 156 assue(true) statements. [2019-01-13 06:14:37,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 06:14:37 BoogieIcfgContainer [2019-01-13 06:14:37,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 06:14:37,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 06:14:37,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 06:14:37,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 06:14:37,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 06:14:30" (1/3) ... [2019-01-13 06:14:37,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c4496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 06:14:37, skipping insertion in model container [2019-01-13 06:14:37,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 06:14:32" (2/3) ... [2019-01-13 06:14:37,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c4496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 06:14:37, skipping insertion in model container [2019-01-13 06:14:37,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 06:14:37" (3/3) ... [2019-01-13 06:14:37,418 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko_true-unreach-call.cil.out.i [2019-01-13 06:14:37,428 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 06:14:37,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-13 06:14:37,452 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-13 06:14:37,490 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 06:14:37,491 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 06:14:37,491 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 06:14:37,491 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 06:14:37,491 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 06:14:37,492 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 06:14:37,492 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 06:14:37,492 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 06:14:37,492 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 06:14:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2019-01-13 06:14:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 06:14:37,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:37,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 06:14:37,529 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:37,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:37,535 INFO L82 PathProgramCache]: Analyzing trace with hash 986721245, now seen corresponding path program 1 times [2019-01-13 06:14:37,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:37,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:37,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:37,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:37,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:38,263 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-13 06:14:38,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:38,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 06:14:38,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 06:14:38,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 06:14:38,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 06:14:38,288 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 4 states. [2019-01-13 06:14:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:39,370 INFO L93 Difference]: Finished difference Result 776 states and 1190 transitions. [2019-01-13 06:14:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 06:14:39,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-13 06:14:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:39,391 INFO L225 Difference]: With dead ends: 776 [2019-01-13 06:14:39,392 INFO L226 Difference]: Without dead ends: 494 [2019-01-13 06:14:39,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-13 06:14:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-01-13 06:14:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 268. [2019-01-13 06:14:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-01-13 06:14:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2019-01-13 06:14:39,473 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 12 [2019-01-13 06:14:39,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:39,473 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2019-01-13 06:14:39,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 06:14:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2019-01-13 06:14:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 06:14:39,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:39,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 06:14:39,474 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1666779615, now seen corresponding path program 1 times [2019-01-13 06:14:39,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:39,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:39,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:39,709 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-13 06:14:39,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:39,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 06:14:39,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 06:14:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 06:14:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 06:14:39,715 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand 3 states. [2019-01-13 06:14:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:39,941 INFO L93 Difference]: Finished difference Result 769 states and 1032 transitions. [2019-01-13 06:14:39,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 06:14:39,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-13 06:14:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:39,949 INFO L225 Difference]: With dead ends: 769 [2019-01-13 06:14:39,950 INFO L226 Difference]: Without dead ends: 515 [2019-01-13 06:14:39,957 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-13 06:14:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-01-13 06:14:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2019-01-13 06:14:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-01-13 06:14:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 687 transitions. [2019-01-13 06:14:40,022 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 687 transitions. Word has length 12 [2019-01-13 06:14:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:40,023 INFO L480 AbstractCegarLoop]: Abstraction has 511 states and 687 transitions. [2019-01-13 06:14:40,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 06:14:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 687 transitions. [2019-01-13 06:14:40,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-13 06:14:40,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:40,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 06:14:40,026 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:40,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash 130559946, now seen corresponding path program 1 times [2019-01-13 06:14:40,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:40,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:40,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:40,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:40,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:40,226 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-13 06:14:40,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:40,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 06:14:40,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 06:14:40,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 06:14:40,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 06:14:40,230 INFO L87 Difference]: Start difference. First operand 511 states and 687 transitions. Second operand 3 states. [2019-01-13 06:14:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:40,248 INFO L93 Difference]: Finished difference Result 511 states and 687 transitions. [2019-01-13 06:14:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 06:14:40,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-13 06:14:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:40,253 INFO L225 Difference]: With dead ends: 511 [2019-01-13 06:14:40,254 INFO L226 Difference]: Without dead ends: 505 [2019-01-13 06:14:40,255 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-13 06:14:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-01-13 06:14:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-01-13 06:14:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-13 06:14:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 678 transitions. [2019-01-13 06:14:40,288 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 678 transitions. Word has length 13 [2019-01-13 06:14:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:40,289 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 678 transitions. [2019-01-13 06:14:40,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 06:14:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 678 transitions. [2019-01-13 06:14:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 06:14:40,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:40,294 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] [2019-01-13 06:14:40,294 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash -946322374, now seen corresponding path program 1 times [2019-01-13 06:14:40,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:40,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:40,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:40,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:40,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:40,565 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-13 06:14:40,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:40,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 06:14:40,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 06:14:40,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 06:14:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 06:14:40,568 INFO L87 Difference]: Start difference. First operand 505 states and 678 transitions. Second operand 4 states. [2019-01-13 06:14:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:41,723 INFO L93 Difference]: Finished difference Result 1434 states and 1943 transitions. [2019-01-13 06:14:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 06:14:41,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-01-13 06:14:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:41,730 INFO L225 Difference]: With dead ends: 1434 [2019-01-13 06:14:41,730 INFO L226 Difference]: Without dead ends: 943 [2019-01-13 06:14:41,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-13 06:14:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-01-13 06:14:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 931. [2019-01-13 06:14:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-01-13 06:14:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1269 transitions. [2019-01-13 06:14:41,783 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1269 transitions. Word has length 48 [2019-01-13 06:14:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:41,783 INFO L480 AbstractCegarLoop]: Abstraction has 931 states and 1269 transitions. [2019-01-13 06:14:41,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 06:14:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1269 transitions. [2019-01-13 06:14:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-13 06:14:41,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:41,789 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] [2019-01-13 06:14:41,789 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:41,791 INFO L82 PathProgramCache]: Analyzing trace with hash 439881020, now seen corresponding path program 1 times [2019-01-13 06:14:41,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:41,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:41,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:41,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:41,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:42,154 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-13 06:14:42,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:42,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 06:14:42,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 06:14:42,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 06:14:42,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 06:14:42,157 INFO L87 Difference]: Start difference. First operand 931 states and 1269 transitions. Second operand 4 states. [2019-01-13 06:14:42,451 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 06:14:43,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:43,046 INFO L93 Difference]: Finished difference Result 2412 states and 3289 transitions. [2019-01-13 06:14:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 06:14:43,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-01-13 06:14:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:43,058 INFO L225 Difference]: With dead ends: 2412 [2019-01-13 06:14:43,058 INFO L226 Difference]: Without dead ends: 1947 [2019-01-13 06:14:43,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 06:14:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-01-13 06:14:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 935. [2019-01-13 06:14:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-01-13 06:14:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1273 transitions. [2019-01-13 06:14:43,143 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1273 transitions. Word has length 48 [2019-01-13 06:14:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:43,143 INFO L480 AbstractCegarLoop]: Abstraction has 935 states and 1273 transitions. [2019-01-13 06:14:43,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 06:14:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1273 transitions. [2019-01-13 06:14:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 06:14:43,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:43,149 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] [2019-01-13 06:14:43,150 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:43,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash -502576155, now seen corresponding path program 1 times [2019-01-13 06:14:43,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:43,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:43,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:43,527 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-13 06:14:43,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:43,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 06:14:43,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 06:14:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 06:14:43,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 06:14:43,529 INFO L87 Difference]: Start difference. First operand 935 states and 1273 transitions. Second operand 4 states. [2019-01-13 06:14:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:43,996 INFO L93 Difference]: Finished difference Result 2659 states and 3642 transitions. [2019-01-13 06:14:43,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 06:14:43,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-01-13 06:14:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:44,010 INFO L225 Difference]: With dead ends: 2659 [2019-01-13 06:14:44,010 INFO L226 Difference]: Without dead ends: 1738 [2019-01-13 06:14:44,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 06:14:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-01-13 06:14:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 909. [2019-01-13 06:14:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-01-13 06:14:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1237 transitions. [2019-01-13 06:14:44,163 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1237 transitions. Word has length 50 [2019-01-13 06:14:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:44,164 INFO L480 AbstractCegarLoop]: Abstraction has 909 states and 1237 transitions. [2019-01-13 06:14:44,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 06:14:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1237 transitions. [2019-01-13 06:14:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 06:14:44,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:44,169 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] [2019-01-13 06:14:44,169 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:44,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:44,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1089382169, now seen corresponding path program 1 times [2019-01-13 06:14:44,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:44,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:44,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:44,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:44,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:44,468 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-13 06:14:44,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:44,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 06:14:44,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 06:14:44,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 06:14:44,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 06:14:44,472 INFO L87 Difference]: Start difference. First operand 909 states and 1237 transitions. Second operand 4 states. [2019-01-13 06:14:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:45,870 INFO L93 Difference]: Finished difference Result 4079 states and 5556 transitions. [2019-01-13 06:14:45,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 06:14:45,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-01-13 06:14:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:45,887 INFO L225 Difference]: With dead ends: 4079 [2019-01-13 06:14:45,888 INFO L226 Difference]: Without dead ends: 3184 [2019-01-13 06:14:45,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-13 06:14:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-01-13 06:14:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 1735. [2019-01-13 06:14:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-01-13 06:14:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2356 transitions. [2019-01-13 06:14:46,075 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2356 transitions. Word has length 50 [2019-01-13 06:14:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:46,075 INFO L480 AbstractCegarLoop]: Abstraction has 1735 states and 2356 transitions. [2019-01-13 06:14:46,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 06:14:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2356 transitions. [2019-01-13 06:14:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 06:14:46,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:46,079 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] [2019-01-13 06:14:46,080 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1353156781, now seen corresponding path program 1 times [2019-01-13 06:14:46,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:46,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:46,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:46,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:46,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:46,335 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-13 06:14:46,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:46,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 06:14:46,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 06:14:46,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 06:14:46,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 06:14:46,338 INFO L87 Difference]: Start difference. First operand 1735 states and 2356 transitions. Second operand 4 states. [2019-01-13 06:14:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:47,439 INFO L93 Difference]: Finished difference Result 3395 states and 4597 transitions. [2019-01-13 06:14:47,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 06:14:47,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-01-13 06:14:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:47,448 INFO L225 Difference]: With dead ends: 3395 [2019-01-13 06:14:47,448 INFO L226 Difference]: Without dead ends: 1674 [2019-01-13 06:14:47,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-13 06:14:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-01-13 06:14:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1659. [2019-01-13 06:14:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-01-13 06:14:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2240 transitions. [2019-01-13 06:14:47,666 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2240 transitions. Word has length 50 [2019-01-13 06:14:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:47,666 INFO L480 AbstractCegarLoop]: Abstraction has 1659 states and 2240 transitions. [2019-01-13 06:14:47,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 06:14:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2240 transitions. [2019-01-13 06:14:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 06:14:47,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:47,670 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] [2019-01-13 06:14:47,670 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1701579105, now seen corresponding path program 1 times [2019-01-13 06:14:47,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:47,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:47,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:47,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:47,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:47,912 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-13 06:14:47,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:47,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 06:14:47,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 06:14:47,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 06:14:47,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 06:14:47,913 INFO L87 Difference]: Start difference. First operand 1659 states and 2240 transitions. Second operand 4 states. [2019-01-13 06:14:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:50,145 INFO L93 Difference]: Finished difference Result 2514 states and 3396 transitions. [2019-01-13 06:14:50,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 06:14:50,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-13 06:14:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:50,160 INFO L225 Difference]: With dead ends: 2514 [2019-01-13 06:14:50,160 INFO L226 Difference]: Without dead ends: 2510 [2019-01-13 06:14:50,162 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-13 06:14:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-01-13 06:14:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2505. [2019-01-13 06:14:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2505 states. [2019-01-13 06:14:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3384 transitions. [2019-01-13 06:14:50,481 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3384 transitions. Word has length 58 [2019-01-13 06:14:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:50,481 INFO L480 AbstractCegarLoop]: Abstraction has 2505 states and 3384 transitions. [2019-01-13 06:14:50,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 06:14:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3384 transitions. [2019-01-13 06:14:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 06:14:50,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:50,486 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] [2019-01-13 06:14:50,486 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1031851433, now seen corresponding path program 1 times [2019-01-13 06:14:50,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:50,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:50,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:50,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:50,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:50,773 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-13 06:14:50,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:50,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 06:14:50,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 06:14:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 06:14:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 06:14:50,775 INFO L87 Difference]: Start difference. First operand 2505 states and 3384 transitions. Second operand 3 states. [2019-01-13 06:14:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:51,167 INFO L93 Difference]: Finished difference Result 3428 states and 4620 transitions. [2019-01-13 06:14:51,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 06:14:51,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-01-13 06:14:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:51,178 INFO L225 Difference]: With dead ends: 3428 [2019-01-13 06:14:51,180 INFO L226 Difference]: Without dead ends: 1721 [2019-01-13 06:14:51,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 06:14:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-01-13 06:14:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2019-01-13 06:14:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1721 states. [2019-01-13 06:14:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2302 transitions. [2019-01-13 06:14:51,425 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2302 transitions. Word has length 64 [2019-01-13 06:14:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:51,425 INFO L480 AbstractCegarLoop]: Abstraction has 1721 states and 2302 transitions. [2019-01-13 06:14:51,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 06:14:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2302 transitions. [2019-01-13 06:14:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 06:14:51,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:51,430 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] [2019-01-13 06:14:51,431 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1779804946, now seen corresponding path program 1 times [2019-01-13 06:14:51,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:51,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:51,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:51,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:52,011 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-13 06:14:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 06:14:52,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:52,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 06:14:52,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 06:14:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 06:14:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 06:14:52,258 INFO L87 Difference]: Start difference. First operand 1721 states and 2302 transitions. Second operand 5 states. [2019-01-13 06:14:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:52,480 INFO L93 Difference]: Finished difference Result 3430 states and 4590 transitions. [2019-01-13 06:14:52,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 06:14:52,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 06:14:52,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:52,489 INFO L225 Difference]: With dead ends: 3430 [2019-01-13 06:14:52,490 INFO L226 Difference]: Without dead ends: 1719 [2019-01-13 06:14:52,493 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-13 06:14:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-01-13 06:14:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-01-13 06:14:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-01-13 06:14:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2298 transitions. [2019-01-13 06:14:52,706 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2298 transitions. Word has length 66 [2019-01-13 06:14:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:52,706 INFO L480 AbstractCegarLoop]: Abstraction has 1719 states and 2298 transitions. [2019-01-13 06:14:52,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 06:14:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2298 transitions. [2019-01-13 06:14:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 06:14:52,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 06:14:52,711 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-13 06:14:52,711 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 06:14:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 06:14:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash 981368905, now seen corresponding path program 1 times [2019-01-13 06:14:52,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 06:14:52,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 06:14:52,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:52,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 06:14:52,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 06:14:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 06:14:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 06:14:53,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 06:14:53,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 06:14:53,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 06:14:53,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 06:14:53,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 06:14:53,074 INFO L87 Difference]: Start difference. First operand 1719 states and 2298 transitions. Second operand 4 states. [2019-01-13 06:14:54,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 06:14:54,179 INFO L93 Difference]: Finished difference Result 1719 states and 2298 transitions. [2019-01-13 06:14:54,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 06:14:54,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-01-13 06:14:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 06:14:54,180 INFO L225 Difference]: With dead ends: 1719 [2019-01-13 06:14:54,180 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 06:14:54,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 06:14:54,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 06:14:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 06:14:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 06:14:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 06:14:54,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2019-01-13 06:14:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 06:14:54,184 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 06:14:54,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 06:14:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 06:14:54,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 06:14:54,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-13 06:14:54,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:54,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:55,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-13 06:14:56,437 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 15 [2019-01-13 06:14:56,838 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 15 [2019-01-13 06:14:57,546 INFO L448 ceAbstractionStarter]: For program point L4065-1(lines 4065 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,546 INFO L448 ceAbstractionStarter]: For program point L4065(lines 4065 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,547 INFO L444 ceAbstractionStarter]: At program point L5056(lines 5055 5057) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,547 INFO L444 ceAbstractionStarter]: At program point L5123(lines 1 5144) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= 0 ~ir_add_bof~0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|))) [2019-01-13 06:14:57,547 INFO L444 ceAbstractionStarter]: At program point L5123-1(lines 5035 5040) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,547 INFO L448 ceAbstractionStarter]: For program point L4199(lines 4199 4254) no Hoare annotation was computed. [2019-01-13 06:14:57,547 INFO L444 ceAbstractionStarter]: At program point L4001loopEntry(lines 4001 4016) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,547 INFO L444 ceAbstractionStarter]: At program point L4266loopEntry(lines 4266 4276) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,547 INFO L444 ceAbstractionStarter]: At program point L4200(lines 4199 4254) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,548 INFO L448 ceAbstractionStarter]: For program point L4068(lines 4068 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,548 INFO L448 ceAbstractionStarter]: For program point L4002(line 4002) no Hoare annotation was computed. [2019-01-13 06:14:57,548 INFO L448 ceAbstractionStarter]: For program point L4068-1(lines 4068 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,548 INFO L448 ceAbstractionStarter]: For program point L4267(line 4267) no Hoare annotation was computed. [2019-01-13 06:14:57,548 INFO L444 ceAbstractionStarter]: At program point L4069-1(lines 4065 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,548 INFO L444 ceAbstractionStarter]: At program point L5060-1(lines 5059 5061) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,548 INFO L444 ceAbstractionStarter]: At program point L4069(lines 4065 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,548 INFO L448 ceAbstractionStarter]: For program point L4994(lines 4979 4995) no Hoare annotation was computed. [2019-01-13 06:14:57,548 INFO L444 ceAbstractionStarter]: At program point L5060(lines 5059 5061) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,548 INFO L448 ceAbstractionStarter]: For program point L4003(lines 4003 4014) no Hoare annotation was computed. [2019-01-13 06:14:57,549 INFO L448 ceAbstractionStarter]: For program point L3871(line 3871) no Hoare annotation was computed. [2019-01-13 06:14:57,549 INFO L444 ceAbstractionStarter]: At program point L3673(lines 3666 3675) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,549 INFO L448 ceAbstractionStarter]: For program point L4202(lines 4202 4254) no Hoare annotation was computed. [2019-01-13 06:14:57,549 INFO L448 ceAbstractionStarter]: For program point L4268(lines 4268 4274) no Hoare annotation was computed. [2019-01-13 06:14:57,549 INFO L444 ceAbstractionStarter]: At program point L5127(lines 5126 5128) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,549 INFO L448 ceAbstractionStarter]: For program point L4004(lines 4004 4008) no Hoare annotation was computed. [2019-01-13 06:14:57,549 INFO L448 ceAbstractionStarter]: For program point L4004-2(lines 4004 4008) no Hoare annotation was computed. [2019-01-13 06:14:57,549 INFO L448 ceAbstractionStarter]: For program point L3872(lines 3872 3878) no Hoare annotation was computed. [2019-01-13 06:14:57,549 INFO L444 ceAbstractionStarter]: At program point L4203(lines 4202 4254) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,549 INFO L448 ceAbstractionStarter]: For program point L4071-1(lines 4071 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,549 INFO L448 ceAbstractionStarter]: For program point L4071(lines 4071 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,550 INFO L444 ceAbstractionStarter]: At program point L4534(lines 4502 4535) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,550 INFO L444 ceAbstractionStarter]: At program point L4468(lines 4456 4469) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,550 INFO L444 ceAbstractionStarter]: At program point L4072(lines 4071 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,550 INFO L444 ceAbstractionStarter]: At program point L4072-1(lines 4071 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,550 INFO L444 ceAbstractionStarter]: At program point L4997(lines 4975 4999) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_usb_alloc_urb_#res.offset|)) (.cse1 (= ~ldv_coherent_state~0 0))) (or (and .cse0 .cse1 (= ~ldv_urb_state~0 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res.base|)) (and (or (not (= |ULTIMATE.start_usb_alloc_urb_#res.base| 0)) (not .cse0)) (<= ~ldv_urb_state~0 1) .cse1 (<= 1 ~ldv_urb_state~0)))) [2019-01-13 06:14:57,550 INFO L444 ceAbstractionStarter]: At program point L4337(lines 4320 4338) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,550 INFO L448 ceAbstractionStarter]: For program point L4205(lines 4205 4254) no Hoare annotation was computed. [2019-01-13 06:14:57,550 INFO L444 ceAbstractionStarter]: At program point L4139loopEntry(lines 4139 4195) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,550 INFO L444 ceAbstractionStarter]: At program point L5064(lines 5063 5065) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,551 INFO L444 ceAbstractionStarter]: At program point L3941(lines 3808 3960) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,551 INFO L444 ceAbstractionStarter]: At program point L3611(lines 3608 3613) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,551 INFO L444 ceAbstractionStarter]: At program point L4206(lines 4205 4254) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,551 INFO L444 ceAbstractionStarter]: At program point L5131(lines 5130 5132) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= 0 ~ir_add_bof~0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|))) [2019-01-13 06:14:57,551 INFO L448 ceAbstractionStarter]: For program point L4140(line 4140) no Hoare annotation was computed. [2019-01-13 06:14:57,551 INFO L448 ceAbstractionStarter]: For program point L4074(lines 4074 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,551 INFO L448 ceAbstractionStarter]: For program point L4074-1(lines 4074 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,551 INFO L444 ceAbstractionStarter]: At program point L3810loopEntry(lines 3810 3820) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,551 INFO L448 ceAbstractionStarter]: For program point L4537-2(lines 4537 4545) no Hoare annotation was computed. [2019-01-13 06:14:57,552 INFO L448 ceAbstractionStarter]: For program point L4537(lines 4537 4545) no Hoare annotation was computed. [2019-01-13 06:14:57,552 INFO L448 ceAbstractionStarter]: For program point L4141(lines 4141 4193) no Hoare annotation was computed. [2019-01-13 06:14:57,552 INFO L444 ceAbstractionStarter]: At program point L4075-1(lines 4074 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,552 INFO L444 ceAbstractionStarter]: At program point L4075(lines 4074 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,552 INFO L448 ceAbstractionStarter]: For program point L3811(line 3811) no Hoare annotation was computed. [2019-01-13 06:14:57,552 INFO L448 ceAbstractionStarter]: For program point L4142(lines 4142 4146) no Hoare annotation was computed. [2019-01-13 06:14:57,552 INFO L448 ceAbstractionStarter]: For program point L4208(lines 4208 4254) no Hoare annotation was computed. [2019-01-13 06:14:57,552 INFO L448 ceAbstractionStarter]: For program point L4142-2(lines 4142 4146) no Hoare annotation was computed. [2019-01-13 06:14:57,552 INFO L448 ceAbstractionStarter]: For program point L3812(lines 3812 3818) no Hoare annotation was computed. [2019-01-13 06:14:57,552 INFO L448 ceAbstractionStarter]: For program point L4605-2(lines 4605 4609) no Hoare annotation was computed. [2019-01-13 06:14:57,552 INFO L448 ceAbstractionStarter]: For program point L4605(lines 4605 4609) no Hoare annotation was computed. [2019-01-13 06:14:57,553 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-01-13 06:14:57,553 INFO L444 ceAbstractionStarter]: At program point L4209(lines 4208 4254) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,553 INFO L448 ceAbstractionStarter]: For program point L4077-1(lines 4077 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,553 INFO L448 ceAbstractionStarter]: For program point L4077(lines 4077 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,553 INFO L448 ceAbstractionStarter]: For program point L4474(lines 4474 4536) no Hoare annotation was computed. [2019-01-13 06:14:57,553 INFO L444 ceAbstractionStarter]: At program point L5135(lines 5134 5136) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,553 INFO L444 ceAbstractionStarter]: At program point L4078(lines 4077 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,553 INFO L444 ceAbstractionStarter]: At program point L4078-1(lines 4077 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,553 INFO L448 ceAbstractionStarter]: For program point L3946(line 3946) no Hoare annotation was computed. [2019-01-13 06:14:57,553 INFO L448 ceAbstractionStarter]: For program point L4805(lines 4805 4808) no Hoare annotation was computed. [2019-01-13 06:14:57,554 INFO L444 ceAbstractionStarter]: At program point L4475(lines 4474 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,554 INFO L448 ceAbstractionStarter]: For program point L4211(lines 4211 4254) no Hoare annotation was computed. [2019-01-13 06:14:57,554 INFO L444 ceAbstractionStarter]: At program point L4277(lines 4265 4278) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,554 INFO L448 ceAbstractionStarter]: For program point L3947(lines 3947 3953) no Hoare annotation was computed. [2019-01-13 06:14:57,554 INFO L444 ceAbstractionStarter]: At program point L3881(lines 3808 3960) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,554 INFO L444 ceAbstractionStarter]: At program point L3683(lines 3677 3685) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= 0 ~ir_add_bof~0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|))) [2019-01-13 06:14:57,554 INFO L444 ceAbstractionStarter]: At program point L4212(lines 4211 4254) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,554 INFO L448 ceAbstractionStarter]: For program point L4080(lines 4080 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,554 INFO L448 ceAbstractionStarter]: For program point L4080-1(lines 4080 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,555 INFO L444 ceAbstractionStarter]: At program point L5005-2loopEntry(lines 5005 5024) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,555 INFO L444 ceAbstractionStarter]: At program point L5005loopEntry(lines 5005 5024) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,555 INFO L444 ceAbstractionStarter]: At program point L3618loopEntry(lines 3618 3624) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,555 INFO L448 ceAbstractionStarter]: For program point L4477(lines 4477 4536) no Hoare annotation was computed. [2019-01-13 06:14:57,555 INFO L448 ceAbstractionStarter]: For program point L4345-2(lines 4345 4355) no Hoare annotation was computed. [2019-01-13 06:14:57,555 INFO L448 ceAbstractionStarter]: For program point L4345(lines 4345 4355) no Hoare annotation was computed. [2019-01-13 06:14:57,555 INFO L448 ceAbstractionStarter]: For program point L4147(lines 4147 4151) no Hoare annotation was computed. [2019-01-13 06:14:57,555 INFO L444 ceAbstractionStarter]: At program point L4081-1(lines 4080 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,555 INFO L444 ceAbstractionStarter]: At program point L4081(lines 4080 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,555 INFO L448 ceAbstractionStarter]: For program point L5006(lines 5005 5024) no Hoare annotation was computed. [2019-01-13 06:14:57,555 INFO L448 ceAbstractionStarter]: For program point L4147-2(lines 4147 4151) no Hoare annotation was computed. [2019-01-13 06:14:57,556 INFO L448 ceAbstractionStarter]: For program point L5006-1(lines 5005 5024) no Hoare annotation was computed. [2019-01-13 06:14:57,556 INFO L448 ceAbstractionStarter]: For program point L3619(line 3619) no Hoare annotation was computed. [2019-01-13 06:14:57,556 INFO L444 ceAbstractionStarter]: At program point L4478(lines 4477 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,556 INFO L448 ceAbstractionStarter]: For program point L4214(lines 4214 4254) no Hoare annotation was computed. [2019-01-13 06:14:57,556 INFO L444 ceAbstractionStarter]: At program point L5139(lines 5138 5140) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,556 INFO L444 ceAbstractionStarter]: At program point L5139-1(lines 5138 5140) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,556 INFO L448 ceAbstractionStarter]: For program point L5007(lines 5005 5024) no Hoare annotation was computed. [2019-01-13 06:14:57,556 INFO L448 ceAbstractionStarter]: For program point L5007-1(lines 5005 5024) no Hoare annotation was computed. [2019-01-13 06:14:57,556 INFO L444 ceAbstractionStarter]: At program point L5139-2(lines 5138 5140) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,556 INFO L444 ceAbstractionStarter]: At program point L5139-3(lines 5138 5140) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,557 INFO L444 ceAbstractionStarter]: At program point L4215(lines 4214 4254) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,557 INFO L444 ceAbstractionStarter]: At program point L5074(lines 4848 4851) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,557 INFO L444 ceAbstractionStarter]: At program point L4083-1(lines 4082 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,557 INFO L444 ceAbstractionStarter]: At program point L4083(lines 4082 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,557 INFO L448 ceAbstractionStarter]: For program point L4480(lines 4480 4536) no Hoare annotation was computed. [2019-01-13 06:14:57,557 INFO L444 ceAbstractionStarter]: At program point L4282-2(lines 4282 4290) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,557 INFO L448 ceAbstractionStarter]: For program point L3886(line 3886) no Hoare annotation was computed. [2019-01-13 06:14:57,557 INFO L448 ceAbstractionStarter]: For program point L4613(lines 4613 4616) no Hoare annotation was computed. [2019-01-13 06:14:57,557 INFO L444 ceAbstractionStarter]: At program point L4481(lines 4480 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,558 INFO L448 ceAbstractionStarter]: For program point L4283(lines 4282 4290) no Hoare annotation was computed. [2019-01-13 06:14:57,558 INFO L444 ceAbstractionStarter]: At program point L5142(lines 1 5144) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,558 INFO L448 ceAbstractionStarter]: For program point L4217(lines 4217 4254) no Hoare annotation was computed. [2019-01-13 06:14:57,558 INFO L448 ceAbstractionStarter]: For program point L5142-1(lines 5142 5144) no Hoare annotation was computed. [2019-01-13 06:14:57,558 INFO L448 ceAbstractionStarter]: For program point L5142-2(lines 5142 5144) no Hoare annotation was computed. [2019-01-13 06:14:57,558 INFO L448 ceAbstractionStarter]: For program point L3887(lines 3887 3893) no Hoare annotation was computed. [2019-01-13 06:14:57,558 INFO L444 ceAbstractionStarter]: At program point L3821(lines 3808 3960) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,558 INFO L448 ceAbstractionStarter]: For program point L4812(line 4812) no Hoare annotation was computed. [2019-01-13 06:14:57,558 INFO L444 ceAbstractionStarter]: At program point L4218(lines 4217 4254) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,558 INFO L448 ceAbstractionStarter]: For program point L4284(lines 4284 4287) no Hoare annotation was computed. [2019-01-13 06:14:57,558 INFO L448 ceAbstractionStarter]: For program point L4152(lines 4152 4156) no Hoare annotation was computed. [2019-01-13 06:14:57,559 INFO L448 ceAbstractionStarter]: For program point L4152-2(lines 4152 4156) no Hoare annotation was computed. [2019-01-13 06:14:57,559 INFO L444 ceAbstractionStarter]: At program point L5077(lines 5076 5078) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= 0 ~ir_add_bof~0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|))) [2019-01-13 06:14:57,559 INFO L444 ceAbstractionStarter]: At program point L4879(lines 4811 4882) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,559 INFO L448 ceAbstractionStarter]: For program point L4483(lines 4483 4536) no Hoare annotation was computed. [2019-01-13 06:14:57,559 INFO L444 ceAbstractionStarter]: At program point L3625(lines 3614 3630) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,559 INFO L444 ceAbstractionStarter]: At program point L4484(lines 4483 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,559 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-13 06:14:57,559 INFO L448 ceAbstractionStarter]: For program point L4220(lines 4220 4254) no Hoare annotation was computed. [2019-01-13 06:14:57,560 INFO L444 ceAbstractionStarter]: At program point L3956(lines 3806 3961) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,560 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-01-13 06:14:57,560 INFO L448 ceAbstractionStarter]: For program point L4551(lines 4551 4557) no Hoare annotation was computed. [2019-01-13 06:14:57,560 INFO L444 ceAbstractionStarter]: At program point L4221(lines 4220 4254) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,560 INFO L448 ceAbstractionStarter]: For program point L5014(lines 5014 5019) no Hoare annotation was computed. [2019-01-13 06:14:57,560 INFO L448 ceAbstractionStarter]: For program point L4023(lines 4023 4041) no Hoare annotation was computed. [2019-01-13 06:14:57,560 INFO L448 ceAbstractionStarter]: For program point L5014-2(lines 5014 5019) no Hoare annotation was computed. [2019-01-13 06:14:57,560 INFO L448 ceAbstractionStarter]: For program point L4816(lines 4816 4821) no Hoare annotation was computed. [2019-01-13 06:14:57,560 INFO L448 ceAbstractionStarter]: For program point L4486(lines 4486 4536) no Hoare annotation was computed. [2019-01-13 06:14:57,560 INFO L444 ceAbstractionStarter]: At program point L5081(lines 5080 5082) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,561 INFO L444 ceAbstractionStarter]: At program point L4883(lines 4810 4884) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,561 INFO L448 ceAbstractionStarter]: For program point L3826(line 3826) no Hoare annotation was computed. [2019-01-13 06:14:57,561 INFO L444 ceAbstractionStarter]: At program point L4487(lines 4486 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,561 INFO L448 ceAbstractionStarter]: For program point L4157(lines 4157 4161) no Hoare annotation was computed. [2019-01-13 06:14:57,561 INFO L448 ceAbstractionStarter]: For program point L4157-2(lines 4157 4161) no Hoare annotation was computed. [2019-01-13 06:14:57,561 INFO L444 ceAbstractionStarter]: At program point L4025loopEntry(lines 4025 4035) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,561 INFO L448 ceAbstractionStarter]: For program point L4818(lines 4818 4821) no Hoare annotation was computed. [2019-01-13 06:14:57,561 INFO L448 ceAbstractionStarter]: For program point L3827(lines 3827 3833) no Hoare annotation was computed. [2019-01-13 06:14:57,561 INFO L448 ceAbstractionStarter]: For program point L4818-1(lines 4816 4821) no Hoare annotation was computed. [2019-01-13 06:14:57,562 INFO L448 ceAbstractionStarter]: For program point L4620(lines 4620 4623) no Hoare annotation was computed. [2019-01-13 06:14:57,562 INFO L448 ceAbstractionStarter]: For program point L4026(line 4026) no Hoare annotation was computed. [2019-01-13 06:14:57,562 INFO L444 ceAbstractionStarter]: At program point L4621(lines 4604 4634) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (or (<= (+ ULTIMATE.start_ir_init_~retval~0 1) 0) (< 0 ULTIMATE.start_ir_init_~retval~0)) (= 0 ~ir_add_bof~0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|))) [2019-01-13 06:14:57,562 INFO L448 ceAbstractionStarter]: For program point L4489(lines 4489 4536) no Hoare annotation was computed. [2019-01-13 06:14:57,562 INFO L444 ceAbstractionStarter]: At program point L4291(lines 4281 4292) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,562 INFO L448 ceAbstractionStarter]: For program point L4027(lines 4027 4033) no Hoare annotation was computed. [2019-01-13 06:14:57,562 INFO L444 ceAbstractionStarter]: At program point L4490(lines 4489 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,562 INFO L444 ceAbstractionStarter]: At program point L3896(lines 3808 3960) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,562 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-13 06:14:57,563 INFO L444 ceAbstractionStarter]: At program point L3699(lines 3687 3701) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,563 INFO L448 ceAbstractionStarter]: For program point L4492(lines 4492 4536) no Hoare annotation was computed. [2019-01-13 06:14:57,563 INFO L448 ceAbstractionStarter]: For program point L4162(lines 4162 4166) no Hoare annotation was computed. [2019-01-13 06:14:57,563 INFO L448 ceAbstractionStarter]: For program point L4162-2(lines 4162 4166) no Hoare annotation was computed. [2019-01-13 06:14:57,563 INFO L444 ceAbstractionStarter]: At program point L4493(lines 4492 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,563 INFO L444 ceAbstractionStarter]: At program point L5088(lines 5087 5089) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,563 INFO L448 ceAbstractionStarter]: For program point L4825(lines 4825 4881) no Hoare annotation was computed. [2019-01-13 06:14:57,563 INFO L448 ceAbstractionStarter]: For program point L4495(lines 4495 4536) no Hoare annotation was computed. [2019-01-13 06:14:57,563 INFO L444 ceAbstractionStarter]: At program point L4297(lines 4261 4299) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,564 INFO L444 ceAbstractionStarter]: At program point L4826(lines 4825 4881) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,564 INFO L448 ceAbstractionStarter]: For program point L3901(line 3901) no Hoare annotation was computed. [2019-01-13 06:14:57,564 INFO L448 ceAbstractionStarter]: For program point L4562(lines 4562 4568) no Hoare annotation was computed. [2019-01-13 06:14:57,564 INFO L444 ceAbstractionStarter]: At program point L4496(lines 4495 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,564 INFO L444 ceAbstractionStarter]: At program point L4364(lines 4300 4366) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,564 INFO L444 ceAbstractionStarter]: At program point L5091(lines 5090 5092) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,564 INFO L448 ceAbstractionStarter]: For program point L3902(lines 3902 3908) no Hoare annotation was computed. [2019-01-13 06:14:57,564 INFO L444 ceAbstractionStarter]: At program point L3836(lines 3808 3960) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,564 INFO L448 ceAbstractionStarter]: For program point L4167(lines 4167 4171) no Hoare annotation was computed. [2019-01-13 06:14:57,564 INFO L448 ceAbstractionStarter]: For program point L4167-2(lines 4167 4171) no Hoare annotation was computed. [2019-01-13 06:14:57,565 INFO L451 ceAbstractionStarter]: At program point L4894(lines 4787 4896) the Hoare annotation is: true [2019-01-13 06:14:57,565 INFO L448 ceAbstractionStarter]: For program point L4828(lines 4828 4881) no Hoare annotation was computed. [2019-01-13 06:14:57,565 INFO L448 ceAbstractionStarter]: For program point L4498(lines 4498 4536) no Hoare annotation was computed. [2019-01-13 06:14:57,565 INFO L444 ceAbstractionStarter]: At program point L4036(lines 3969 4051) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,565 INFO L444 ceAbstractionStarter]: At program point L4829(lines 4828 4881) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,565 INFO L444 ceAbstractionStarter]: At program point L3640(lines 3633 3642) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,565 INFO L444 ceAbstractionStarter]: At program point L3640-1(lines 3633 3642) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,565 INFO L444 ceAbstractionStarter]: At program point L4499(lines 4498 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,565 INFO L444 ceAbstractionStarter]: At program point L5095(lines 5094 5096) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,566 INFO L448 ceAbstractionStarter]: For program point L4831(lines 4831 4881) no Hoare annotation was computed. [2019-01-13 06:14:57,566 INFO L448 ceAbstractionStarter]: For program point L4897-2(lines 5041 5046) no Hoare annotation was computed. [2019-01-13 06:14:57,566 INFO L451 ceAbstractionStarter]: At program point L4897-3(lines 5032 5049) the Hoare annotation is: true [2019-01-13 06:14:57,566 INFO L448 ceAbstractionStarter]: For program point L4897(lines 1 5144) no Hoare annotation was computed. [2019-01-13 06:14:57,566 INFO L448 ceAbstractionStarter]: For program point L4897-1(lines 1 5144) no Hoare annotation was computed. [2019-01-13 06:14:57,566 INFO L444 ceAbstractionStarter]: At program point L4633(lines 4602 4635) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= 0 ~ir_add_bof~0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|))) [2019-01-13 06:14:57,566 INFO L444 ceAbstractionStarter]: At program point L4501(lines 4500 4536) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,566 INFO L448 ceAbstractionStarter]: For program point L3841(line 3841) no Hoare annotation was computed. [2019-01-13 06:14:57,566 INFO L444 ceAbstractionStarter]: At program point L4832(lines 4831 4881) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,566 INFO L448 ceAbstractionStarter]: For program point L4172(lines 4172 4176) no Hoare annotation was computed. [2019-01-13 06:14:57,566 INFO L448 ceAbstractionStarter]: For program point L4172-2(lines 4172 4176) no Hoare annotation was computed. [2019-01-13 06:14:57,567 INFO L448 ceAbstractionStarter]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2019-01-13 06:14:57,567 INFO L448 ceAbstractionStarter]: For program point L3842(lines 3842 3848) no Hoare annotation was computed. [2019-01-13 06:14:57,567 INFO L448 ceAbstractionStarter]: For program point L4900-1(line 4900) no Hoare annotation was computed. [2019-01-13 06:14:57,567 INFO L448 ceAbstractionStarter]: For program point L4834(lines 4834 4881) no Hoare annotation was computed. [2019-01-13 06:14:57,567 INFO L448 ceAbstractionStarter]: For program point L4900-2(line 4900) no Hoare annotation was computed. [2019-01-13 06:14:57,567 INFO L448 ceAbstractionStarter]: For program point L4900(line 4900) no Hoare annotation was computed. [2019-01-13 06:14:57,567 INFO L448 ceAbstractionStarter]: For program point L4900-3(line 4900) no Hoare annotation was computed. [2019-01-13 06:14:57,567 INFO L444 ceAbstractionStarter]: At program point L5099(lines 5098 5100) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,567 INFO L444 ceAbstractionStarter]: At program point L4835(lines 4834 4881) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,567 INFO L444 ceAbstractionStarter]: At program point L3911(lines 3808 3960) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,567 INFO L448 ceAbstractionStarter]: For program point L4374(lines 4374 4377) no Hoare annotation was computed. [2019-01-13 06:14:57,568 INFO L444 ceAbstractionStarter]: At program point L4110(lines 4084 4111) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,568 INFO L444 ceAbstractionStarter]: At program point L4110-1(lines 4084 4111) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,568 INFO L448 ceAbstractionStarter]: For program point L4837(lines 4837 4881) no Hoare annotation was computed. [2019-01-13 06:14:57,568 INFO L444 ceAbstractionStarter]: At program point L3714(lines 3711 3716) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,568 INFO L444 ceAbstractionStarter]: At program point L3714-1(lines 3711 3716) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,568 INFO L448 ceAbstractionStarter]: For program point L4177(lines 4177 4181) no Hoare annotation was computed. [2019-01-13 06:14:57,568 INFO L448 ceAbstractionStarter]: For program point L4177-2(lines 4177 4181) no Hoare annotation was computed. [2019-01-13 06:14:57,568 INFO L444 ceAbstractionStarter]: At program point L4838(lines 4837 4881) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,568 INFO L444 ceAbstractionStarter]: At program point L3649(lines 3643 3651) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,569 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-01-13 06:14:57,569 INFO L444 ceAbstractionStarter]: At program point L4113-1(lines 4053 4115) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,569 INFO L444 ceAbstractionStarter]: At program point L4113(lines 4053 4115) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,569 INFO L448 ceAbstractionStarter]: For program point L4378(lines 4378 4381) no Hoare annotation was computed. [2019-01-13 06:14:57,569 INFO L448 ceAbstractionStarter]: For program point L4378-2(lines 4378 4381) no Hoare annotation was computed. [2019-01-13 06:14:57,569 INFO L448 ceAbstractionStarter]: For program point L3916(line 3916) no Hoare annotation was computed. [2019-01-13 06:14:57,569 INFO L448 ceAbstractionStarter]: For program point L4577(lines 4577 4584) no Hoare annotation was computed. [2019-01-13 06:14:57,569 INFO L444 ceAbstractionStarter]: At program point L5106(lines 5105 5107) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,569 INFO L448 ceAbstractionStarter]: For program point L3917(lines 3917 3923) no Hoare annotation was computed. [2019-01-13 06:14:57,569 INFO L444 ceAbstractionStarter]: At program point L3851(lines 3808 3960) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,569 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-13 06:14:57,570 INFO L448 ceAbstractionStarter]: For program point L4182(lines 4182 4186) no Hoare annotation was computed. [2019-01-13 06:14:57,570 INFO L448 ceAbstractionStarter]: For program point L4182-2(lines 4182 4186) no Hoare annotation was computed. [2019-01-13 06:14:57,570 INFO L444 ceAbstractionStarter]: At program point L4050(lines 3962 4052) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,570 INFO L451 ceAbstractionStarter]: At program point L4909(lines 4909 4910) the Hoare annotation is: true [2019-01-13 06:14:57,570 INFO L451 ceAbstractionStarter]: At program point L4909-1(lines 4909 4910) the Hoare annotation is: true [2019-01-13 06:14:57,570 INFO L444 ceAbstractionStarter]: At program point L3720(lines 3717 3722) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,570 INFO L444 ceAbstractionStarter]: At program point L3720-1(lines 3717 3722) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,570 INFO L444 ceAbstractionStarter]: At program point L3985loopEntry(lines 3985 3995) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,570 INFO L448 ceAbstractionStarter]: For program point L4382(lines 4382 4385) no Hoare annotation was computed. [2019-01-13 06:14:57,570 INFO L444 ceAbstractionStarter]: At program point L5109(lines 5108 5110) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,571 INFO L448 ceAbstractionStarter]: For program point L3986(line 3986) no Hoare annotation was computed. [2019-01-13 06:14:57,571 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-01-13 06:14:57,571 INFO L448 ceAbstractionStarter]: For program point L3987(lines 3987 3993) no Hoare annotation was computed. [2019-01-13 06:14:57,571 INFO L444 ceAbstractionStarter]: At program point L4582(lines 4455 4598) the Hoare annotation is: (and (<= ~ldv_urb_state~0 1) (or (not (= ULTIMATE.start_ir_set_termios_~urb~0.base 0)) (not (= 0 ULTIMATE.start_ir_set_termios_~urb~0.offset))) (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0)) [2019-01-13 06:14:57,571 INFO L444 ceAbstractionStarter]: At program point L4252(lines 4222 4254) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,571 INFO L448 ceAbstractionStarter]: For program point L3856(line 3856) no Hoare annotation was computed. [2019-01-13 06:14:57,571 INFO L444 ceAbstractionStarter]: At program point L4980loopEntry(lines 4980 4993) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,571 INFO L448 ceAbstractionStarter]: For program point L3857(lines 3857 3863) no Hoare annotation was computed. [2019-01-13 06:14:57,571 INFO L448 ceAbstractionStarter]: For program point L4056(lines 4056 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,572 INFO L444 ceAbstractionStarter]: At program point L5113(lines 5112 5114) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,572 INFO L448 ceAbstractionStarter]: For program point L4056-1(lines 4056 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,572 INFO L448 ceAbstractionStarter]: For program point L4981(line 4981) no Hoare annotation was computed. [2019-01-13 06:14:57,572 INFO L444 ceAbstractionStarter]: At program point L4321loopEntry(lines 4321 4336) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,572 INFO L444 ceAbstractionStarter]: At program point L4057-1(lines 4056 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,572 INFO L444 ceAbstractionStarter]: At program point L4057(lines 4056 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,572 INFO L448 ceAbstractionStarter]: For program point L4322(lines 4321 4336) no Hoare annotation was computed. [2019-01-13 06:14:57,572 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-13 06:14:57,572 INFO L444 ceAbstractionStarter]: At program point L3926(lines 3808 3960) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,572 INFO L448 ceAbstractionStarter]: For program point L4389(lines 4389 4392) no Hoare annotation was computed. [2019-01-13 06:14:57,572 INFO L448 ceAbstractionStarter]: For program point L4059-1(lines 4059 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,573 INFO L448 ceAbstractionStarter]: For program point L4059(lines 4059 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,573 INFO L444 ceAbstractionStarter]: At program point L5116(lines 5115 5117) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,573 INFO L444 ceAbstractionStarter]: At program point L4258(lines 4116 4260) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,573 INFO L444 ceAbstractionStarter]: At program point L4457loopEntry(lines 4457 4467) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,573 INFO L448 ceAbstractionStarter]: For program point L4325(line 4325) no Hoare annotation was computed. [2019-01-13 06:14:57,573 INFO L448 ceAbstractionStarter]: For program point L4986(lines 4986 4989) no Hoare annotation was computed. [2019-01-13 06:14:57,573 INFO L444 ceAbstractionStarter]: At program point L5052(lines 5051 5053) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,573 INFO L448 ceAbstractionStarter]: For program point L4458(line 4458) no Hoare annotation was computed. [2019-01-13 06:14:57,573 INFO L448 ceAbstractionStarter]: For program point L4062(lines 4062 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,573 INFO L444 ceAbstractionStarter]: At program point L3996(lines 3969 4051) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,574 INFO L448 ceAbstractionStarter]: For program point L4062-1(lines 4062 4112) no Hoare annotation was computed. [2019-01-13 06:14:57,574 INFO L448 ceAbstractionStarter]: For program point L4459(lines 4459 4465) no Hoare annotation was computed. [2019-01-13 06:14:57,574 INFO L444 ceAbstractionStarter]: At program point L4063-1(lines 4059 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,574 INFO L444 ceAbstractionStarter]: At program point L5120(lines 5119 5121) the Hoare annotation is: (and (= 0 (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|)) (= 0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1)) (= 0 ~ir_add_bof~0) (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0) (= 0 (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|))) [2019-01-13 06:14:57,574 INFO L444 ceAbstractionStarter]: At program point L4063(lines 4059 4112) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,574 INFO L448 ceAbstractionStarter]: For program point L3931(line 3931) no Hoare annotation was computed. [2019-01-13 06:14:57,574 INFO L444 ceAbstractionStarter]: At program point L4196(lines 4138 4197) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,574 INFO L448 ceAbstractionStarter]: For program point L3932(lines 3932 3938) no Hoare annotation was computed. [2019-01-13 06:14:57,574 INFO L444 ceAbstractionStarter]: At program point L3866(lines 3808 3960) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2019-01-13 06:14:57,575 INFO L448 ceAbstractionStarter]: For program point L4131(lines 4131 4137) no Hoare annotation was computed. [2019-01-13 06:14:57,610 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,636 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,639 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,640 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,641 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,645 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,646 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,646 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,646 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,646 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,650 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,651 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,652 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,656 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,667 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,668 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,671 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:57,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 06:14:57 BoogieIcfgContainer [2019-01-13 06:14:57,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 06:14:57,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 06:14:57,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 06:14:57,675 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 06:14:57,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 06:14:37" (3/4) ... [2019-01-13 06:14:57,680 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 06:14:57,716 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 131 nodes and edges [2019-01-13 06:14:57,719 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2019-01-13 06:14:57,722 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-01-13 06:14:57,725 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-13 06:14:57,728 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-13 06:14:57,731 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-13 06:14:57,734 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 06:14:57,737 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 06:14:57,794 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == \result) || ((((!(\result == 0) || !(0 == \result)) && ldv_urb_state <= 1) && ldv_coherent_state == 0) && 1 <= ldv_urb_state) [2019-01-13 06:14:58,452 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 06:14:58,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 06:14:58,453 INFO L168 Benchmark]: Toolchain (without parser) took 28066.71 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 436.2 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -55.9 MB). Peak memory consumption was 380.3 MB. Max. memory is 11.5 GB. [2019-01-13 06:14:58,455 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-13 06:14:58,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1746.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-01-13 06:14:58,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 198.93 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.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-01-13 06:14:58,456 INFO L168 Benchmark]: Boogie Preprocessor took 195.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-01-13 06:14:58,458 INFO L168 Benchmark]: RCFGBuilder took 4877.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.5 MB). Peak memory consumption was 262.3 MB. Max. memory is 11.5 GB. [2019-01-13 06:14:58,458 INFO L168 Benchmark]: TraceAbstraction took 20265.97 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.4 MB). Peak memory consumption was 470.7 MB. Max. memory is 11.5 GB. [2019-01-13 06:14:58,460 INFO L168 Benchmark]: Witness Printer took 776.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 157.1 MB). Peak memory consumption was 157.1 MB. Max. memory is 11.5 GB. [2019-01-13 06:14:58,464 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 1746.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 198.93 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.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 195.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4877.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.5 MB). Peak memory consumption was 262.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20265.97 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.4 MB). Peak memory consumption was 470.7 MB. Max. memory is 11.5 GB. * Witness Printer took 776.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 157.1 MB). Peak memory consumption was 157.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 4282]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3643]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4139]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5126]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4080]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4837]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4320]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4080]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4455]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5115]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4834]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5090]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5112]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4001]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3717]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3717]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4498]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5134]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 4811]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3633]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3618]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3633]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4909]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4138]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3666]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4831]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5087]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5076]: Loop Invariant [2019-01-13 06:14:58,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && 0 == ir_add_bof) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == unknown-#memory_int-unknown[buffer_size][buffer_size] - InvariantResult [Line: 4074]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5098]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4300]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4074]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4909]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4848]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4828]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3962]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4082]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4082]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4495]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4975]: Loop Invariant Derived loop invariant: (((0 == \result && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == \result) || ((((!(\result == 0) || !(0 == \result)) && ldv_urb_state <= 1) && ldv_coherent_state == 0) && 1 <= ldv_urb_state) - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5051]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4492]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4214]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3711]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 5005]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 4025]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5059]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3969]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5059]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 3711]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5005]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4457]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4456]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3806]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4980]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4825]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4065]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4053]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4053]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5035]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4084]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3810]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 1]: Loop Invariant [2019-01-13 06:14:58,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((0 == unknown-#memory_int-unknown[debug][debug] && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && (retval + 1 <= 0 || 0 < retval)) && 0 == ir_add_bof) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == unknown-#memory_int-unknown[buffer_size][buffer_size] - InvariantResult [Line: 4602]: Loop Invariant [2019-01-13 06:14:58,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,505 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,506 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,506 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && 0 == ir_add_bof) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == unknown-#memory_int-unknown[buffer_size][buffer_size] - InvariantResult [Line: 4084]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4500]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4489]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4502]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4486]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5032]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4261]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4059]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4208]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4483]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3677]: Loop Invariant [2019-01-13 06:14:58,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && 0 == ir_add_bof) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == unknown-#memory_int-unknown[buffer_size][buffer_size] - InvariantResult [Line: 4205]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5119]: Loop Invariant [2019-01-13 06:14:58,520 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && 0 == ir_add_bof) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == unknown-#memory_int-unknown[buffer_size][buffer_size] - InvariantResult [Line: 4059]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5108]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 5130]: Loop Invariant [2019-01-13 06:14:58,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((0 == unknown-#memory_int-unknown[debug][debug] && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && 0 == ir_add_bof) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == unknown-#memory_int-unknown[buffer_size][buffer_size] - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5105]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5138]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 5094]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4787]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4810]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3614]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5138]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5138]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5138]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4056]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4116]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4056]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4281]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5080]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4480]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4202]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4199]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4477]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3687]: Loop Invariant Derived loop invariant: ((ldv_urb_state <= 1 && (!(urb == 0) || !(0 == urb))) && ldv_coherent_state == 0) && 1 <= ldv_urb_state - InvariantResult [Line: 3608]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4604]: Loop Invariant [2019-01-13 06:14:58,529 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-13 06:14:58,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((0 == unknown-#memory_int-unknown[debug][debug] && 0 == unknown-#memory_int-unknown[xbof][xbof] + 1) && (retval + 1 <= 0 || 0 < retval)) && 0 == ir_add_bof) && ldv_coherent_state == 0) && ldv_urb_state == 0) && 0 == unknown-#memory_int-unknown[buffer_size][buffer_size] - InvariantResult [Line: 4265]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5055]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4266]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4321]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5063]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3808]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3985]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3969]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4222]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4474]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 275 locations, 4 error locations. SAFE Result, 20.0s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 5782 SDtfs, 4682 SDslu, 7154 SDs, 0 SdLazy, 579 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2505occurred in iteration=9, 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.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 3552 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 128 LocationsWithAnnotation, 128 PreInvPairs, 894 NumberOfFragments, 1218 HoareAnnotationTreeSize, 128 FomulaSimplifications, 130356 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 128 FomulaSimplificationsInter, 1766 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 539 NumberOfCodeBlocks, 539 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 527 ConstructedInterpolants, 0 QuantifiedInterpolants, 68629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...