./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 41f85ef13c9e2b840fcfc019d39f6b7e23aee02e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11 21:21:24,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:21:24,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:21:24,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:21:24,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:21:24,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:21:24,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:21:24,630 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:21:24,634 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:21:24,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:21:24,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:21:24,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:21:24,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:21:24,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:21:24,640 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:21:24,641 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:21:24,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:21:24,644 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:21:24,646 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:21:24,648 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:21:24,649 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:21:24,650 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:21:24,656 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:21:24,656 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:21:24,656 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:21:24,657 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:21:24,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:21:24,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:21:24,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:21:24,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:21:24,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:21:24,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:21:24,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:21:24,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:21:24,669 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:21:24,670 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:21:24,670 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:21:24,699 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:21:24,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:21:24,701 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:21:24,701 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:21:24,701 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:21:24,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:21:24,702 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:21:24,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:21:24,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:21:24,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:21:24,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:21:24,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:21:24,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:21:24,703 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:21:24,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:21:24,704 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:21:24,704 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:21:24,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:21:24,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:21:24,704 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:21:24,705 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:21:24,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:21:24,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:21:24,706 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:21:24,706 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:21:24,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:21:24,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:21:24,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:21:24,707 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41f85ef13c9e2b840fcfc019d39f6b7e23aee02e [2019-01-11 21:21:24,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:21:24,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:21:24,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:21:24,769 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:21:24,769 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:21:24,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2019-01-11 21:21:24,831 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aaec84b0/63c2686f54b14b1787757c043d6a2c5f/FLAG4c84688c0 [2019-01-11 21:21:25,258 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:21:25,259 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2019-01-11 21:21:25,269 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aaec84b0/63c2686f54b14b1787757c043d6a2c5f/FLAG4c84688c0 [2019-01-11 21:21:25,283 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aaec84b0/63c2686f54b14b1787757c043d6a2c5f [2019-01-11 21:21:25,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:21:25,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:21:25,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:21:25,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:21:25,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:21:25,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de93974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25, skipping insertion in model container [2019-01-11 21:21:25,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:21:25,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:21:25,570 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:21:25,576 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:21:25,625 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:21:25,644 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:21:25,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25 WrapperNode [2019-01-11 21:21:25,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:21:25,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:21:25,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:21:25,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:21:25,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:21:25,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:21:25,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:21:25,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:21:25,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (1/1) ... [2019-01-11 21:21:25,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:21:25,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:21:25,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:21:25,861 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:21:25,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (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-11 21:21:25,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:21:25,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:21:26,132 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:26,156 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:26,169 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:26,182 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:26,201 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:26,222 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:26,241 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:21:27,287 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume !false; [2019-01-11 21:21:27,287 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume false; [2019-01-11 21:21:27,287 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##184: assume false; [2019-01-11 21:21:27,287 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !false; [2019-01-11 21:21:27,288 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2019-01-11 21:21:27,288 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2019-01-11 21:21:27,288 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2019-01-11 21:21:27,288 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2019-01-11 21:21:27,289 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-01-11 21:21:27,289 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-01-11 21:21:27,289 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-01-11 21:21:27,289 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-01-11 21:21:27,289 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-01-11 21:21:27,291 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-01-11 21:21:27,292 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:21:27,292 INFO L286 CfgBuilder]: Removed 78 assue(true) statements. [2019-01-11 21:21:27,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:21:27 BoogieIcfgContainer [2019-01-11 21:21:27,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:21:27,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:21:27,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:21:27,298 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:21:27,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:21:25" (1/3) ... [2019-01-11 21:21:27,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63be9176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:21:27, skipping insertion in model container [2019-01-11 21:21:27,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:21:25" (2/3) ... [2019-01-11 21:21:27,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63be9176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:21:27, skipping insertion in model container [2019-01-11 21:21:27,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:21:27" (3/3) ... [2019-01-11 21:21:27,302 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2019-01-11 21:21:27,313 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:21:27,321 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-01-11 21:21:27,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-01-11 21:21:27,370 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:21:27,371 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:21:27,371 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:21:27,371 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:21:27,371 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:21:27,372 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:21:27,372 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:21:27,372 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:21:27,372 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:21:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-01-11 21:21:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 21:21:27,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:27,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:27,403 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:27,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1311783926, now seen corresponding path program 1 times [2019-01-11 21:21:27,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:27,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:27,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:27,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:27,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:27,580 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-11 21:21:27,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:27,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:27,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:27,602 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 3 states. [2019-01-11 21:21:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:27,885 INFO L93 Difference]: Finished difference Result 343 states and 509 transitions. [2019-01-11 21:21:27,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:27,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-11 21:21:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:27,908 INFO L225 Difference]: With dead ends: 343 [2019-01-11 21:21:27,909 INFO L226 Difference]: Without dead ends: 165 [2019-01-11 21:21:27,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-11 21:21:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-11 21:21:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-11 21:21:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-01-11 21:21:27,999 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 11 [2019-01-11 21:21:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:27,999 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-01-11 21:21:27,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-01-11 21:21:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 21:21:28,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:28,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:28,004 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash -825827361, now seen corresponding path program 1 times [2019-01-11 21:21:28,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:28,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:28,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:28,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:28,106 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-11 21:21:28,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:28,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:28,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:28,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:28,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:28,110 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 3 states. [2019-01-11 21:21:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:28,659 INFO L93 Difference]: Finished difference Result 251 states and 333 transitions. [2019-01-11 21:21:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:28,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-11 21:21:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:28,666 INFO L225 Difference]: With dead ends: 251 [2019-01-11 21:21:28,666 INFO L226 Difference]: Without dead ends: 200 [2019-01-11 21:21:28,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:28,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-11 21:21:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2019-01-11 21:21:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-11 21:21:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2019-01-11 21:21:28,706 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 13 [2019-01-11 21:21:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:28,706 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2019-01-11 21:21:28,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2019-01-11 21:21:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:21:28,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:28,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:28,710 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:28,710 INFO L82 PathProgramCache]: Analyzing trace with hash 169161723, now seen corresponding path program 1 times [2019-01-11 21:21:28,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:28,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:28,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:28,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:28,787 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-11 21:21:28,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:28,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:28,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:28,789 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand 3 states. [2019-01-11 21:21:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:28,871 INFO L93 Difference]: Finished difference Result 297 states and 394 transitions. [2019-01-11 21:21:28,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:28,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-11 21:21:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:28,875 INFO L225 Difference]: With dead ends: 297 [2019-01-11 21:21:28,875 INFO L226 Difference]: Without dead ends: 214 [2019-01-11 21:21:28,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-11 21:21:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 170. [2019-01-11 21:21:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-11 21:21:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2019-01-11 21:21:28,914 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 14 [2019-01-11 21:21:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:28,914 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2019-01-11 21:21:28,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2019-01-11 21:21:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 21:21:28,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:28,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:21:28,918 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:28,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1790313284, now seen corresponding path program 1 times [2019-01-11 21:21:28,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:28,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:28,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:29,056 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-11 21:21:29,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:29,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:29,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:29,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:29,059 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand 3 states. [2019-01-11 21:21:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:29,246 INFO L93 Difference]: Finished difference Result 170 states and 233 transitions. [2019-01-11 21:21:29,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:29,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-11 21:21:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:29,249 INFO L225 Difference]: With dead ends: 170 [2019-01-11 21:21:29,250 INFO L226 Difference]: Without dead ends: 164 [2019-01-11 21:21:29,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-11 21:21:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-01-11 21:21:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-11 21:21:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2019-01-11 21:21:29,265 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 22 [2019-01-11 21:21:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:29,266 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2019-01-11 21:21:29,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2019-01-11 21:21:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 21:21:29,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:29,269 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] [2019-01-11 21:21:29,270 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:29,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1900059442, now seen corresponding path program 1 times [2019-01-11 21:21:29,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:29,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:29,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:29,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:29,384 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-11 21:21:29,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:29,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:29,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:29,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:29,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:29,386 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand 3 states. [2019-01-11 21:21:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:29,602 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2019-01-11 21:21:29,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:29,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-11 21:21:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:29,604 INFO L225 Difference]: With dead ends: 208 [2019-01-11 21:21:29,604 INFO L226 Difference]: Without dead ends: 161 [2019-01-11 21:21:29,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-11 21:21:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-11 21:21:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-11 21:21:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2019-01-11 21:21:29,617 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 25 [2019-01-11 21:21:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:29,617 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2019-01-11 21:21:29,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2019-01-11 21:21:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:21:29,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:29,620 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] [2019-01-11 21:21:29,621 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:29,622 INFO L82 PathProgramCache]: Analyzing trace with hash 88593490, now seen corresponding path program 1 times [2019-01-11 21:21:29,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:29,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:29,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:29,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:29,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:29,680 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-11 21:21:29,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:29,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:29,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:29,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:29,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:29,681 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand 3 states. [2019-01-11 21:21:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:29,730 INFO L93 Difference]: Finished difference Result 220 states and 298 transitions. [2019-01-11 21:21:29,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:29,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-11 21:21:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:29,733 INFO L225 Difference]: With dead ends: 220 [2019-01-11 21:21:29,733 INFO L226 Difference]: Without dead ends: 169 [2019-01-11 21:21:29,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-11 21:21:29,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2019-01-11 21:21:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-11 21:21:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-01-11 21:21:29,746 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 26 [2019-01-11 21:21:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:29,747 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-01-11 21:21:29,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-01-11 21:21:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-11 21:21:29,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:29,750 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] [2019-01-11 21:21:29,751 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash 721476524, now seen corresponding path program 1 times [2019-01-11 21:21:29,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:29,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:29,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:29,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:29,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:29,892 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-11 21:21:29,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:29,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:21:29,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:21:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:21:29,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:29,894 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand 5 states. [2019-01-11 21:21:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:30,434 INFO L93 Difference]: Finished difference Result 303 states and 407 transitions. [2019-01-11 21:21:30,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:21:30,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-11 21:21:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:30,437 INFO L225 Difference]: With dead ends: 303 [2019-01-11 21:21:30,437 INFO L226 Difference]: Without dead ends: 253 [2019-01-11 21:21:30,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:21:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-11 21:21:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 192. [2019-01-11 21:21:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-11 21:21:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-01-11 21:21:30,455 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 29 [2019-01-11 21:21:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:30,455 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-01-11 21:21:30,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:21:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-01-11 21:21:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-11 21:21:30,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:30,459 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] [2019-01-11 21:21:30,459 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash 679460228, now seen corresponding path program 1 times [2019-01-11 21:21:30,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:30,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:30,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:30,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:30,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:30,701 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-11 21:21:30,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:30,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:21:30,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:21:30,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:21:30,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:30,703 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 5 states. [2019-01-11 21:21:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:31,017 INFO L93 Difference]: Finished difference Result 275 states and 365 transitions. [2019-01-11 21:21:31,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:21:31,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-11 21:21:31,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:31,021 INFO L225 Difference]: With dead ends: 275 [2019-01-11 21:21:31,022 INFO L226 Difference]: Without dead ends: 230 [2019-01-11 21:21:31,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:21:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-11 21:21:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 174. [2019-01-11 21:21:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-11 21:21:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 240 transitions. [2019-01-11 21:21:31,037 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 240 transitions. Word has length 29 [2019-01-11 21:21:31,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:31,037 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 240 transitions. [2019-01-11 21:21:31,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:21:31,038 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 240 transitions. [2019-01-11 21:21:31,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 21:21:31,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:31,040 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] [2019-01-11 21:21:31,042 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:31,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:31,042 INFO L82 PathProgramCache]: Analyzing trace with hash 883394074, now seen corresponding path program 1 times [2019-01-11 21:21:31,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:31,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:31,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:31,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:31,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:31,209 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-11 21:21:31,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:31,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 21:21:31,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:21:31,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:21:31,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:21:31,211 INFO L87 Difference]: Start difference. First operand 174 states and 240 transitions. Second operand 4 states. [2019-01-11 21:21:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:31,409 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions. [2019-01-11 21:21:31,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:21:31,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-01-11 21:21:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:31,411 INFO L225 Difference]: With dead ends: 218 [2019-01-11 21:21:31,411 INFO L226 Difference]: Without dead ends: 170 [2019-01-11 21:21:31,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-11 21:21:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-01-11 21:21:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-11 21:21:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2019-01-11 21:21:31,427 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 234 transitions. Word has length 30 [2019-01-11 21:21:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:31,428 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 234 transitions. [2019-01-11 21:21:31,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:21:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 234 transitions. [2019-01-11 21:21:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 21:21:31,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:31,430 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] [2019-01-11 21:21:31,431 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1219124044, now seen corresponding path program 1 times [2019-01-11 21:21:31,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:31,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:31,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:31,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:31,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:31,502 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-11 21:21:31,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:31,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:31,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:31,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:31,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:31,506 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. Second operand 3 states. [2019-01-11 21:21:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:31,560 INFO L93 Difference]: Finished difference Result 177 states and 244 transitions. [2019-01-11 21:21:31,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:31,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-11 21:21:31,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:31,564 INFO L225 Difference]: With dead ends: 177 [2019-01-11 21:21:31,564 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 21:21:31,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 21:21:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-11 21:21:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 21:21:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-01-11 21:21:31,571 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 31 [2019-01-11 21:21:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:31,571 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-01-11 21:21:31,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-01-11 21:21:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 21:21:31,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:31,574 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] [2019-01-11 21:21:31,575 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:31,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:31,576 INFO L82 PathProgramCache]: Analyzing trace with hash 358090674, now seen corresponding path program 1 times [2019-01-11 21:21:31,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:31,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:31,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:31,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:31,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:31,667 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-11 21:21:31,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:31,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:21:31,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:21:31,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:21:31,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:31,670 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2019-01-11 21:21:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:31,811 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-01-11 21:21:31,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:21:31,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-11 21:21:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:31,814 INFO L225 Difference]: With dead ends: 69 [2019-01-11 21:21:31,814 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 21:21:31,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:21:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 21:21:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-01-11 21:21:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 21:21:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-01-11 21:21:31,822 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 32 [2019-01-11 21:21:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:31,822 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-01-11 21:21:31,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:21:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-01-11 21:21:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 21:21:31,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:31,823 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] [2019-01-11 21:21:31,826 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:31,827 INFO L82 PathProgramCache]: Analyzing trace with hash 316074378, now seen corresponding path program 1 times [2019-01-11 21:21:31,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:31,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:31,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:31,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:31,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:31,902 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-11 21:21:31,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:31,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:31,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:31,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:31,903 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 3 states. [2019-01-11 21:21:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:31,968 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-01-11 21:21:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:31,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-11 21:21:31,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:31,969 INFO L225 Difference]: With dead ends: 65 [2019-01-11 21:21:31,969 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 21:21:31,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 21:21:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-01-11 21:21:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 21:21:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-01-11 21:21:31,976 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2019-01-11 21:21:31,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:31,976 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-11 21:21:31,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-01-11 21:21:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 21:21:31,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:31,977 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] [2019-01-11 21:21:31,980 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash -493272248, now seen corresponding path program 1 times [2019-01-11 21:21:31,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:31,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:31,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:31,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:31,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:32,074 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-11 21:21:32,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:32,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:32,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:32,076 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-01-11 21:21:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:32,156 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-01-11 21:21:32,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:32,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-11 21:21:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:32,158 INFO L225 Difference]: With dead ends: 62 [2019-01-11 21:21:32,158 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 21:21:32,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 21:21:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-01-11 21:21:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 21:21:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-01-11 21:21:32,164 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 32 [2019-01-11 21:21:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:32,165 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-01-11 21:21:32,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-01-11 21:21:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 21:21:32,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:32,165 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] [2019-01-11 21:21:32,168 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1452502264, now seen corresponding path program 1 times [2019-01-11 21:21:32,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:32,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:32,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:32,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:32,247 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-11 21:21:32,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:32,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:32,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:32,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:32,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:32,250 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2019-01-11 21:21:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:32,324 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-11 21:21:32,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:32,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-11 21:21:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:32,326 INFO L225 Difference]: With dead ends: 52 [2019-01-11 21:21:32,326 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 21:21:32,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 21:21:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-01-11 21:21:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 21:21:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-01-11 21:21:32,333 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 32 [2019-01-11 21:21:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:32,335 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-01-11 21:21:32,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-01-11 21:21:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-11 21:21:32,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:32,336 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] [2019-01-11 21:21:32,336 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:32,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1791632684, now seen corresponding path program 1 times [2019-01-11 21:21:32,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:32,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:32,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:32,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:32,536 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-11 21:21:32,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:32,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-11 21:21:32,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 21:21:32,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 21:21:32,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:21:32,537 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2019-01-11 21:21:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:32,618 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-01-11 21:21:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 21:21:32,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-11 21:21:32,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:32,620 INFO L225 Difference]: With dead ends: 53 [2019-01-11 21:21:32,620 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 21:21:32,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-11 21:21:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 21:21:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-01-11 21:21:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 21:21:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-11 21:21:32,628 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2019-01-11 21:21:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:32,628 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-11 21:21:32,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 21:21:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-11 21:21:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-11 21:21:32,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:21:32,629 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] [2019-01-11 21:21:32,632 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:21:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:21:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1200712151, now seen corresponding path program 1 times [2019-01-11 21:21:32,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:21:32,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:21:32,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:32,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:21:32,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:21:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:21:32,698 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-11 21:21:32,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:21:32,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:21:32,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:21:32,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:21:32,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:32,699 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2019-01-11 21:21:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:21:32,722 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-11 21:21:32,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:21:32,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-11 21:21:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:21:32,724 INFO L225 Difference]: With dead ends: 38 [2019-01-11 21:21:32,724 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:21:32,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:21:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:21:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:21:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:21:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:21:32,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-01-11 21:21:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:21:32,726 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:21:32,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:21:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:21:32,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:21:32,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:21:32,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:32,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:21:33,075 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-11 21:21:33,242 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 21:21:33,568 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-11 21:21:33,909 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-11 21:21:34,566 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-11 21:21:34,669 INFO L444 ceAbstractionStarter]: At program point L102(lines 101 283) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,669 INFO L444 ceAbstractionStarter]: At program point L69(lines 322 367) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,670 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 182) no Hoare annotation was computed. [2019-01-11 21:21:34,670 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 271) no Hoare annotation was computed. [2019-01-11 21:21:34,670 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 282) no Hoare annotation was computed. [2019-01-11 21:21:34,670 INFO L448 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2019-01-11 21:21:34,670 INFO L444 ceAbstractionStarter]: At program point L105(lines 104 282) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,670 INFO L444 ceAbstractionStarter]: At program point L535(lines 527 546) the Hoare annotation is: (and (not (= 1 ~pended~0)) (not (= ~MPR3~0 ~s~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,671 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 411) no Hoare annotation was computed. [2019-01-11 21:21:34,672 INFO L444 ceAbstractionStarter]: At program point L470(lines 443 498) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_KbFilter_PnP_~status~0 0)) (.cse1 (not (= 1 ~pended~0))) (.cse2 (= ~MPR1~0 ~s~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~setEventCalled~0 1)))) [2019-01-11 21:21:34,672 INFO L444 ceAbstractionStarter]: At program point L470-1(lines 443 498) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,672 INFO L444 ceAbstractionStarter]: At program point L470-2(lines 443 498) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,672 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-01-11 21:21:34,672 INFO L444 ceAbstractionStarter]: At program point L470-3(lines 443 498) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,672 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 270) no Hoare annotation was computed. [2019-01-11 21:21:34,672 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 281) no Hoare annotation was computed. [2019-01-11 21:21:34,672 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2019-01-11 21:21:34,673 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 338 348) no Hoare annotation was computed. [2019-01-11 21:21:34,673 INFO L444 ceAbstractionStarter]: At program point L108(lines 107 281) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,673 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 181) no Hoare annotation was computed. [2019-01-11 21:21:34,673 INFO L444 ceAbstractionStarter]: At program point L175-1(lines 1 583) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,673 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,673 INFO L444 ceAbstractionStarter]: At program point L572(lines 564 574) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-01-11 21:21:34,673 INFO L444 ceAbstractionStarter]: At program point L572-1(lines 564 574) the Hoare annotation is: false [2019-01-11 21:21:34,673 INFO L444 ceAbstractionStarter]: At program point L572-2(lines 564 574) the Hoare annotation is: false [2019-01-11 21:21:34,673 INFO L444 ceAbstractionStarter]: At program point L572-3(lines 564 574) the Hoare annotation is: false [2019-01-11 21:21:34,674 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 269) no Hoare annotation was computed. [2019-01-11 21:21:34,674 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 280) no Hoare annotation was computed. [2019-01-11 21:21:34,674 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2019-01-11 21:21:34,674 INFO L444 ceAbstractionStarter]: At program point L540-1(lines 540 544) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,674 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,674 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2019-01-11 21:21:34,674 INFO L444 ceAbstractionStarter]: At program point L375(lines 368 417) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,674 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,675 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-01-11 21:21:34,675 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 268) no Hoare annotation was computed. [2019-01-11 21:21:34,675 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,675 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 279) no Hoare annotation was computed. [2019-01-11 21:21:34,675 INFO L444 ceAbstractionStarter]: At program point L47(lines 339 344) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,675 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-01-11 21:21:34,675 INFO L444 ceAbstractionStarter]: At program point L444-1(lines 444 447) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-01-11 21:21:34,675 INFO L448 ceAbstractionStarter]: For program point L444-2(lines 444 447) no Hoare annotation was computed. [2019-01-11 21:21:34,675 INFO L444 ceAbstractionStarter]: At program point L444-3(lines 444 447) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,676 INFO L448 ceAbstractionStarter]: For program point L444-4(lines 444 447) no Hoare annotation was computed. [2019-01-11 21:21:34,676 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,676 INFO L444 ceAbstractionStarter]: At program point L444-5(lines 444 447) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,676 INFO L448 ceAbstractionStarter]: For program point L444-6(lines 444 447) no Hoare annotation was computed. [2019-01-11 21:21:34,676 INFO L444 ceAbstractionStarter]: At program point L444-7(lines 444 447) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,676 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 495) no Hoare annotation was computed. [2019-01-11 21:21:34,676 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 478 495) no Hoare annotation was computed. [2019-01-11 21:21:34,676 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 495) no Hoare annotation was computed. [2019-01-11 21:21:34,676 INFO L448 ceAbstractionStarter]: For program point L478-3(lines 478 495) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 485) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point L479-3(lines 479 485) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point L479-6(lines 479 485) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 221) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point L479-9(lines 479 485) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 267) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 278) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,677 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-1(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-2(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-3(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-4(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-5(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-6(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-7(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-8(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-9(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-10(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,678 INFO L448 ceAbstractionStarter]: For program point L580-11(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,679 INFO L448 ceAbstractionStarter]: For program point L580-12(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,679 INFO L448 ceAbstractionStarter]: For program point L580-13(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,679 INFO L448 ceAbstractionStarter]: For program point L580-14(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,679 INFO L448 ceAbstractionStarter]: For program point L580-15(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,679 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,679 INFO L444 ceAbstractionStarter]: At program point L581-3(lines 1 583) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_KbFilter_PnP_~status~0 0)) (.cse1 (not (= 1 ~pended~0))) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~NP~0 ~s~0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5) (and (or (and .cse0 .cse1 (= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) .cse2 (= ~MPR3~0 ~s~0) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= ~setEventCalled~0 1)))) [2019-01-11 21:21:34,679 INFO L444 ceAbstractionStarter]: At program point L581-6(lines 1 583) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,680 INFO L444 ceAbstractionStarter]: At program point L383(lines 376 416) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,680 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:21:34,680 INFO L444 ceAbstractionStarter]: At program point L581-8(lines 1 583) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,680 INFO L444 ceAbstractionStarter]: At program point L581-9(lines 1 583) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,680 INFO L444 ceAbstractionStarter]: At program point L284(lines 74 286) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,680 INFO L444 ceAbstractionStarter]: At program point L581-11(lines 1 583) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,680 INFO L444 ceAbstractionStarter]: At program point L581-12(lines 1 583) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,680 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 266) no Hoare annotation was computed. [2019-01-11 21:21:34,680 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 277) no Hoare annotation was computed. [2019-01-11 21:21:34,681 INFO L444 ceAbstractionStarter]: At program point L581-14(lines 1 583) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,681 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 561) no Hoare annotation was computed. [2019-01-11 21:21:34,681 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 473) no Hoare annotation was computed. [2019-01-11 21:21:34,681 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 450 473) no Hoare annotation was computed. [2019-01-11 21:21:34,681 INFO L448 ceAbstractionStarter]: For program point L450-2(lines 450 473) no Hoare annotation was computed. [2019-01-11 21:21:34,681 INFO L451 ceAbstractionStarter]: At program point L384(lines 368 417) the Hoare annotation is: true [2019-01-11 21:21:34,681 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 366) no Hoare annotation was computed. [2019-01-11 21:21:34,681 INFO L448 ceAbstractionStarter]: For program point L450-3(lines 450 473) no Hoare annotation was computed. [2019-01-11 21:21:34,681 INFO L444 ceAbstractionStarter]: At program point L550(lines 549 561) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,681 INFO L444 ceAbstractionStarter]: At program point L451(lines 450 473) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,682 INFO L444 ceAbstractionStarter]: At program point L451-1(lines 450 473) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,682 INFO L444 ceAbstractionStarter]: At program point L451-2(lines 450 473) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,682 INFO L448 ceAbstractionStarter]: For program point L385(lines 385 414) no Hoare annotation was computed. [2019-01-11 21:21:34,682 INFO L444 ceAbstractionStarter]: At program point L352(lines 351 366) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,682 INFO L444 ceAbstractionStarter]: At program point L451-3(lines 450 473) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,682 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,682 INFO L451 ceAbstractionStarter]: At program point L419(lines 287 421) the Hoare annotation is: true [2019-01-11 21:21:34,682 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 413) no Hoare annotation was computed. [2019-01-11 21:21:34,683 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 265) no Hoare annotation was computed. [2019-01-11 21:21:34,683 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 276) no Hoare annotation was computed. [2019-01-11 21:21:34,683 INFO L444 ceAbstractionStarter]: At program point L552(lines 551 561) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,683 INFO L444 ceAbstractionStarter]: At program point L519(lines 514 521) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-01-11 21:21:34,683 INFO L444 ceAbstractionStarter]: At program point L519-1(lines 514 521) the Hoare annotation is: false [2019-01-11 21:21:34,683 INFO L444 ceAbstractionStarter]: At program point L519-2(lines 514 521) the Hoare annotation is: false [2019-01-11 21:21:34,683 INFO L444 ceAbstractionStarter]: At program point L519-3(lines 514 521) the Hoare annotation is: false [2019-01-11 21:21:34,683 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2019-01-11 21:21:34,683 INFO L444 ceAbstractionStarter]: At program point L354(lines 353 366) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 494) no Hoare annotation was computed. [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point L487-2(lines 487 494) no Hoare annotation was computed. [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 390) no Hoare annotation was computed. [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point L487-4(lines 487 494) no Hoare annotation was computed. [2019-01-11 21:21:34,684 INFO L444 ceAbstractionStarter]: At program point L322(lines 296 420) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point L487-6(lines 487 494) no Hoare annotation was computed. [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 472) no Hoare annotation was computed. [2019-01-11 21:21:34,684 INFO L448 ceAbstractionStarter]: For program point L455-1(lines 455 472) no Hoare annotation was computed. [2019-01-11 21:21:34,685 INFO L448 ceAbstractionStarter]: For program point L455-2(lines 455 472) no Hoare annotation was computed. [2019-01-11 21:21:34,685 INFO L448 ceAbstractionStarter]: For program point L455-3(lines 455 472) no Hoare annotation was computed. [2019-01-11 21:21:34,685 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 197) no Hoare annotation was computed. [2019-01-11 21:21:34,685 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 264) no Hoare annotation was computed. [2019-01-11 21:21:34,685 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 275) no Hoare annotation was computed. [2019-01-11 21:21:34,685 INFO L448 ceAbstractionStarter]: For program point L191-2(lines 165 260) no Hoare annotation was computed. [2019-01-11 21:21:34,685 INFO L444 ceAbstractionStarter]: At program point L522(lines 522 563) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,685 INFO L444 ceAbstractionStarter]: At program point L456(lines 455 472) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-01-11 21:21:34,685 INFO L444 ceAbstractionStarter]: At program point L456-1(lines 455 472) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,685 INFO L444 ceAbstractionStarter]: At program point L456-2(lines 455 472) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,686 INFO L444 ceAbstractionStarter]: At program point L456-3(lines 455 472) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,686 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:21:34,686 INFO L444 ceAbstractionStarter]: At program point L458(lines 457 472) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-01-11 21:21:34,686 INFO L444 ceAbstractionStarter]: At program point L458-1(lines 457 472) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,686 INFO L444 ceAbstractionStarter]: At program point L458-2(lines 457 472) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,686 INFO L444 ceAbstractionStarter]: At program point L458-3(lines 457 472) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-01-11 21:21:34,686 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 263) no Hoare annotation was computed. [2019-01-11 21:21:34,687 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 274) no Hoare annotation was computed. [2019-01-11 21:21:34,687 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 432) no Hoare annotation was computed. [2019-01-11 21:21:34,687 INFO L448 ceAbstractionStarter]: For program point L426-2(lines 426 432) no Hoare annotation was computed. [2019-01-11 21:21:34,687 INFO L448 ceAbstractionStarter]: For program point L426-4(lines 426 432) no Hoare annotation was computed. [2019-01-11 21:21:34,687 INFO L444 ceAbstractionStarter]: At program point L261(lines 165 262) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,687 INFO L448 ceAbstractionStarter]: For program point L426-6(lines 426 432) no Hoare annotation was computed. [2019-01-11 21:21:34,687 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 546) no Hoare annotation was computed. [2019-01-11 21:21:34,687 INFO L444 ceAbstractionStarter]: At program point L395(lines 386 413) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,687 INFO L444 ceAbstractionStarter]: At program point L164(lines 110 280) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,688 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 273) no Hoare annotation was computed. [2019-01-11 21:21:34,688 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-11 21:21:34,688 INFO L448 ceAbstractionStarter]: For program point L528(lines 528 533) no Hoare annotation was computed. [2019-01-11 21:21:34,688 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 237) no Hoare annotation was computed. [2019-01-11 21:21:34,688 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2019-01-11 21:21:34,688 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 334) no Hoare annotation was computed. [2019-01-11 21:21:34,688 INFO L448 ceAbstractionStarter]: For program point L331-2(lines 331 334) no Hoare annotation was computed. [2019-01-11 21:21:34,688 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 205) no Hoare annotation was computed. [2019-01-11 21:21:34,688 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-11 21:21:34,689 INFO L444 ceAbstractionStarter]: At program point L497(lines 436 499) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_KbFilter_PnP_~status~0 0)) (.cse1 (not (= 1 ~pended~0))) (.cse2 (= ULTIMATE.start_main_~status~1 0)) (.cse3 (= ~NP~0 ~s~0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5) (and (or (and .cse0 .cse1 (= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) .cse2 (= ~MPR3~0 ~s~0) .cse4 (<= 259 |ULTIMATE.start_IofCallDriver_#res|) (<= |ULTIMATE.start_IofCallDriver_#res| 259) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= ~setEventCalled~0 1)))) [2019-01-11 21:21:34,689 INFO L444 ceAbstractionStarter]: At program point L497-1(lines 436 499) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,689 INFO L444 ceAbstractionStarter]: At program point L497-2(lines 436 499) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,689 INFO L444 ceAbstractionStarter]: At program point L497-3(lines 436 499) the Hoare annotation is: (and (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (not (= 1 ~pended~0)) (= ~compRegistered~0 0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-01-11 21:21:34,689 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 204) no Hoare annotation was computed. [2019-01-11 21:21:34,689 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 272) no Hoare annotation was computed. [2019-01-11 21:21:34,689 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 283) no Hoare annotation was computed. [2019-01-11 21:21:34,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:21:34 BoogieIcfgContainer [2019-01-11 21:21:34,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:21:34,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:21:34,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:21:34,730 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:21:34,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:21:27" (3/4) ... [2019-01-11 21:21:34,734 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:21:34,776 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2019-01-11 21:21:34,781 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-11 21:21:34,786 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-11 21:21:34,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((status == 0 && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && 0 == \result) && 0 == returnVal2) && NP + 4 <= MPR1) || ((((((((((status == 0 && !(1 == pended)) && returnVal2 == 259) && status == 0) && MPR3 == s) && 1 <= compRegistered) && 259 <= \result) && \result <= 259) && NP + 4 <= MPR1) || (((((status == 0 && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1)) && setEventCalled == 1) [2019-01-11 21:21:34,952 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:21:34,952 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:21:34,955 INFO L168 Benchmark]: Toolchain (without parser) took 9666.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 951.3 MB in the beginning and 963.9 MB in the end (delta: -12.5 MB). Peak memory consumption was 200.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:34,956 INFO L168 Benchmark]: CDTParser took 0.15 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-11 21:21:34,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:34,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:34,956 INFO L168 Benchmark]: Boogie Preprocessor took 59.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:21:34,957 INFO L168 Benchmark]: RCFGBuilder took 1433.64 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:34,957 INFO L168 Benchmark]: TraceAbstraction took 7434.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 979.2 MB in the end (delta: 98.9 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:34,957 INFO L168 Benchmark]: Witness Printer took 222.71 ms. Allocated memory is still 1.2 GB. Free memory was 979.2 MB in the beginning and 963.9 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-01-11 21:21:34,959 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.15 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 357.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 154.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1433.64 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: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7434.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 979.2 MB in the end (delta: 98.9 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. * Witness Printer took 222.71 ms. Allocated memory is still 1.2 GB. Free memory was 979.2 MB in the beginning and 963.9 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: (((!(1 == pended) && compRegistered == 0) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: (((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((status == 0 && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && 0 == returnVal2) && NP + 4 <= MPR1) || ((((((((status == 0 && !(1 == pended)) && returnVal2 == 259) && status == 0) && MPR3 == s) && 1 <= compRegistered) && NP + 4 <= MPR1) || (((((status == 0 && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1)) && setEventCalled == 1) - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: (((((status == 0 && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: (((((((status == 0 && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && 0 == \result) && 0 == returnVal2) && NP + 4 <= MPR1) || ((((((((((status == 0 && !(1 == pended)) && returnVal2 == 259) && status == 0) && MPR3 == s) && 1 <= compRegistered) && 259 <= \result) && \result <= 259) && NP + 4 <= MPR1) || (((((status == 0 && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1)) && setEventCalled == 1) - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: (((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: (((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((!(1 == pended) && !(MPR3 == s)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (((!(1 == pended) && compRegistered == 0) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((status == 0 && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: (((((status == 0 && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((status == 0 && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && compRegistered == 0) && !(1 == pended)) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((((status == 0 && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && 0 == returnVal2) && NP + 4 <= MPR1) || ((((((status == 0 && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1) - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: (((((status == 0 && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && compRegistered == 0) && !(1 == pended)) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: (((!(1 == pended) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((status == 0 && !(1 == pended)) && compRegistered == 0) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && compRegistered == 0) && !(1 == pended)) && status == 0) && NP + 4 <= MPR1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 173 locations, 16 error locations. SAFE Result, 7.3s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2113 SDtfs, 1457 SDslu, 1788 SDs, 0 SdLazy, 533 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 221 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 61 LocationsWithAnnotation, 61 PreInvPairs, 131 NumberOfFragments, 1217 HoareAnnotationTreeSize, 61 FomulaSimplifications, 2180 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 61 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 18768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...