./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_10_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_10_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea7c89af045fb1f9193ce0ab1c73013493909790 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-11 21:22:15,418 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:22:15,420 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:22:15,436 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:22:15,436 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:22:15,437 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:22:15,438 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:22:15,440 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:22:15,442 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:22:15,443 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:22:15,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:22:15,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:22:15,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:22:15,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:22:15,447 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:22:15,447 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:22:15,448 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:22:15,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:22:15,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:22:15,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:22:15,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:22:15,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:22:15,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:22:15,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:22:15,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:22:15,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:22:15,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:22:15,475 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:22:15,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:22:15,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:22:15,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:22:15,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:22:15,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:22:15,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:22:15,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:22:15,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:22:15,488 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:22:15,516 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:22:15,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:22:15,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:22:15,520 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:22:15,520 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:22:15,521 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:22:15,521 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:22:15,522 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:22:15,522 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:22:15,522 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:22:15,522 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:22:15,523 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:22:15,523 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:22:15,523 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:22:15,523 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:22:15,524 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:22:15,524 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:22:15,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:22:15,525 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:22:15,525 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:22:15,525 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:22:15,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:22:15,525 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:22:15,526 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:22:15,528 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:22:15,528 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:22:15,528 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:22:15,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:22:15,529 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea7c89af045fb1f9193ce0ab1c73013493909790 [2019-01-11 21:22:15,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:22:15,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:22:15,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:22:15,609 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:22:15,609 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:22:15,610 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_10_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:15,676 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e785af038/df1e329063a749298a305b529871ea78/FLAG170cf978c [2019-01-11 21:22:16,189 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:22:16,195 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_10_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:16,211 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e785af038/df1e329063a749298a305b529871ea78/FLAG170cf978c [2019-01-11 21:22:16,459 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e785af038/df1e329063a749298a305b529871ea78 [2019-01-11 21:22:16,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:22:16,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:22:16,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:22:16,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:22:16,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:22:16,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:22:16" (1/1) ... [2019-01-11 21:22:16,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341a16df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:16, skipping insertion in model container [2019-01-11 21:22:16,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:22:16" (1/1) ... [2019-01-11 21:22:16,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:22:16,534 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:22:16,933 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:22:16,940 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:22:17,052 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:22:17,076 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:22:17,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17 WrapperNode [2019-01-11 21:22:17,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:22:17,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:22:17,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:22:17,078 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:22:17,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... [2019-01-11 21:22:17,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... [2019-01-11 21:22:17,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:22:17,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:22:17,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:22:17,205 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:22:17,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... [2019-01-11 21:22:17,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... [2019-01-11 21:22:17,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... [2019-01-11 21:22:17,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... [2019-01-11 21:22:17,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... [2019-01-11 21:22:17,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... [2019-01-11 21:22:17,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... [2019-01-11 21:22:17,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:22:17,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:22:17,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:22:17,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:22:17,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:22:17,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:22:17,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:22:17,527 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:22:18,592 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:22:18,593 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:22:18,594 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:22:18,595 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:22:18,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:18 BoogieIcfgContainer [2019-01-11 21:22:18,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:22:18,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:22:18,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:22:18,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:22:18,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:22:16" (1/3) ... [2019-01-11 21:22:18,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bdbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:22:18, skipping insertion in model container [2019-01-11 21:22:18,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:17" (2/3) ... [2019-01-11 21:22:18,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421bdbde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:22:18, skipping insertion in model container [2019-01-11 21:22:18,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:18" (3/3) ... [2019-01-11 21:22:18,608 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_10_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:18,619 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:22:18,628 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:22:18,646 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:22:18,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:22:18,685 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:22:18,686 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:22:18,686 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:22:18,686 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:22:18,686 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:22:18,687 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:22:18,687 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:22:18,687 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:22:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-01-11 21:22:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 21:22:18,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:18,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:18,715 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:18,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2084821380, now seen corresponding path program 1 times [2019-01-11 21:22:18,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:18,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:18,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:18,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:18,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:18,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:18,971 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-01-11 21:22:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:19,697 INFO L93 Difference]: Finished difference Result 311 states and 529 transitions. [2019-01-11 21:22:19,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:19,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-11 21:22:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:19,717 INFO L225 Difference]: With dead ends: 311 [2019-01-11 21:22:19,718 INFO L226 Difference]: Without dead ends: 152 [2019-01-11 21:22:19,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-11 21:22:19,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-11 21:22:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-11 21:22:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 235 transitions. [2019-01-11 21:22:19,783 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 235 transitions. Word has length 22 [2019-01-11 21:22:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:19,784 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 235 transitions. [2019-01-11 21:22:19,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 235 transitions. [2019-01-11 21:22:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:22:19,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:19,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:19,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:19,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:19,788 INFO L82 PathProgramCache]: Analyzing trace with hash -586952456, now seen corresponding path program 1 times [2019-01-11 21:22:19,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:19,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:19,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:19,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:19,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:19,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:19,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:19,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:19,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:19,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:19,873 INFO L87 Difference]: Start difference. First operand 150 states and 235 transitions. Second operand 3 states. [2019-01-11 21:22:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:20,226 INFO L93 Difference]: Finished difference Result 313 states and 493 transitions. [2019-01-11 21:22:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:20,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:22:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:20,229 INFO L225 Difference]: With dead ends: 313 [2019-01-11 21:22:20,230 INFO L226 Difference]: Without dead ends: 170 [2019-01-11 21:22:20,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-11 21:22:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-01-11 21:22:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-11 21:22:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 266 transitions. [2019-01-11 21:22:20,250 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 266 transitions. Word has length 23 [2019-01-11 21:22:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:20,250 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 266 transitions. [2019-01-11 21:22:20,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 266 transitions. [2019-01-11 21:22:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:22:20,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:20,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:20,252 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash 69813308, now seen corresponding path program 1 times [2019-01-11 21:22:20,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:20,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:20,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:20,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:20,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:20,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:20,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:20,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:20,331 INFO L87 Difference]: Start difference. First operand 168 states and 266 transitions. Second operand 3 states. [2019-01-11 21:22:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:20,651 INFO L93 Difference]: Finished difference Result 330 states and 523 transitions. [2019-01-11 21:22:20,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:20,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:22:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:20,656 INFO L225 Difference]: With dead ends: 330 [2019-01-11 21:22:20,656 INFO L226 Difference]: Without dead ends: 169 [2019-01-11 21:22:20,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:20,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-11 21:22:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-11 21:22:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-11 21:22:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 267 transitions. [2019-01-11 21:22:20,685 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 267 transitions. Word has length 23 [2019-01-11 21:22:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:20,686 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 267 transitions. [2019-01-11 21:22:20,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 267 transitions. [2019-01-11 21:22:20,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 21:22:20,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:20,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:20,689 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:20,689 INFO L82 PathProgramCache]: Analyzing trace with hash 173828051, now seen corresponding path program 1 times [2019-01-11 21:22:20,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:20,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:20,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:20,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:20,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:20,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:20,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:20,765 INFO L87 Difference]: Start difference. First operand 169 states and 267 transitions. Second operand 3 states. [2019-01-11 21:22:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:21,061 INFO L93 Difference]: Finished difference Result 340 states and 535 transitions. [2019-01-11 21:22:21,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:21,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-11 21:22:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:21,064 INFO L225 Difference]: With dead ends: 340 [2019-01-11 21:22:21,065 INFO L226 Difference]: Without dead ends: 178 [2019-01-11 21:22:21,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-11 21:22:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-01-11 21:22:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-11 21:22:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 276 transitions. [2019-01-11 21:22:21,078 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 276 transitions. Word has length 24 [2019-01-11 21:22:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:21,078 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 276 transitions. [2019-01-11 21:22:21,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 276 transitions. [2019-01-11 21:22:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 21:22:21,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:21,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:21,080 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:21,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash 57533382, now seen corresponding path program 1 times [2019-01-11 21:22:21,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:21,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:21,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:21,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:21,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:21,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:21,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:21,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:21,167 INFO L87 Difference]: Start difference. First operand 178 states and 276 transitions. Second operand 3 states. [2019-01-11 21:22:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:21,412 INFO L93 Difference]: Finished difference Result 359 states and 553 transitions. [2019-01-11 21:22:21,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:21,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-11 21:22:21,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:21,414 INFO L225 Difference]: With dead ends: 359 [2019-01-11 21:22:21,414 INFO L226 Difference]: Without dead ends: 188 [2019-01-11 21:22:21,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-11 21:22:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 178. [2019-01-11 21:22:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-11 21:22:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 274 transitions. [2019-01-11 21:22:21,435 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 274 transitions. Word has length 25 [2019-01-11 21:22:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:21,436 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 274 transitions. [2019-01-11 21:22:21,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 274 transitions. [2019-01-11 21:22:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:22:21,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:21,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:21,442 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1413165422, now seen corresponding path program 1 times [2019-01-11 21:22:21,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:21,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:21,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:21,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:21,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:21,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:21,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:21,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:21,566 INFO L87 Difference]: Start difference. First operand 178 states and 274 transitions. Second operand 3 states. [2019-01-11 21:22:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:22,192 INFO L93 Difference]: Finished difference Result 359 states and 549 transitions. [2019-01-11 21:22:22,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:22,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-11 21:22:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:22,195 INFO L225 Difference]: With dead ends: 359 [2019-01-11 21:22:22,195 INFO L226 Difference]: Without dead ends: 188 [2019-01-11 21:22:22,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-11 21:22:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 178. [2019-01-11 21:22:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-11 21:22:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 272 transitions. [2019-01-11 21:22:22,205 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 272 transitions. Word has length 26 [2019-01-11 21:22:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:22,205 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 272 transitions. [2019-01-11 21:22:22,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 272 transitions. [2019-01-11 21:22:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:22:22,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:22,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:22,206 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:22,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:22,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1880242814, now seen corresponding path program 1 times [2019-01-11 21:22:22,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:22,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:22,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:22:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:22:22,264 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:22:22,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:22:22 BoogieIcfgContainer [2019-01-11 21:22:22,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:22:22,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:22:22,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:22:22,311 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:22:22,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:18" (3/4) ... [2019-01-11 21:22:22,315 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 21:22:22,408 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:22:22,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:22:22,410 INFO L168 Benchmark]: Toolchain (without parser) took 5947.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 943.3 MB in the beginning and 853.0 MB in the end (delta: 90.3 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:22,412 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:22:22,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.09 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 927.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:22,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:22,414 INFO L168 Benchmark]: Boogie Preprocessor took 72.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:22:22,414 INFO L168 Benchmark]: RCFGBuilder took 1320.38 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.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:22,415 INFO L168 Benchmark]: TraceAbstraction took 3710.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 859.7 MB in the end (delta: 208.4 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:22,417 INFO L168 Benchmark]: Witness Printer took 98.38 ms. Allocated memory is still 1.2 GB. Free memory was 859.7 MB in the beginning and 853.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:22:22,421 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 613.09 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 927.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.66 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 1320.38 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.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3710.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 859.7 MB in the end (delta: 208.4 MB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. * Witness Printer took 98.38 ms. Allocated memory is still 1.2 GB. Free memory was 859.7 MB in the beginning and 853.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 629]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L635] int s ; [L636] int tmp ; [L640] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 ; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L41] int s__session__cipher ; [L42] int buf = __VERIFIER_nondet_int() ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp = __VERIFIER_nondet_long() ; [L46] int cb ; [L47] long num1 ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 ; [L56] int tmp___4 ; [L57] int tmp___5 ; [L58] int tmp___6 ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 ; [L62] int tmp___10 ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__s3__tmp__new_cipher__algorithms = 0 [L74] __cil_tmp56 = 0 [L75] __cil_tmp57 = 0 [L76] __cil_tmp58 = 0 [L77] __cil_tmp59 = 0 [L78] __cil_tmp60 = 0 [L79] __cil_tmp61 = 0 [L80] s__s3__tmp__reuse_message = 0 [L81] s__state = initial_state [L82] blastFlag = 0 [L83] Time = tmp [L84] cb = 0 [L85] ret = -1 [L86] skip = 0 [L87] got_new_session = 0 [L88] COND TRUE s__info_callback != 0 [L89] cb = s__info_callback [L95] s__in_handshake ++ [L96] COND FALSE !(tmp___1 + 12288) [L101] COND FALSE !(s__cert == 0) [L105] COND TRUE 1 [L107] state = s__state [L108] COND FALSE !(s__state == 12292) [L111] COND FALSE !(s__state == 16384) [L114] COND FALSE !(s__state == 8192) [L117] COND FALSE !(s__state == 24576) [L120] COND FALSE !(s__state == 8195) [L123] COND FALSE !(s__state == 8480) [L126] COND FALSE !(s__state == 8481) [L129] COND FALSE !(s__state == 8482) [L132] COND TRUE s__state == 8464 [L276] s__shutdown = 0 [L277] ret = __VERIFIER_nondet_int() [L278] COND TRUE blastFlag == 0 [L279] blastFlag = 1 [L281] COND FALSE !(ret <= 0) [L284] got_new_session = 1 [L285] s__state = 8496 [L286] s__init_num = 0 [L592] COND TRUE ! s__s3__tmp__reuse_message [L593] COND TRUE ! skip [L594] COND TRUE state == 8464 [L595] COND TRUE s__state == 8496 [L596] COND TRUE cb != 0 [L597] COND TRUE s__info_callback != 0 [L629] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 146 locations, 1 error locations. UNSAFE Result, 3.6s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 840 SDtfs, 1058 SDslu, 120 SDs, 0 SdLazy, 496 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 7411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...