./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer --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 75f71671f83387eb35a445031d63abe79f5c0c7c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:56:17,308 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:56:17,310 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:56:17,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:56:17,318 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:56:17,319 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:56:17,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:56:17,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:56:17,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:56:17,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:56:17,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:56:17,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:56:17,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:56:17,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:56:17,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:56:17,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:56:17,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:56:17,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:56:17,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:56:17,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:56:17,333 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:56:17,334 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:56:17,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:56:17,336 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:56:17,336 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:56:17,336 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:56:17,337 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:56:17,338 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:56:17,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:56:17,339 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:56:17,339 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:56:17,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:56:17,340 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:56:17,340 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:56:17,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:56:17,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:56:17,342 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 05:56:17,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:56:17,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:56:17,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:56:17,353 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:56:17,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:56:17,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:56:17,353 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:56:17,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:56:17,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:56:17,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:56:17,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:56:17,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:56:17,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:56:17,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:56:17,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:56:17,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:56:17,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:56:17,355 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:56:17,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:56:17,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:56:17,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:56:17,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:56:17,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:56:17,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:56:17,356 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:56:17,356 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:56:17,356 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:56:17,356 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:56:17,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:56:17,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:56:17,357 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer 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 -> 75f71671f83387eb35a445031d63abe79f5c0c7c [2018-11-23 05:56:17,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:56:17,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:56:17,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:56:17,389 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:56:17,389 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:56:17,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/../../sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-23 05:56:17,425 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/data/743cdb4a9/af47ea12c07c43a6a63e6fd986cfca07/FLAG3f928a4d9 [2018-11-23 05:56:17,775 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:56:17,776 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/sv-benchmarks/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-23 05:56:17,782 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/data/743cdb4a9/af47ea12c07c43a6a63e6fd986cfca07/FLAG3f928a4d9 [2018-11-23 05:56:18,186 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/data/743cdb4a9/af47ea12c07c43a6a63e6fd986cfca07 [2018-11-23 05:56:18,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:56:18,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:56:18,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:56:18,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:56:18,192 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:56:18,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee9d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18, skipping insertion in model container [2018-11-23 05:56:18,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:56:18,220 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:56:18,362 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:56:18,365 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:56:18,388 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:56:18,396 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:56:18,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18 WrapperNode [2018-11-23 05:56:18,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:56:18,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:56:18,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:56:18,397 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:56:18,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:56:18,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:56:18,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:56:18,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:56:18,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... [2018-11-23 05:56:18,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:56:18,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:56:18,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:56:18,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:56:18,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:56:18,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:56:18,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:56:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:56:18,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:56:18,497 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:56:18,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:56:18,718 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:56:18,719 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 05:56:18,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:56:18 BoogieIcfgContainer [2018-11-23 05:56:18,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:56:18,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:56:18,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:56:18,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:56:18,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:56:18" (1/3) ... [2018-11-23 05:56:18,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526f179e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:56:18, skipping insertion in model container [2018-11-23 05:56:18,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:56:18" (2/3) ... [2018-11-23 05:56:18,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526f179e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:56:18, skipping insertion in model container [2018-11-23 05:56:18,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:56:18" (3/3) ... [2018-11-23 05:56:18,727 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-23 05:56:18,734 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:56:18,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-23 05:56:18,749 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-23 05:56:18,768 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:56:18,769 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:56:18,769 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:56:18,769 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:56:18,769 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:56:18,769 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:56:18,769 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:56:18,769 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:56:18,769 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:56:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-11-23 05:56:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:56:18,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:18,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:18,789 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:18,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:18,792 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2018-11-23 05:56:18,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:18,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:18,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:18,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:18,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:56:18,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:56:18,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:56:18,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:56:18,942 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2018-11-23 05:56:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:19,120 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2018-11-23 05:56:19,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:56:19,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 05:56:19,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:19,127 INFO L225 Difference]: With dead ends: 127 [2018-11-23 05:56:19,127 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 05:56:19,129 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 [2018-11-23 05:56:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 05:56:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2018-11-23 05:56:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 05:56:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-23 05:56:19,154 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2018-11-23 05:56:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:19,154 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-23 05:56:19,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:56:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-23 05:56:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 05:56:19,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:19,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:19,155 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:19,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2018-11-23 05:56:19,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:19,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:19,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:19,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:19,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:56:19,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:56:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:56:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:56:19,220 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2018-11-23 05:56:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:19,304 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-23 05:56:19,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:56:19,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 05:56:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:19,306 INFO L225 Difference]: With dead ends: 111 [2018-11-23 05:56:19,306 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 05:56:19,306 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 [2018-11-23 05:56:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 05:56:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2018-11-23 05:56:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 05:56:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 05:56:19,312 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2018-11-23 05:56:19,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:19,312 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 05:56:19,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:56:19,312 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 05:56:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:56:19,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:19,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:19,313 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:19,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:19,314 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2018-11-23 05:56:19,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:19,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:19,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:19,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:19,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:19,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:19,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:19,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:19,371 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-11-23 05:56:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:19,482 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-23 05:56:19,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:56:19,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 05:56:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:19,483 INFO L225 Difference]: With dead ends: 109 [2018-11-23 05:56:19,483 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 05:56:19,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:56:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 05:56:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2018-11-23 05:56:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 05:56:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 05:56:19,491 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2018-11-23 05:56:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:19,491 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 05:56:19,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 05:56:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 05:56:19,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:19,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:19,493 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:19,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:19,493 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2018-11-23 05:56:19,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:19,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:19,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:19,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:19,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:19,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:19,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:19,542 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-11-23 05:56:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:19,673 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-11-23 05:56:19,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:56:19,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 05:56:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:19,674 INFO L225 Difference]: With dead ends: 105 [2018-11-23 05:56:19,675 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 05:56:19,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:56:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 05:56:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 67. [2018-11-23 05:56:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 05:56:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 05:56:19,680 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2018-11-23 05:56:19,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:19,680 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 05:56:19,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 05:56:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:56:19,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:19,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:19,682 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:19,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2018-11-23 05:56:19,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:19,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:19,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:19,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:19,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:19,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:19,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:19,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:19,730 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-11-23 05:56:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:19,843 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-11-23 05:56:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:56:19,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 05:56:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:19,844 INFO L225 Difference]: With dead ends: 150 [2018-11-23 05:56:19,845 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 05:56:19,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:56:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 05:56:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 65. [2018-11-23 05:56:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 05:56:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-23 05:56:19,852 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2018-11-23 05:56:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:19,852 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-23 05:56:19,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 05:56:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:56:19,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:19,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:19,854 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:19,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2018-11-23 05:56:19,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:19,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:19,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:19,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:19,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:19,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:19,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:19,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:19,893 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-11-23 05:56:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:19,960 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-23 05:56:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:56:19,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 05:56:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:19,962 INFO L225 Difference]: With dead ends: 101 [2018-11-23 05:56:19,962 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 05:56:19,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:56:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 05:56:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2018-11-23 05:56:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 05:56:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 05:56:19,968 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2018-11-23 05:56:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:19,968 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 05:56:19,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 05:56:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:56:19,969 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:19,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:19,971 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:19,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2018-11-23 05:56:19,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:19,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:20,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:20,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:20,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:20,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:20,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:20,011 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-11-23 05:56:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:20,137 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-23 05:56:20,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:56:20,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 05:56:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:20,139 INFO L225 Difference]: With dead ends: 99 [2018-11-23 05:56:20,139 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 05:56:20,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:56:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 05:56:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2018-11-23 05:56:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 05:56:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 05:56:20,144 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2018-11-23 05:56:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:20,145 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 05:56:20,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 05:56:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:56:20,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:20,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:20,146 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:20,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2018-11-23 05:56:20,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:20,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:20,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:20,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:20,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:20,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:20,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:20,169 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-11-23 05:56:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:20,241 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-23 05:56:20,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:56:20,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 05:56:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:20,242 INFO L225 Difference]: With dead ends: 93 [2018-11-23 05:56:20,242 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 05:56:20,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:56:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 05:56:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2018-11-23 05:56:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 05:56:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 05:56:20,247 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2018-11-23 05:56:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:20,247 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 05:56:20,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 05:56:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:56:20,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:20,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:20,248 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:20,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2018-11-23 05:56:20,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:20,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:20,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:20,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:20,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:56:20,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:56:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:56:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:56:20,317 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 9 states. [2018-11-23 05:56:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:20,415 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-11-23 05:56:20,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:56:20,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-23 05:56:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:20,416 INFO L225 Difference]: With dead ends: 94 [2018-11-23 05:56:20,416 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 05:56:20,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:56:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 05:56:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2018-11-23 05:56:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 05:56:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-23 05:56:20,421 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2018-11-23 05:56:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:20,421 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-23 05:56:20,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:56:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-23 05:56:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:56:20,422 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:20,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:20,422 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:20,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:20,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2018-11-23 05:56:20,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:20,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:20,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:20,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:56:20,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:56:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:56:20,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:56:20,491 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 9 states. [2018-11-23 05:56:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:20,593 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-23 05:56:20,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:56:20,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-23 05:56:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:20,594 INFO L225 Difference]: With dead ends: 85 [2018-11-23 05:56:20,595 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 05:56:20,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:56:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 05:56:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2018-11-23 05:56:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 05:56:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 05:56:20,599 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-11-23 05:56:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:20,599 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 05:56:20,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:56:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 05:56:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:56:20,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:20,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:20,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:20,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2018-11-23 05:56:20,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:20,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:20,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:20,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:20,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:20,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:20,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:20,637 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-11-23 05:56:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:20,716 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-23 05:56:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:56:20,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 05:56:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:20,717 INFO L225 Difference]: With dead ends: 115 [2018-11-23 05:56:20,717 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 05:56:20,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:56:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 05:56:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 49. [2018-11-23 05:56:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 05:56:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 05:56:20,722 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2018-11-23 05:56:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:20,723 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 05:56:20,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 05:56:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 05:56:20,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:20,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:20,724 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:20,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2018-11-23 05:56:20,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:20,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:20,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:20,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:20,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:20,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:20,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:20,760 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-11-23 05:56:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:20,827 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-23 05:56:20,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:56:20,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 05:56:20,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:20,828 INFO L225 Difference]: With dead ends: 77 [2018-11-23 05:56:20,828 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 05:56:20,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:56:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 05:56:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 47. [2018-11-23 05:56:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 05:56:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 05:56:20,832 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-11-23 05:56:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:20,832 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 05:56:20,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 05:56:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 05:56:20,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:20,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:20,834 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:20,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:20,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2018-11-23 05:56:20,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:20,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:20,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:20,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:20,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:20,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:20,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:20,865 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-11-23 05:56:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:20,942 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-11-23 05:56:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:56:20,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 05:56:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:20,943 INFO L225 Difference]: With dead ends: 113 [2018-11-23 05:56:20,943 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 05:56:20,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:56:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 05:56:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 45. [2018-11-23 05:56:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 05:56:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 05:56:20,947 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-23 05:56:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:20,947 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 05:56:20,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 05:56:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 05:56:20,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:20,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:20,948 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:20,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:20,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2018-11-23 05:56:20,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:20,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:20,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:20,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:21,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:21,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:56:21,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:56:21,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:56:21,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:56:21,015 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 9 states. [2018-11-23 05:56:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:21,103 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-23 05:56:21,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:56:21,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 05:56:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:21,104 INFO L225 Difference]: With dead ends: 60 [2018-11-23 05:56:21,104 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 05:56:21,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:56:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 05:56:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2018-11-23 05:56:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 05:56:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 05:56:21,108 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-23 05:56:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:21,108 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 05:56:21,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:56:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 05:56:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 05:56:21,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:21,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:21,110 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:21,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2018-11-23 05:56:21,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:21,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:21,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:21,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:21,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:56:21,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:56:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:56:21,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:56:21,162 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-11-23 05:56:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:21,235 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 05:56:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:56:21,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 05:56:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:21,236 INFO L225 Difference]: With dead ends: 44 [2018-11-23 05:56:21,236 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 05:56:21,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:56:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 05:56:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 05:56:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 05:56:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 05:56:21,241 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-11-23 05:56:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:21,241 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 05:56:21,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:56:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 05:56:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:56:21,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:21,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:56:21,242 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:21,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2018-11-23 05:56:21,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:21,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:21,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:21,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:21,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:56:21,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:56:21,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:56:21,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:56:21,316 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-11-23 05:56:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:21,415 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-23 05:56:21,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:56:21,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-23 05:56:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:21,417 INFO L225 Difference]: With dead ends: 55 [2018-11-23 05:56:21,417 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 05:56:21,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:56:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 05:56:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-11-23 05:56:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 05:56:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 05:56:21,425 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2018-11-23 05:56:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:21,425 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 05:56:21,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:56:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 05:56:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:56:21,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:21,426 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] [2018-11-23 05:56:21,427 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:21,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2018-11-23 05:56:21,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:21,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:21,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:21,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:21,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 05:56:21,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:56:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:56:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:56:21,456 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2018-11-23 05:56:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:21,549 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 05:56:21,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:56:21,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 05:56:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:21,550 INFO L225 Difference]: With dead ends: 53 [2018-11-23 05:56:21,550 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 05:56:21,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:56:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 05:56:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-23 05:56:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 05:56:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 05:56:21,556 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2018-11-23 05:56:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:21,556 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 05:56:21,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:56:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 05:56:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 05:56:21,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:56:21,557 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] [2018-11-23 05:56:21,557 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:56:21,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:56:21,557 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2018-11-23 05:56:21,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:56:21,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:56:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:21,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:56:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:56:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:56:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:56:21,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:56:21,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:56:21,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:56:21,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:56:21,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:56:21,589 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-11-23 05:56:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:56:21,679 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-23 05:56:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:56:21,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 05:56:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:56:21,679 INFO L225 Difference]: With dead ends: 49 [2018-11-23 05:56:21,680 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:56:21,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:56:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:56:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:56:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:56:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:56:21,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 05:56:21,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:56:21,681 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:56:21,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:56:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:56:21,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:56:21,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 05:56:21,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:56:21,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:56:22,040 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 13 [2018-11-23 05:56:22,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:56:22,043 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:56:22,043 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:56:22,043 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:56:22,043 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 05:56:22,043 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:56:22,043 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:56:22,043 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2018-11-23 05:56:22,043 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2018-11-23 05:56:22,043 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2018-11-23 05:56:22,043 INFO L448 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2018-11-23 05:56:22,044 INFO L451 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2018-11-23 05:56:22,044 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-23 05:56:22,045 INFO L444 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-23 05:56:22,045 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-23 05:56:22,046 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2018-11-23 05:56:22,047 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2018-11-23 05:56:22,048 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2018-11-23 05:56:22,048 INFO L444 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~13)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0)) [2018-11-23 05:56:22,048 INFO L444 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (or (<= 1 main_~main__t~0) (= main_~__VERIFIER_assert__cond~0 1)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-23 05:56:22,048 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2018-11-23 05:56:22,048 INFO L448 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2018-11-23 05:56:22,048 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-23 05:56:22,048 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2018-11-23 05:56:22,048 INFO L448 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-11-23 05:56:22,048 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2018-11-23 05:56:22,048 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2018-11-23 05:56:22,050 INFO L444 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-23 05:56:22,050 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2018-11-23 05:56:22,050 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-23 05:56:22,050 INFO L448 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2018-11-23 05:56:22,050 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-23 05:56:22,050 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2018-11-23 05:56:22,050 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-23 05:56:22,050 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2018-11-23 05:56:22,050 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2018-11-23 05:56:22,050 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-11-23 05:56:22,051 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-23 05:56:22,051 INFO L448 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2018-11-23 05:56:22,051 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2018-11-23 05:56:22,051 INFO L448 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2018-11-23 05:56:22,051 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-23 05:56:22,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:56:22 BoogieIcfgContainer [2018-11-23 05:56:22,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:56:22,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:56:22,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:56:22,069 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:56:22,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:56:18" (3/4) ... [2018-11-23 05:56:22,072 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 05:56:22,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 05:56:22,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 05:56:22,084 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 05:56:22,084 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 05:56:22,141 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e4b75577-40e8-47d8-9b45-a83941dea43d/bin-2019/uautomizer/witness.graphml [2018-11-23 05:56:22,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:56:22,142 INFO L168 Benchmark]: Toolchain (without parser) took 3953.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 958.0 MB in the beginning and 837.4 MB in the end (delta: 120.7 MB). Peak memory consumption was 331.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:56:22,143 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:56:22,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.34 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:56:22,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.53 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:56:22,143 INFO L168 Benchmark]: Boogie Preprocessor took 15.64 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:56:22,143 INFO L168 Benchmark]: RCFGBuilder took 293.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:56:22,144 INFO L168 Benchmark]: TraceAbstraction took 3348.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 842.4 MB in the end (delta: 271.6 MB). Peak memory consumption was 332.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:56:22,144 INFO L168 Benchmark]: Witness Printer took 72.88 ms. Allocated memory is still 1.2 GB. Free memory was 842.4 MB in the beginning and 837.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:56:22,145 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 207.34 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.53 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.64 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 293.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3348.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 842.4 MB in the end (delta: 271.6 MB). Peak memory consumption was 332.9 MB. Max. memory is 11.5 GB. * Witness Printer took 72.88 ms. Allocated memory is still 1.2 GB. Free memory was 842.4 MB in the beginning and 837.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((1 <= main__t || __VERIFIER_assert__cond == 1) && main__t + 1 <= main__tagbuf_len) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. SAFE Result, 3.2s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 872 SDtfs, 2467 SDslu, 1673 SDs, 0 SdLazy, 1819 SolverSat, 263 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, 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.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 614 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 54 HoareAnnotationTreeSize, 9 FomulaSimplifications, 9989709 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 16618 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 11454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...