./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_2_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_2_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 9cdb9234b6e26ed0c6ca912816731ef8108c5ccf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:53,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:22:53,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:22:53,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:22:53,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:22:53,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:22:53,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:22:53,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:22:53,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:22:53,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:22:53,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:22:53,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:22:53,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:22:53,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:22:53,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:22:53,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:22:53,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:22:53,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:22:53,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:22:53,450 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:22:53,451 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:22:53,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:22:53,455 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:22:53,455 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:22:53,455 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:22:53,456 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:22:53,457 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:22:53,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:22:53,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:22:53,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:22:53,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:22:53,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:22:53,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:22:53,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:22:53,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:22:53,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:22:53,464 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:53,483 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:22:53,484 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:22:53,485 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:22:53,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:22:53,486 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:22:53,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:22:53,486 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:22:53,487 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:22:53,487 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:22:53,488 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:22:53,488 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:22:53,488 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:22:53,488 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:22:53,488 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:22:53,488 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:22:53,489 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:22:53,489 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:22:53,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:22:53,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:22:53,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:22:53,490 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:22:53,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:22:53,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:22:53,491 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:22:53,491 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:22:53,491 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:22:53,491 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:22:53,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:22:53,491 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 -> 9cdb9234b6e26ed0c6ca912816731ef8108c5ccf [2019-01-11 21:22:53,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:22:53,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:22:53,567 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:22:53,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:22:53,568 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:22:53,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_2_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:53,630 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427597184/be7abdf192014abeba074285ab05b8cd/FLAG44e147461 [2019-01-11 21:22:54,055 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:22:54,058 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_2_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:54,073 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427597184/be7abdf192014abeba074285ab05b8cd/FLAG44e147461 [2019-01-11 21:22:54,411 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/427597184/be7abdf192014abeba074285ab05b8cd [2019-01-11 21:22:54,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:22:54,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:22:54,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:22:54,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:22:54,422 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:22:54,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e21fa69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54, skipping insertion in model container [2019-01-11 21:22:54,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:22:54" (1/1) ... [2019-01-11 21:22:54,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:22:54,476 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:22:54,757 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:22:54,767 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:22:54,860 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:22:54,884 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:22:54,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54 WrapperNode [2019-01-11 21:22:54,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:22:54,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:22:54,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:22:54,887 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:22:54,894 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:54" (1/1) ... [2019-01-11 21:22:54,904 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:54" (1/1) ... [2019-01-11 21:22:55,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:22:55,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:22:55,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:22:55,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:22:55,035 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:54" (1/1) ... [2019-01-11 21:22:55,035 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:54" (1/1) ... [2019-01-11 21:22:55,040 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:54" (1/1) ... [2019-01-11 21:22:55,040 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:54" (1/1) ... [2019-01-11 21:22:55,048 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:54" (1/1) ... [2019-01-11 21:22:55,060 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:54" (1/1) ... [2019-01-11 21:22:55,063 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:54" (1/1) ... [2019-01-11 21:22:55,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:22:55,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:22:55,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:22:55,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:22:55,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (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:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:22:55,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:22:55,256 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:22:56,272 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:22:56,272 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:22:56,273 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:22:56,273 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:22:56,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:56 BoogieIcfgContainer [2019-01-11 21:22:56,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:22:56,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:22:56,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:22:56,279 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:22:56,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:22:54" (1/3) ... [2019-01-11 21:22:56,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6c80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:22:56, skipping insertion in model container [2019-01-11 21:22:56,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:22:54" (2/3) ... [2019-01-11 21:22:56,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6c80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:22:56, skipping insertion in model container [2019-01-11 21:22:56,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:22:56" (3/3) ... [2019-01-11 21:22:56,282 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2_false-unreach-call_false-termination.cil.c [2019-01-11 21:22:56,292 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:22:56,299 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:22:56,314 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:22:56,345 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:22:56,346 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:22:56,346 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:22:56,346 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:22:56,346 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:22:56,346 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:22:56,347 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:22:56,347 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:22:56,347 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:22:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-01-11 21:22:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:22:56,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:56,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:56,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:56,385 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-01-11 21:22:56,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:56,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:56,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:56,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:56,658 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:56,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:56,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:56,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:56,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:56,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:56,686 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-01-11 21:22:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:57,426 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-01-11 21:22:57,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:57,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-11 21:22:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:57,441 INFO L225 Difference]: With dead ends: 327 [2019-01-11 21:22:57,442 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 21:22:57,446 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:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 21:22:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-01-11 21:22:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-11 21:22:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-01-11 21:22:57,500 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-01-11 21:22:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:57,501 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-01-11 21:22:57,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-01-11 21:22:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:22:57,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:57,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:22:57,505 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-01-11 21:22:57,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:57,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:57,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:57,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:57,629 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:57,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:57,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:57,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:57,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:57,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:57,633 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-01-11 21:22:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:58,059 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-01-11 21:22:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:58,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:22:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:58,066 INFO L225 Difference]: With dead ends: 379 [2019-01-11 21:22:58,066 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 21:22:58,068 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:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 21:22:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-01-11 21:22:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-11 21:22:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-01-11 21:22:58,088 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-01-11 21:22:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:58,088 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-01-11 21:22:58,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-01-11 21:22:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 21:22:58,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:58,093 INFO L402 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-01-11 21:22:58,093 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:58,094 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-01-11 21:22:58,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:58,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:58,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:58,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:58,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:58,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:58,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:58,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:58,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:58,180 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-01-11 21:22:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:58,558 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-01-11 21:22:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:58,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-11 21:22:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:58,561 INFO L225 Difference]: With dead ends: 444 [2019-01-11 21:22:58,561 INFO L226 Difference]: Without dead ends: 241 [2019-01-11 21:22:58,563 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:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-11 21:22:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-01-11 21:22:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 21:22:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-01-11 21:22:58,580 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-01-11 21:22:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:58,581 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-01-11 21:22:58,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-01-11 21:22:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:22:58,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:58,585 INFO L402 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-01-11 21:22:58,586 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-01-11 21:22:58,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:58,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:58,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:58,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:22:58,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:58,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:58,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:58,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:58,682 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-01-11 21:22:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:58,975 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-01-11 21:22:58,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:58,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:22:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:58,978 INFO L225 Difference]: With dead ends: 492 [2019-01-11 21:22:58,978 INFO L226 Difference]: Without dead ends: 258 [2019-01-11 21:22:58,980 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:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-11 21:22:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-01-11 21:22:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-11 21:22:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-01-11 21:22:58,996 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-01-11 21:22:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:58,996 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-01-11 21:22:58,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-01-11 21:22:59,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:22:59,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:59,004 INFO L402 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-01-11 21:22:59,004 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:59,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:59,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-01-11 21:22:59,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:59,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:22:59,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:59,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:59,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:59,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:59,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:59,124 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-01-11 21:22:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:59,411 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-01-11 21:22:59,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:59,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:22:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:59,415 INFO L225 Difference]: With dead ends: 551 [2019-01-11 21:22:59,415 INFO L226 Difference]: Without dead ends: 302 [2019-01-11 21:22:59,417 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:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-11 21:22:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-01-11 21:22:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:22:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-01-11 21:22:59,433 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-01-11 21:22:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:59,434 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-01-11 21:22:59,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-01-11 21:22:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:22:59,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:59,438 INFO L402 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-01-11 21:22:59,438 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:59,439 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-01-11 21:22:59,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:59,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:59,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:59,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:22:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:22:59,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:22:59,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:22:59,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:22:59,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:22:59,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:22:59,523 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-01-11 21:22:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:22:59,956 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-01-11 21:22:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:22:59,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:22:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:22:59,959 INFO L225 Difference]: With dead ends: 591 [2019-01-11 21:22:59,959 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 21:22:59,960 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:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 21:22:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-01-11 21:22:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-11 21:22:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-01-11 21:22:59,972 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-01-11 21:22:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:22:59,973 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-01-11 21:22:59,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:22:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-01-11 21:22:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:22:59,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:22:59,975 INFO L402 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-01-11 21:22:59,976 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:22:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:22:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-01-11 21:22:59,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:22:59,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:22:59,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:22:59,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:22:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:23:00,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:00,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:00,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:00,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:00,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:00,062 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-01-11 21:23:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:00,704 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-01-11 21:23:00,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:00,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:23:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:00,708 INFO L225 Difference]: With dead ends: 593 [2019-01-11 21:23:00,708 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 21:23:00,709 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:23:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 21:23:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-01-11 21:23:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-11 21:23:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-01-11 21:23:00,727 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-01-11 21:23:00,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:00,728 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-01-11 21:23:00,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:00,728 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-01-11 21:23:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 21:23:00,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:00,731 INFO L402 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-01-11 21:23:00,731 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-01-11 21:23:00,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:00,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:00,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-11 21:23:00,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:00,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:00,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:00,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:00,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:00,799 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-01-11 21:23:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:01,085 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-01-11 21:23:01,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:01,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-11 21:23:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:01,087 INFO L225 Difference]: With dead ends: 594 [2019-01-11 21:23:01,088 INFO L226 Difference]: Without dead ends: 305 [2019-01-11 21:23:01,089 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:23:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-11 21:23:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-01-11 21:23:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-11 21:23:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-01-11 21:23:01,111 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-01-11 21:23:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:01,112 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-01-11 21:23:01,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-01-11 21:23:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 21:23:01,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:01,116 INFO L402 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-01-11 21:23:01,116 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:01,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-01-11 21:23:01,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:01,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:01,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:01,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:01,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:01,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:01,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:01,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:01,260 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-01-11 21:23:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:02,363 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-01-11 21:23:02,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:02,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-11 21:23:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:02,368 INFO L225 Difference]: With dead ends: 634 [2019-01-11 21:23:02,368 INFO L226 Difference]: Without dead ends: 336 [2019-01-11 21:23:02,370 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:23:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-11 21:23:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-11 21:23:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-11 21:23:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-01-11 21:23:02,383 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-01-11 21:23:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:02,383 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-01-11 21:23:02,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-01-11 21:23:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 21:23:02,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:02,386 INFO L402 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-01-11 21:23:02,386 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:02,387 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-01-11 21:23:02,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:02,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:02,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:02,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:02,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:02,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:02,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:02,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:02,478 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-01-11 21:23:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:03,187 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-01-11 21:23:03,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:03,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-11 21:23:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:03,191 INFO L225 Difference]: With dead ends: 663 [2019-01-11 21:23:03,191 INFO L226 Difference]: Without dead ends: 336 [2019-01-11 21:23:03,192 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:23:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-11 21:23:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-01-11 21:23:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-11 21:23:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-01-11 21:23:03,206 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-01-11 21:23:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:03,212 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-01-11 21:23:03,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-01-11 21:23:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 21:23:03,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:03,215 INFO L402 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-01-11 21:23:03,215 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:03,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-01-11 21:23:03,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:03,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:03,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:03,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:03,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:03,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:03,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:03,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:03,282 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-01-11 21:23:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:03,883 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-01-11 21:23:03,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:03,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-11 21:23:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:03,887 INFO L225 Difference]: With dead ends: 696 [2019-01-11 21:23:03,888 INFO L226 Difference]: Without dead ends: 369 [2019-01-11 21:23:03,890 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:23:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-11 21:23:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-11 21:23:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 21:23:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-01-11 21:23:03,902 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-01-11 21:23:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:03,903 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-01-11 21:23:03,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-01-11 21:23:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 21:23:03,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:03,906 INFO L402 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-01-11 21:23:03,906 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-01-11 21:23:03,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:03,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:23:03,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:03,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:03,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:03,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:03,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:03,990 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-01-11 21:23:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:04,732 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-01-11 21:23:04,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:04,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-11 21:23:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:04,736 INFO L225 Difference]: With dead ends: 723 [2019-01-11 21:23:04,736 INFO L226 Difference]: Without dead ends: 369 [2019-01-11 21:23:04,737 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:23:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-11 21:23:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-01-11 21:23:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 21:23:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-01-11 21:23:04,750 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-01-11 21:23:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:04,750 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-01-11 21:23:04,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-01-11 21:23:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 21:23:04,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:04,753 INFO L402 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-01-11 21:23:04,753 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:04,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:04,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-01-11 21:23:04,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:04,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:04,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:04,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:04,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:04,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:04,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:04,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:04,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:04,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:04,822 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-01-11 21:23:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:05,469 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-01-11 21:23:05,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:05,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-11 21:23:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:05,473 INFO L225 Difference]: With dead ends: 741 [2019-01-11 21:23:05,473 INFO L226 Difference]: Without dead ends: 387 [2019-01-11 21:23:05,474 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:23:05,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-01-11 21:23:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-01-11 21:23:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-11 21:23:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-01-11 21:23:05,489 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-01-11 21:23:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:05,489 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-01-11 21:23:05,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-01-11 21:23:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:23:05,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:05,492 INFO L402 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-01-11 21:23:05,493 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:05,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:05,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-01-11 21:23:05,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:05,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:05,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:05,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:05,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:23:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:23:05,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:23:05,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:23:05,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:23:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:23:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:23:05,570 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-01-11 21:23:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:23:05,883 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-01-11 21:23:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:23:05,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:23:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:23:05,887 INFO L225 Difference]: With dead ends: 762 [2019-01-11 21:23:05,887 INFO L226 Difference]: Without dead ends: 387 [2019-01-11 21:23:05,888 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:23:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-01-11 21:23:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-01-11 21:23:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-11 21:23:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-01-11 21:23:05,901 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-01-11 21:23:05,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:23:05,901 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-01-11 21:23:05,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:23:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-01-11 21:23:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 21:23:05,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:23:05,905 INFO L402 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-01-11 21:23:05,905 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:23:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:23:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-01-11 21:23:05,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:23:05,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:23:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:05,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:23:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:23:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:23:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-11 21:23:06,005 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-11 21:23:06,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:23:06 BoogieIcfgContainer [2019-01-11 21:23:06,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:23:06,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:23:06,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:23:06,082 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:23:06,082 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:56" (3/4) ... [2019-01-11 21:23:06,085 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-11 21:23:06,266 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:23:06,266 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:23:06,267 INFO L168 Benchmark]: Toolchain (without parser) took 11851.06 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -269.2 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,270 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:23:06,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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:23:06,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,273 INFO L168 Benchmark]: Boogie Preprocessor took 44.05 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,273 INFO L168 Benchmark]: RCFGBuilder took 1207.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,273 INFO L168 Benchmark]: TraceAbstraction took 9805.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -178.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:23:06,274 INFO L168 Benchmark]: Witness Printer took 184.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:23:06,278 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 136.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.05 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1207.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9805.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -178.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 184.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 608]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L613] int s ; [L614] int tmp ; [L618] 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 = __VERIFIER_nondet_int() ; [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 = __VERIFIER_nondet_int() ; [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 ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [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 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [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 ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L580] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L294] COND FALSE !(ret <= 0) [L297] COND TRUE \read(s__hit) [L298] s__state = 8656 [L302] s__init_num = 0 [L580] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND FALSE !(s__state == 8576) [L171] COND FALSE !(s__state == 8577) [L174] COND FALSE !(s__state == 8592) [L177] COND FALSE !(s__state == 8593) [L180] COND FALSE !(s__state == 8608) [L183] COND FALSE !(s__state == 8609) [L186] COND FALSE !(s__state == 8640) [L189] COND FALSE !(s__state == 8641) [L192] COND TRUE s__state == 8656 [L491] s__session__cipher = s__s3__tmp__new_cipher [L492] COND FALSE !(! tmp___9) [L496] ret = __VERIFIER_nondet_int() [L497] COND TRUE blastFlag == 2 [L498] blastFlag = 3 [L500] COND FALSE !(ret <= 0) [L503] s__state = 8672 [L504] s__init_num = 0 [L505] COND FALSE !(! tmp___10) [L580] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND FALSE !(s__state == 8576) [L171] COND FALSE !(s__state == 8577) [L174] COND FALSE !(s__state == 8592) [L177] COND FALSE !(s__state == 8593) [L180] COND FALSE !(s__state == 8608) [L183] COND FALSE !(s__state == 8609) [L186] COND FALSE !(s__state == 8640) [L189] COND FALSE !(s__state == 8641) [L192] COND FALSE !(s__state == 8656) [L195] COND FALSE !(s__state == 8657) [L198] COND TRUE s__state == 8672 [L512] ret = __VERIFIER_nondet_int() [L513] COND TRUE blastFlag == 3 [L608] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. UNSAFE Result, 9.7s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1821 SDtfs, 2038 SDslu, 234 SDs, 0 SdLazy, 1321 SolverSat, 599 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...