./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 678e0110
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c347afff8e447ace50221adb149313f25c6a4a0
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.1.24-678e011
[2019-11-19 20:51:41,669 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-11-19 20:51:41,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-19 20:51:41,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-19 20:51:41,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-19 20:51:41,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-19 20:51:41,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-19 20:51:41,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-19 20:51:41,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-19 20:51:41,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-19 20:51:41,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-11-19 20:51:41,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-19 20:51:41,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-19 20:51:41,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-19 20:51:41,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-19 20:51:41,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-19 20:51:41,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-19 20:51:41,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-19 20:51:41,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-19 20:51:41,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-19 20:51:41,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-19 20:51:41,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-19 20:51:41,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-11-19 20:51:41,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-19 20:51:41,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-19 20:51:41,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-19 20:51:41,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-19 20:51:41,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-19 20:51:41,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-19 20:51:41,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-19 20:51:41,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-19 20:51:41,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-19 20:51:41,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-19 20:51:41,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-19 20:51:41,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-19 20:51:41,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-19 20:51:41,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-19 20:51:41,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-19 20:51:41,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-19 20:51:41,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-19 20:51:41,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-11-19 20:51:41,737 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2019-11-19 20:51:41,758 INFO L113 SettingsManager]: Loading preferences was successful
[2019-11-19 20:51:41,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-19 20:51:41,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-11-19 20:51:41,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-11-19 20:51:41,761 INFO L138 SettingsManager]: * Use SBE=true
[2019-11-19 20:51:41,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-19 20:51:41,761 INFO L138 SettingsManager]: * sizeof long=4
[2019-11-19 20:51:41,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-11-19 20:51:41,762 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-11-19 20:51:41,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-11-19 20:51:41,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-11-19 20:51:41,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-11-19 20:51:41,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-11-19 20:51:41,764 INFO L138 SettingsManager]: * sizeof long double=12
[2019-11-19 20:51:41,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-11-19 20:51:41,765 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-11-19 20:51:41,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-11-19 20:51:41,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-19 20:51:41,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-11-19 20:51:41,766 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-11-19 20:51:41,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-11-19 20:51:41,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-19 20:51:41,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-19 20:51:41,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-11-19 20:51:41,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-11-19 20:51:41,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-11-19 20:51:41,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-11-19 20:51:41,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-11-19 20:51:41,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c347afff8e447ace50221adb149313f25c6a4a0
[2019-11-19 20:51:42,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-19 20:51:42,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-19 20:51:42,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-19 20:51:42,104 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-11-19 20:51:42,104 INFO L275 PluginConnector]: CDTParser initialized
[2019-11-19 20:51:42,105 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c
[2019-11-19 20:51:42,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03554f896/76701cb15ab44add9a6d2360417e32a1/FLAGffb3799cd
[2019-11-19 20:51:42,715 INFO L306 CDTParser]: Found 1 translation units.
[2019-11-19 20:51:42,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c
[2019-11-19 20:51:42,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03554f896/76701cb15ab44add9a6d2360417e32a1/FLAGffb3799cd
[2019-11-19 20:51:43,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03554f896/76701cb15ab44add9a6d2360417e32a1
[2019-11-19 20:51:43,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-19 20:51:43,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2019-11-19 20:51:43,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-19 20:51:43,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-19 20:51:43,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-19 20:51:43,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f645ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43, skipping insertion in model container
[2019-11-19 20:51:43,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,048 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-11-19 20:51:43,099 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-11-19 20:51:43,397 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-11-19 20:51:43,468 INFO L188 MainTranslator]: Completed pre-run
[2019-11-19 20:51:43,560 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-11-19 20:51:43,575 INFO L192 MainTranslator]: Completed translation
[2019-11-19 20:51:43,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43 WrapperNode
[2019-11-19 20:51:43,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-19 20:51:43,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-11-19 20:51:43,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-11-19 20:51:43,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2019-11-19 20:51:43,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-11-19 20:51:43,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-19 20:51:43,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-19 20:51:43,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-11-19 20:51:43,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
[2019-11-19 20:51:43,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-19 20:51:43,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-19 20:51:43,707 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-11-19 20:51:43,708 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-11-19 20:51:43,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-19 20:51:43,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-19 20:51:43,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-19 20:51:43,900 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2019-11-19 20:51:44,633 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false;
[2019-11-19 20:51:44,634 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false;
[2019-11-19 20:51:44,635 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-19 20:51:44,636 INFO L285 CfgBuilder]: Removed 7 assume(true) statements.
[2019-11-19 20:51:44,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:44 BoogieIcfgContainer
[2019-11-19 20:51:44,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-19 20:51:44,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-11-19 20:51:44,640 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-11-19 20:51:44,643 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-11-19 20:51:44,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:51:43" (1/3) ...
[2019-11-19 20:51:44,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8859742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:44, skipping insertion in model container
[2019-11-19 20:51:44,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:51:43" (2/3) ...
[2019-11-19 20:51:44,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8859742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:51:44, skipping insertion in model container
[2019-11-19 20:51:44,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:44" (3/3) ...
[2019-11-19 20:51:44,647 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-2.c
[2019-11-19 20:51:44,655 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-11-19 20:51:44,662 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-11-19 20:51:44,674 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-11-19 20:51:44,700 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-11-19 20:51:44,700 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-11-19 20:51:44,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-11-19 20:51:44,700 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-19 20:51:44,700 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-19 20:51:44,701 INFO L378 AbstractCegarLoop]: Difference is false
[2019-11-19 20:51:44,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-19 20:51:44,701 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-11-19 20:51:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states.
[2019-11-19 20:51:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2019-11-19 20:51:44,733 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:44,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:44,735 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times
[2019-11-19 20:51:44,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:44,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409243615]
[2019-11-19 20:51:44,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:45,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409243615]
[2019-11-19 20:51:45,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:45,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:45,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005306097]
[2019-11-19 20:51:45,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:45,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:45,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:45,110 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states.
[2019-11-19 20:51:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:45,478 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions.
[2019-11-19 20:51:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:45,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43
[2019-11-19 20:51:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:45,498 INFO L225 Difference]: With dead ends: 327
[2019-11-19 20:51:45,498 INFO L226 Difference]: Without dead ends: 174
[2019-11-19 20:51:45,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states.
[2019-11-19 20:51:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169.
[2019-11-19 20:51:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states.
[2019-11-19 20:51:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions.
[2019-11-19 20:51:45,569 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43
[2019-11-19 20:51:45,570 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:45,571 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions.
[2019-11-19 20:51:45,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions.
[2019-11-19 20:51:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2019-11-19 20:51:45,577 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:45,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:45,578 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:45,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:45,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times
[2019-11-19 20:51:45,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:45,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95156727]
[2019-11-19 20:51:45,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:45,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95156727]
[2019-11-19 20:51:45,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:45,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:45,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270245971]
[2019-11-19 20:51:45,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:45,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:45,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:45,712 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states.
[2019-11-19 20:51:45,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:45,982 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions.
[2019-11-19 20:51:45,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:45,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44
[2019-11-19 20:51:45,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:45,986 INFO L225 Difference]: With dead ends: 379
[2019-11-19 20:51:45,986 INFO L226 Difference]: Without dead ends: 215
[2019-11-19 20:51:45,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states.
[2019-11-19 20:51:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210.
[2019-11-19 20:51:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states.
[2019-11-19 20:51:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions.
[2019-11-19 20:51:46,015 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44
[2019-11-19 20:51:46,015 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:46,016 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions.
[2019-11-19 20:51:46,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions.
[2019-11-19 20:51:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2019-11-19 20:51:46,024 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:46,025 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:46,026 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:46,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:46,026 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times
[2019-11-19 20:51:46,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:46,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430312651]
[2019-11-19 20:51:46,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:46,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430312651]
[2019-11-19 20:51:46,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:46,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:46,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768797138]
[2019-11-19 20:51:46,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:46,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:46,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,161 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states.
[2019-11-19 20:51:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:46,363 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions.
[2019-11-19 20:51:46,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:46,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71
[2019-11-19 20:51:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:46,367 INFO L225 Difference]: With dead ends: 444
[2019-11-19 20:51:46,367 INFO L226 Difference]: Without dead ends: 241
[2019-11-19 20:51:46,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states.
[2019-11-19 20:51:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241.
[2019-11-19 20:51:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states.
[2019-11-19 20:51:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions.
[2019-11-19 20:51:46,390 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71
[2019-11-19 20:51:46,390 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:46,391 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions.
[2019-11-19 20:51:46,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions.
[2019-11-19 20:51:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2019-11-19 20:51:46,394 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:46,394 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:46,394 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:46,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times
[2019-11-19 20:51:46,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:46,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218679288]
[2019-11-19 20:51:46,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2019-11-19 20:51:46,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218679288]
[2019-11-19 20:51:46,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:46,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:46,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413601650]
[2019-11-19 20:51:46,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:46,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,448 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states.
[2019-11-19 20:51:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:46,601 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions.
[2019-11-19 20:51:46,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:46,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83
[2019-11-19 20:51:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:46,604 INFO L225 Difference]: With dead ends: 492
[2019-11-19 20:51:46,604 INFO L226 Difference]: Without dead ends: 258
[2019-11-19 20:51:46,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states.
[2019-11-19 20:51:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256.
[2019-11-19 20:51:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2019-11-19 20:51:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions.
[2019-11-19 20:51:46,621 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83
[2019-11-19 20:51:46,621 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:46,621 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions.
[2019-11-19 20:51:46,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:46,621 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions.
[2019-11-19 20:51:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2019-11-19 20:51:46,624 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:46,624 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:46,624 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:46,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times
[2019-11-19 20:51:46,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:46,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359892048]
[2019-11-19 20:51:46,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:46,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359892048]
[2019-11-19 20:51:46,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:46,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:46,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312120230]
[2019-11-19 20:51:46,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:46,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:46,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,681 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states.
[2019-11-19 20:51:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:46,884 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions.
[2019-11-19 20:51:46,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:46,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83
[2019-11-19 20:51:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:46,888 INFO L225 Difference]: With dead ends: 551
[2019-11-19 20:51:46,888 INFO L226 Difference]: Without dead ends: 302
[2019-11-19 20:51:46,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2019-11-19 20:51:46,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298.
[2019-11-19 20:51:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states.
[2019-11-19 20:51:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions.
[2019-11-19 20:51:46,904 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83
[2019-11-19 20:51:46,904 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:46,905 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions.
[2019-11-19 20:51:46,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:46,905 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions.
[2019-11-19 20:51:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2019-11-19 20:51:46,907 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:46,907 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:46,908 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times
[2019-11-19 20:51:46,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:46,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399196879]
[2019-11-19 20:51:46,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2019-11-19 20:51:46,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399196879]
[2019-11-19 20:51:46,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:46,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:46,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814026937]
[2019-11-19 20:51:46,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:46,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:46,980 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states.
[2019-11-19 20:51:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:47,134 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions.
[2019-11-19 20:51:47,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:47,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84
[2019-11-19 20:51:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:47,137 INFO L225 Difference]: With dead ends: 591
[2019-11-19 20:51:47,137 INFO L226 Difference]: Without dead ends: 300
[2019-11-19 20:51:47,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states.
[2019-11-19 20:51:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298.
[2019-11-19 20:51:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states.
[2019-11-19 20:51:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions.
[2019-11-19 20:51:47,149 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84
[2019-11-19 20:51:47,149 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:47,150 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions.
[2019-11-19 20:51:47,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions.
[2019-11-19 20:51:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2019-11-19 20:51:47,151 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:47,151 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:47,152 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times
[2019-11-19 20:51:47,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:47,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819237701]
[2019-11-19 20:51:47,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-19 20:51:47,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819237701]
[2019-11-19 20:51:47,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:47,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:47,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509385914]
[2019-11-19 20:51:47,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,199 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states.
[2019-11-19 20:51:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:47,393 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions.
[2019-11-19 20:51:47,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:47,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84
[2019-11-19 20:51:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:47,395 INFO L225 Difference]: With dead ends: 593
[2019-11-19 20:51:47,395 INFO L226 Difference]: Without dead ends: 300
[2019-11-19 20:51:47,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states.
[2019-11-19 20:51:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296.
[2019-11-19 20:51:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states.
[2019-11-19 20:51:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions.
[2019-11-19 20:51:47,407 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84
[2019-11-19 20:51:47,407 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:47,408 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions.
[2019-11-19 20:51:47,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions.
[2019-11-19 20:51:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2019-11-19 20:51:47,409 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:47,409 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:47,410 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times
[2019-11-19 20:51:47,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:47,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736088923]
[2019-11-19 20:51:47,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2019-11-19 20:51:47,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736088923]
[2019-11-19 20:51:47,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:47,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:47,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168711158]
[2019-11-19 20:51:47,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,467 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states.
[2019-11-19 20:51:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:47,586 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions.
[2019-11-19 20:51:47,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:47,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96
[2019-11-19 20:51:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:47,589 INFO L225 Difference]: With dead ends: 594
[2019-11-19 20:51:47,589 INFO L226 Difference]: Without dead ends: 305
[2019-11-19 20:51:47,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2019-11-19 20:51:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305.
[2019-11-19 20:51:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states.
[2019-11-19 20:51:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions.
[2019-11-19 20:51:47,602 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96
[2019-11-19 20:51:47,602 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:47,602 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions.
[2019-11-19 20:51:47,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions.
[2019-11-19 20:51:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2019-11-19 20:51:47,603 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:47,604 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:47,604 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times
[2019-11-19 20:51:47,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:47,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899568974]
[2019-11-19 20:51:47,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2019-11-19 20:51:47,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899568974]
[2019-11-19 20:51:47,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:47,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:47,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297769374]
[2019-11-19 20:51:47,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,652 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states.
[2019-11-19 20:51:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:47,786 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions.
[2019-11-19 20:51:47,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:47,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97
[2019-11-19 20:51:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:47,790 INFO L225 Difference]: With dead ends: 634
[2019-11-19 20:51:47,790 INFO L226 Difference]: Without dead ends: 336
[2019-11-19 20:51:47,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states.
[2019-11-19 20:51:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334.
[2019-11-19 20:51:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states.
[2019-11-19 20:51:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions.
[2019-11-19 20:51:47,803 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97
[2019-11-19 20:51:47,804 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:47,804 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions.
[2019-11-19 20:51:47,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions.
[2019-11-19 20:51:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2019-11-19 20:51:47,806 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:47,806 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:47,806 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times
[2019-11-19 20:51:47,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:47,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578890738]
[2019-11-19 20:51:47,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2019-11-19 20:51:47,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578890738]
[2019-11-19 20:51:47,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:47,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:47,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179618959]
[2019-11-19 20:51:47,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:47,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:47,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:47,860 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states.
[2019-11-19 20:51:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:47,997 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions.
[2019-11-19 20:51:47,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:47,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98
[2019-11-19 20:51:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:47,999 INFO L225 Difference]: With dead ends: 663
[2019-11-19 20:51:47,999 INFO L226 Difference]: Without dead ends: 336
[2019-11-19 20:51:48,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states.
[2019-11-19 20:51:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334.
[2019-11-19 20:51:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states.
[2019-11-19 20:51:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions.
[2019-11-19 20:51:48,012 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98
[2019-11-19 20:51:48,013 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,013 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions.
[2019-11-19 20:51:48,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions.
[2019-11-19 20:51:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2019-11-19 20:51:48,015 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,015 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,016 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times
[2019-11-19 20:51:48,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291252763]
[2019-11-19 20:51:48,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2019-11-19 20:51:48,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291252763]
[2019-11-19 20:51:48,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:48,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:48,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281985744]
[2019-11-19 20:51:48,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:48,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:48,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:48,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,053 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states.
[2019-11-19 20:51:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:48,190 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions.
[2019-11-19 20:51:48,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:48,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99
[2019-11-19 20:51:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:48,193 INFO L225 Difference]: With dead ends: 696
[2019-11-19 20:51:48,193 INFO L226 Difference]: Without dead ends: 369
[2019-11-19 20:51:48,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states.
[2019-11-19 20:51:48,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361.
[2019-11-19 20:51:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states.
[2019-11-19 20:51:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions.
[2019-11-19 20:51:48,208 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99
[2019-11-19 20:51:48,208 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,209 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions.
[2019-11-19 20:51:48,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions.
[2019-11-19 20:51:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2019-11-19 20:51:48,211 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,211 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,211 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,212 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times
[2019-11-19 20:51:48,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039296094]
[2019-11-19 20:51:48,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2019-11-19 20:51:48,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039296094]
[2019-11-19 20:51:48,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:48,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:48,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441867491]
[2019-11-19 20:51:48,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:48,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:48,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:48,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,251 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states.
[2019-11-19 20:51:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:48,431 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions.
[2019-11-19 20:51:48,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:48,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100
[2019-11-19 20:51:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:48,433 INFO L225 Difference]: With dead ends: 723
[2019-11-19 20:51:48,434 INFO L226 Difference]: Without dead ends: 369
[2019-11-19 20:51:48,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states.
[2019-11-19 20:51:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361.
[2019-11-19 20:51:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states.
[2019-11-19 20:51:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions.
[2019-11-19 20:51:48,455 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100
[2019-11-19 20:51:48,455 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,455 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions.
[2019-11-19 20:51:48,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions.
[2019-11-19 20:51:48,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2019-11-19 20:51:48,458 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,458 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,458 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times
[2019-11-19 20:51:48,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944764373]
[2019-11-19 20:51:48,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2019-11-19 20:51:48,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944764373]
[2019-11-19 20:51:48,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:48,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:48,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682065354]
[2019-11-19 20:51:48,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:48,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:48,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,518 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states.
[2019-11-19 20:51:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:48,675 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions.
[2019-11-19 20:51:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:48,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104
[2019-11-19 20:51:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:48,678 INFO L225 Difference]: With dead ends: 741
[2019-11-19 20:51:48,678 INFO L226 Difference]: Without dead ends: 387
[2019-11-19 20:51:48,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states.
[2019-11-19 20:51:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382.
[2019-11-19 20:51:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states.
[2019-11-19 20:51:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions.
[2019-11-19 20:51:48,698 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104
[2019-11-19 20:51:48,698 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,698 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions.
[2019-11-19 20:51:48,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions.
[2019-11-19 20:51:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2019-11-19 20:51:48,700 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,701 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,701 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times
[2019-11-19 20:51:48,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220227016]
[2019-11-19 20:51:48,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-19 20:51:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2019-11-19 20:51:48,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220227016]
[2019-11-19 20:51:48,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-19 20:51:48,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-19 20:51:48,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003495061]
[2019-11-19 20:51:48,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-19 20:51:48,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-19 20:51:48,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-19 20:51:48,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,764 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states.
[2019-11-19 20:51:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-19 20:51:48,922 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions.
[2019-11-19 20:51:48,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-11-19 20:51:48,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105
[2019-11-19 20:51:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-19 20:51:48,926 INFO L225 Difference]: With dead ends: 762
[2019-11-19 20:51:48,927 INFO L226 Difference]: Without dead ends: 387
[2019-11-19 20:51:48,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-19 20:51:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states.
[2019-11-19 20:51:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382.
[2019-11-19 20:51:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states.
[2019-11-19 20:51:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions.
[2019-11-19 20:51:48,945 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105
[2019-11-19 20:51:48,945 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-11-19 20:51:48,945 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions.
[2019-11-19 20:51:48,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-19 20:51:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions.
[2019-11-19 20:51:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2019-11-19 20:51:48,947 INFO L402 BasicCegarLoop]: Found error trace
[2019-11-19 20:51:48,947 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-19 20:51:48,948 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-19 20:51:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-11-19 20:51:48,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times
[2019-11-19 20:51:48,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-19 20:51:48,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666761412]
[2019-11-19 20:51:48,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-19 20:51:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 20:51:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-19 20:51:49,097 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-11-19 20:51:49,097 INFO L475 BasicCegarLoop]: Counterexample might be feasible
[2019-11-19 20:51:49,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:51:49 BoogieIcfgContainer
[2019-11-19 20:51:49,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-11-19 20:51:49,206 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2019-11-19 20:51:49,206 INFO L271 PluginConnector]: Initializing Witness Printer...
[2019-11-19 20:51:49,206 INFO L275 PluginConnector]: Witness Printer initialized
[2019-11-19 20:51:49,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:51:44" (3/4) ...
[2019-11-19 20:51:49,209 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2019-11-19 20:51:49,353 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2019-11-19 20:51:49,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2019-11-19 20:51:49,356 INFO L168 Benchmark]: Toolchain (without parser) took 6325.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -282.8 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:49,356 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 20:51:49,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:49,357 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:49,357 INFO L168 Benchmark]: Boogie Preprocessor took 56.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 20:51:49,358 INFO L168 Benchmark]: RCFGBuilder took 930.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:49,358 INFO L168 Benchmark]: TraceAbstraction took 4567.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -188.0 MB). There was no memory consumed. Max. memory is 11.5 GB.
[2019-11-19 20:51:49,359 INFO L168 Benchmark]: Witness Printer took 147.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB.
[2019-11-19 20:51:49,361 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB.
* CACSL2BoogieTranslator took 545.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB.
* Boogie Procedure Inliner took 73.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB.
* Boogie Preprocessor took 56.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB.
* RCFGBuilder took 930.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB.
* TraceAbstraction took 4567.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -188.0 MB). There was no memory consumed. Max. memory is 11.5 GB.
* Witness Printer took 147.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 607]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L612] int s ;
[L613] int tmp ;
[L617] s = 8464
[L11] int s__info_callback = __VERIFIER_nondet_int() ;
[L12] int s__in_handshake = __VERIFIER_nondet_int() ;
[L13] int s__state ;
[L14] int s__new_session ;
[L15] int s__server ;
[L16] int s__version = __VERIFIER_nondet_int() ;
[L17] int s__type ;
[L18] int s__init_num ;
[L19] int s__hit = __VERIFIER_nondet_int() ;
[L20] int s__rwstate ;
[L21] int s__init_buf___0 = 1;
[L22] int s__debug = __VERIFIER_nondet_int() ;
[L23] int s__shutdown ;
[L24] int s__cert = __VERIFIER_nondet_int() ;
[L25] int s__options = __VERIFIER_nondet_int() ;
[L26] int s__verify_mode = __VERIFIER_nondet_int() ;
[L27] int s__session__peer = __VERIFIER_nondet_int() ;
[L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ;
[L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ;
[L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ;
[L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ;
[L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ;
[L33] int s__s3__tmp__cert_request ;
[L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ;
[L35] int s__s3__tmp__use_rsa_tmp ;
[L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ;
[L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ;
[L38] int s__s3__tmp__next_state___0 ;
[L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ;
[L40] int s__session__cipher ;
[L41] int buf ;
[L42] unsigned long l ;
[L43] unsigned long Time ;
[L44] unsigned long tmp ;
[L45] int cb ;
[L46] long num1 = __VERIFIER_nondet_long() ;
[L47] int ret ;
[L48] int new_state ;
[L49] int state ;
[L50] int skip ;
[L51] int got_new_session ;
[L52] int tmp___1 = __VERIFIER_nondet_int() ;
[L53] int tmp___2 = __VERIFIER_nondet_int() ;
[L54] int tmp___3 = __VERIFIER_nondet_int() ;
[L55] int tmp___4 = __VERIFIER_nondet_int() ;
[L56] int tmp___5 = __VERIFIER_nondet_int() ;
[L57] int tmp___6 = __VERIFIER_nondet_int() ;
[L58] int tmp___7 ;
[L59] long tmp___8 = __VERIFIER_nondet_long() ;
[L60] int tmp___9 = __VERIFIER_nondet_int() ;
[L61] int tmp___10 = __VERIFIER_nondet_int() ;
[L62] int blastFlag ;
[L63] int __cil_tmp55 ;
[L64] unsigned long __cil_tmp56 ;
[L65] unsigned long __cil_tmp57 ;
[L66] unsigned long __cil_tmp58 ;
[L67] unsigned long __cil_tmp59 ;
[L68] int __cil_tmp60 ;
[L69] unsigned long __cil_tmp61 ;
[L73] s__state = initial_state
[L74] blastFlag = 0
[L75] tmp = __VERIFIER_nondet_int()
[L76] Time = tmp
[L77] cb = 0
[L78] ret = -1
[L79] skip = 0
[L80] got_new_session = 0
[L81] COND TRUE s__info_callback != 0
[L82] cb = s__info_callback
[L88] s__in_handshake ++
[L89] COND FALSE !(tmp___1 + 12288)
[L94] COND FALSE !(s__cert == 0)
[L98] COND TRUE 1
[L100] state = s__state
[L101] COND FALSE !(s__state == 12292)
[L104] COND FALSE !(s__state == 16384)
[L107] COND FALSE !(s__state == 8192)
[L110] COND FALSE !(s__state == 24576)
[L113] COND FALSE !(s__state == 8195)
[L116] COND FALSE !(s__state == 8480)
[L119] COND FALSE !(s__state == 8481)
[L122] COND FALSE !(s__state == 8482)
[L125] COND TRUE s__state == 8464
[L271] s__shutdown = 0
[L272] ret = __VERIFIER_nondet_int()
[L273] COND TRUE blastFlag == 0
[L274] blastFlag = 1
[L276] COND FALSE !(ret <= 0)
[L279] got_new_session = 1
[L280] s__state = 8496
[L281] s__init_num = 0
[L579] COND FALSE !(! s__s3__tmp__reuse_message)
[L596] skip = 0
[L98] COND TRUE 1
[L100] state = s__state
[L101] COND FALSE !(s__state == 12292)
[L104] COND FALSE !(s__state == 16384)
[L107] COND FALSE !(s__state == 8192)
[L110] COND FALSE !(s__state == 24576)
[L113] COND FALSE !(s__state == 8195)
[L116] COND FALSE !(s__state == 8480)
[L119] COND FALSE !(s__state == 8481)
[L122] COND FALSE !(s__state == 8482)
[L125] COND FALSE !(s__state == 8464)
[L128] COND FALSE !(s__state == 8465)
[L131] COND FALSE !(s__state == 8466)
[L134] COND TRUE s__state == 8496
[L285] ret = __VERIFIER_nondet_int()
[L286] COND TRUE blastFlag == 1
[L287] blastFlag = 2
[L293] COND FALSE !(ret <= 0)
[L296] COND TRUE \read(s__hit)
[L297] s__state = 8656
[L301] s__init_num = 0
[L579] COND FALSE !(! s__s3__tmp__reuse_message)
[L596] skip = 0
[L98] COND TRUE 1
[L100] state = s__state
[L101] COND FALSE !(s__state == 12292)
[L104] COND FALSE !(s__state == 16384)
[L107] COND FALSE !(s__state == 8192)
[L110] COND FALSE !(s__state == 24576)
[L113] COND FALSE !(s__state == 8195)
[L116] COND FALSE !(s__state == 8480)
[L119] COND FALSE !(s__state == 8481)
[L122] COND FALSE !(s__state == 8482)
[L125] COND FALSE !(s__state == 8464)
[L128] COND FALSE !(s__state == 8465)
[L131] COND FALSE !(s__state == 8466)
[L134] COND FALSE !(s__state == 8496)
[L137] COND FALSE !(s__state == 8497)
[L140] COND FALSE !(s__state == 8512)
[L143] COND FALSE !(s__state == 8513)
[L146] COND FALSE !(s__state == 8528)
[L149] COND FALSE !(s__state == 8529)
[L152] COND FALSE !(s__state == 8544)
[L155] COND FALSE !(s__state == 8545)
[L158] COND FALSE !(s__state == 8560)
[L161] COND FALSE !(s__state == 8561)
[L164] COND FALSE !(s__state == 8448)
[L167] COND FALSE !(s__state == 8576)
[L170] COND FALSE !(s__state == 8577)
[L173] COND FALSE !(s__state == 8592)
[L176] COND FALSE !(s__state == 8593)
[L179] COND FALSE !(s__state == 8608)
[L182] COND FALSE !(s__state == 8609)
[L185] COND FALSE !(s__state == 8640)
[L188] COND FALSE !(s__state == 8641)
[L191] COND TRUE s__state == 8656
[L490] s__session__cipher = s__s3__tmp__new_cipher
[L491] COND FALSE !(! tmp___9)
[L495] ret = __VERIFIER_nondet_int()
[L496] COND TRUE blastFlag == 2
[L497] blastFlag = 3
[L499] COND FALSE !(ret <= 0)
[L502] s__state = 8672
[L503] s__init_num = 0
[L504] COND FALSE !(! tmp___10)
[L579] COND FALSE !(! s__s3__tmp__reuse_message)
[L596] skip = 0
[L98] COND TRUE 1
[L100] state = s__state
[L101] COND FALSE !(s__state == 12292)
[L104] COND FALSE !(s__state == 16384)
[L107] COND FALSE !(s__state == 8192)
[L110] COND FALSE !(s__state == 24576)
[L113] COND FALSE !(s__state == 8195)
[L116] COND FALSE !(s__state == 8480)
[L119] COND FALSE !(s__state == 8481)
[L122] COND FALSE !(s__state == 8482)
[L125] COND FALSE !(s__state == 8464)
[L128] COND FALSE !(s__state == 8465)
[L131] COND FALSE !(s__state == 8466)
[L134] COND FALSE !(s__state == 8496)
[L137] COND FALSE !(s__state == 8497)
[L140] COND FALSE !(s__state == 8512)
[L143] COND FALSE !(s__state == 8513)
[L146] COND FALSE !(s__state == 8528)
[L149] COND FALSE !(s__state == 8529)
[L152] COND FALSE !(s__state == 8544)
[L155] COND FALSE !(s__state == 8545)
[L158] COND FALSE !(s__state == 8560)
[L161] COND FALSE !(s__state == 8561)
[L164] COND FALSE !(s__state == 8448)
[L167] COND FALSE !(s__state == 8576)
[L170] COND FALSE !(s__state == 8577)
[L173] COND FALSE !(s__state == 8592)
[L176] COND FALSE !(s__state == 8593)
[L179] COND FALSE !(s__state == 8608)
[L182] COND FALSE !(s__state == 8609)
[L185] COND FALSE !(s__state == 8640)
[L188] COND FALSE !(s__state == 8641)
[L191] COND FALSE !(s__state == 8656)
[L194] COND FALSE !(s__state == 8657)
[L197] COND TRUE s__state == 8672
[L511] ret = __VERIFIER_nondet_int()
[L512] COND TRUE blastFlag == 3
[L607] __VERIFIER_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 140 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.4s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1821 SDtfs, 2038 SDslu, 234 SDs, 0 SdLazy, 1321 SolverSat, 599 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 188237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 636/636 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...