./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_13_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_13_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 da95f8ee1fdff950e8bdc600c0af9fd0f48d5b20 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-14 14:57:23,707 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:57:23,708 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:57:23,720 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:57:23,721 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:57:23,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:57:23,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:57:23,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:57:23,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:57:23,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:57:23,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:57:23,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:57:23,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:57:23,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:57:23,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:57:23,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:57:23,738 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:57:23,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:57:23,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:57:23,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:57:23,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:57:23,747 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:57:23,749 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:57:23,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:57:23,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:57:23,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:57:23,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:57:23,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:57:23,754 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:57:23,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:57:23,755 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:57:23,757 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:57:23,757 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:57:23,757 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:57:23,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:57:23,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:57:23,759 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:57:23,784 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:57:23,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:57:23,786 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:57:23,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:57:23,787 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:57:23,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:57:23,787 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:57:23,787 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:57:23,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:57:23,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:57:23,788 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:57:23,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:57:23,789 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:57:23,789 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:57:23,789 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:57:23,789 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:57:23,790 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:57:23,790 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:57:23,790 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:57:23,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:57:23,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:23,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:57:23,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:57:23,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:57:23,792 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:57:23,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:57:23,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:57:23,793 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 -> da95f8ee1fdff950e8bdc600c0af9fd0f48d5b20 [2019-01-14 14:57:23,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:57:23,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:57:23,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:57:23,888 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:57:23,888 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:57:23,889 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_13_false-unreach-call_false-termination.cil.c [2019-01-14 14:57:23,958 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230031f29/33311a7d0d834123a3160d5d8928aa86/FLAG5fc1455ec [2019-01-14 14:57:24,460 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:57:24,461 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_13_false-unreach-call_false-termination.cil.c [2019-01-14 14:57:24,485 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230031f29/33311a7d0d834123a3160d5d8928aa86/FLAG5fc1455ec [2019-01-14 14:57:24,785 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230031f29/33311a7d0d834123a3160d5d8928aa86 [2019-01-14 14:57:24,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:57:24,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:57:24,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:24,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:57:24,794 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:57:24,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:24" (1/1) ... [2019-01-14 14:57:24,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ead93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:24, skipping insertion in model container [2019-01-14 14:57:24,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:24" (1/1) ... [2019-01-14 14:57:24,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:57:24,870 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:57:25,188 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:25,194 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:57:25,270 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:25,289 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:57:25,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25 WrapperNode [2019-01-14 14:57:25,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:25,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:25,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:57:25,292 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:57:25,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... [2019-01-14 14:57:25,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... [2019-01-14 14:57:25,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:25,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:57:25,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:57:25,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:57:25,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... [2019-01-14 14:57:25,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... [2019-01-14 14:57:25,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... [2019-01-14 14:57:25,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... [2019-01-14 14:57:25,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... [2019-01-14 14:57:25,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... [2019-01-14 14:57:25,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... [2019-01-14 14:57:25,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:57:25,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:57:25,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:57:25,499 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:57:25,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:25,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:57:25,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:57:25,687 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:57:26,907 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-14 14:57:26,907 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-14 14:57:26,908 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:57:26,909 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:57:26,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:26 BoogieIcfgContainer [2019-01-14 14:57:26,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:57:26,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:57:26,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:57:26,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:57:26,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:57:24" (1/3) ... [2019-01-14 14:57:26,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb69af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:26, skipping insertion in model container [2019-01-14 14:57:26,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:25" (2/3) ... [2019-01-14 14:57:26,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb69af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:26, skipping insertion in model container [2019-01-14 14:57:26,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:26" (3/3) ... [2019-01-14 14:57:26,918 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_13_false-unreach-call_false-termination.cil.c [2019-01-14 14:57:26,928 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:57:26,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:57:26,949 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:57:26,982 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:57:26,982 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:57:26,983 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:57:26,983 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:57:26,983 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:57:26,983 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:57:26,983 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:57:26,983 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:57:26,984 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:57:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-01-14 14:57:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:57:27,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:27,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:27,012 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:27,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1440243157, now seen corresponding path program 1 times [2019-01-14 14:57:27,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:27,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:27,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:27,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:27,236 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-14 14:57:27,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:27,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:27,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:27,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:27,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:27,258 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-01-14 14:57:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:27,990 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2019-01-14 14:57:27,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:27,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:57:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:28,006 INFO L225 Difference]: With dead ends: 324 [2019-01-14 14:57:28,007 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 14:57:28,011 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-14 14:57:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 14:57:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-01-14 14:57:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-14 14:57:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-01-14 14:57:28,064 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 25 [2019-01-14 14:57:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:28,064 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-01-14 14:57:28,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-01-14 14:57:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:57:28,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:28,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:28,067 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:28,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1818183234, now seen corresponding path program 1 times [2019-01-14 14:57:28,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:28,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:28,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:28,141 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-14 14:57:28,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:28,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:28,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:28,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:28,145 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 3 states. [2019-01-14 14:57:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:28,438 INFO L93 Difference]: Finished difference Result 329 states and 518 transitions. [2019-01-14 14:57:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:28,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:57:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:28,443 INFO L225 Difference]: With dead ends: 329 [2019-01-14 14:57:28,444 INFO L226 Difference]: Without dead ends: 179 [2019-01-14 14:57:28,450 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-14 14:57:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-14 14:57:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-14 14:57:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-14 14:57:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2019-01-14 14:57:28,481 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 26 [2019-01-14 14:57:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:28,481 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2019-01-14 14:57:28,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-01-14 14:57:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:57:28,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:28,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:28,484 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:28,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1920661961, now seen corresponding path program 1 times [2019-01-14 14:57:28,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:28,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:28,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:28,546 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-14 14:57:28,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:28,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:28,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:28,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:28,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:28,548 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 3 states. [2019-01-14 14:57:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:28,921 INFO L93 Difference]: Finished difference Result 359 states and 559 transitions. [2019-01-14 14:57:28,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:28,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:57:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:28,924 INFO L225 Difference]: With dead ends: 359 [2019-01-14 14:57:28,925 INFO L226 Difference]: Without dead ends: 187 [2019-01-14 14:57:28,926 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-14 14:57:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-14 14:57:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-14 14:57:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-14 14:57:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-01-14 14:57:28,956 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 26 [2019-01-14 14:57:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:28,958 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-01-14 14:57:28,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2019-01-14 14:57:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:57:28,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:28,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:28,960 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:28,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash -304150793, now seen corresponding path program 1 times [2019-01-14 14:57:28,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:28,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:28,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:28,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:29,019 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-14 14:57:29,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:29,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:29,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:29,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:29,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:29,021 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand 3 states. [2019-01-14 14:57:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:29,388 INFO L93 Difference]: Finished difference Result 364 states and 569 transitions. [2019-01-14 14:57:29,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:29,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:57:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:29,391 INFO L225 Difference]: With dead ends: 364 [2019-01-14 14:57:29,391 INFO L226 Difference]: Without dead ends: 186 [2019-01-14 14:57:29,392 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-14 14:57:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-14 14:57:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-01-14 14:57:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-14 14:57:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2019-01-14 14:57:29,403 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 26 [2019-01-14 14:57:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:29,404 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2019-01-14 14:57:29,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2019-01-14 14:57:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:57:29,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:29,405 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] [2019-01-14 14:57:29,406 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:29,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347919, now seen corresponding path program 1 times [2019-01-14 14:57:29,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:29,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:29,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:29,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:29,487 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-14 14:57:29,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:29,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:29,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:29,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:29,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:29,490 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2019-01-14 14:57:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:29,743 INFO L93 Difference]: Finished difference Result 375 states and 581 transitions. [2019-01-14 14:57:29,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:29,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:57:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:29,746 INFO L225 Difference]: With dead ends: 375 [2019-01-14 14:57:29,746 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 14:57:29,747 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-14 14:57:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 14:57:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-01-14 14:57:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-14 14:57:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2019-01-14 14:57:29,757 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 27 [2019-01-14 14:57:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:29,757 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2019-01-14 14:57:29,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2019-01-14 14:57:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:57:29,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:29,759 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] [2019-01-14 14:57:29,759 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1768037659, now seen corresponding path program 1 times [2019-01-14 14:57:29,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:29,822 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-14 14:57:29,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:29,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:29,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:29,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:29,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:29,823 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2019-01-14 14:57:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:30,185 INFO L93 Difference]: Finished difference Result 375 states and 577 transitions. [2019-01-14 14:57:30,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:30,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:57:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:30,188 INFO L225 Difference]: With dead ends: 375 [2019-01-14 14:57:30,188 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 14:57:30,189 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-14 14:57:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 14:57:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-01-14 14:57:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-14 14:57:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2019-01-14 14:57:30,202 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 28 [2019-01-14 14:57:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:30,203 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2019-01-14 14:57:30,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2019-01-14 14:57:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 14:57:30,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:30,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:30,205 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:30,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:30,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1213962132, now seen corresponding path program 1 times [2019-01-14 14:57:30,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:30,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:30,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:30,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:30,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:30,302 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-14 14:57:30,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:30,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:30,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:30,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:30,303 INFO L87 Difference]: Start difference. First operand 186 states and 286 transitions. Second operand 3 states. [2019-01-14 14:57:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:30,497 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2019-01-14 14:57:30,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:30,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 14:57:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:30,503 INFO L225 Difference]: With dead ends: 375 [2019-01-14 14:57:30,504 INFO L226 Difference]: Without dead ends: 196 [2019-01-14 14:57:30,504 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-14 14:57:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-14 14:57:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-01-14 14:57:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-14 14:57:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 284 transitions. [2019-01-14 14:57:30,517 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 284 transitions. Word has length 29 [2019-01-14 14:57:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:30,518 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 284 transitions. [2019-01-14 14:57:30,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 284 transitions. [2019-01-14 14:57:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 14:57:30,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:30,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:30,519 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:30,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:30,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1639645429, now seen corresponding path program 1 times [2019-01-14 14:57:30,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:30,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:30,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:30,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:30,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:30,595 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-14 14:57:30,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:30,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:30,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:57:30,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:57:30,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:57:30,598 INFO L87 Difference]: Start difference. First operand 186 states and 284 transitions. Second operand 4 states. [2019-01-14 14:57:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:30,999 INFO L93 Difference]: Finished difference Result 571 states and 870 transitions. [2019-01-14 14:57:31,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 14:57:31,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-01-14 14:57:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:31,004 INFO L225 Difference]: With dead ends: 571 [2019-01-14 14:57:31,004 INFO L226 Difference]: Without dead ends: 392 [2019-01-14 14:57:31,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:57:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-01-14 14:57:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2019-01-14 14:57:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-14 14:57:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2019-01-14 14:57:31,022 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 29 [2019-01-14 14:57:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:31,022 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2019-01-14 14:57:31,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:57:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2019-01-14 14:57:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 14:57:31,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:31,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:31,024 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:31,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:31,024 INFO L82 PathProgramCache]: Analyzing trace with hash -356314719, now seen corresponding path program 1 times [2019-01-14 14:57:31,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:31,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:31,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:31,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:31,077 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-14 14:57:31,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:31,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:31,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:31,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:31,079 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand 3 states. [2019-01-14 14:57:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:32,017 INFO L93 Difference]: Finished difference Result 780 states and 1196 transitions. [2019-01-14 14:57:32,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:32,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-14 14:57:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:32,022 INFO L225 Difference]: With dead ends: 780 [2019-01-14 14:57:32,023 INFO L226 Difference]: Without dead ends: 431 [2019-01-14 14:57:32,024 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-14 14:57:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-01-14 14:57:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-01-14 14:57:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-01-14 14:57:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 629 transitions. [2019-01-14 14:57:32,050 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 629 transitions. Word has length 32 [2019-01-14 14:57:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:32,050 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 629 transitions. [2019-01-14 14:57:32,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 629 transitions. [2019-01-14 14:57:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-14 14:57:32,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:32,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:32,052 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:32,055 INFO L82 PathProgramCache]: Analyzing trace with hash 863724629, now seen corresponding path program 1 times [2019-01-14 14:57:32,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:32,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:32,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:32,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:32,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:32,144 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-14 14:57:32,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:32,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:32,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:32,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:32,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:32,149 INFO L87 Difference]: Start difference. First operand 411 states and 629 transitions. Second operand 3 states. [2019-01-14 14:57:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:32,769 INFO L93 Difference]: Finished difference Result 857 states and 1320 transitions. [2019-01-14 14:57:32,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:32,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-14 14:57:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:32,774 INFO L225 Difference]: With dead ends: 857 [2019-01-14 14:57:32,775 INFO L226 Difference]: Without dead ends: 453 [2019-01-14 14:57:32,776 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-14 14:57:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-01-14 14:57:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 433. [2019-01-14 14:57:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-01-14 14:57:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2019-01-14 14:57:32,802 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 33 [2019-01-14 14:57:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:32,803 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2019-01-14 14:57:32,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2019-01-14 14:57:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 14:57:32,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:32,804 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] [2019-01-14 14:57:32,804 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:32,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131601, now seen corresponding path program 1 times [2019-01-14 14:57:32,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:32,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:32,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:32,895 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-14 14:57:32,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:32,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:32,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:32,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:32,896 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand 3 states. [2019-01-14 14:57:34,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:34,155 INFO L93 Difference]: Finished difference Result 924 states and 1432 transitions. [2019-01-14 14:57:34,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:34,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-14 14:57:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:34,160 INFO L225 Difference]: With dead ends: 924 [2019-01-14 14:57:34,161 INFO L226 Difference]: Without dead ends: 498 [2019-01-14 14:57:34,162 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-14 14:57:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-01-14 14:57:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2019-01-14 14:57:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-01-14 14:57:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2019-01-14 14:57:34,185 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 39 [2019-01-14 14:57:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:34,186 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2019-01-14 14:57:34,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2019-01-14 14:57:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 14:57:34,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:34,188 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] [2019-01-14 14:57:34,188 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430936, now seen corresponding path program 1 times [2019-01-14 14:57:34,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:34,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:34,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:34,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:34,267 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-14 14:57:34,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:34,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:34,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:34,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:34,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:34,269 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand 3 states. [2019-01-14 14:57:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:34,885 INFO L93 Difference]: Finished difference Result 991 states and 1544 transitions. [2019-01-14 14:57:34,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:34,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-01-14 14:57:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:34,891 INFO L225 Difference]: With dead ends: 991 [2019-01-14 14:57:34,891 INFO L226 Difference]: Without dead ends: 510 [2019-01-14 14:57:34,892 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-14 14:57:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-01-14 14:57:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 500. [2019-01-14 14:57:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-14 14:57:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 781 transitions. [2019-01-14 14:57:34,911 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 781 transitions. Word has length 40 [2019-01-14 14:57:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:34,911 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 781 transitions. [2019-01-14 14:57:34,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 781 transitions. [2019-01-14 14:57:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-14 14:57:34,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:34,913 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 14:57:34,913 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1491732218, now seen corresponding path program 1 times [2019-01-14 14:57:34,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:34,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:34,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:34,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:34,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:34,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:34,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:34,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:34,967 INFO L87 Difference]: Start difference. First operand 500 states and 781 transitions. Second operand 3 states. [2019-01-14 14:57:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:35,781 INFO L93 Difference]: Finished difference Result 1007 states and 1574 transitions. [2019-01-14 14:57:35,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:35,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-01-14 14:57:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:35,785 INFO L225 Difference]: With dead ends: 1007 [2019-01-14 14:57:35,785 INFO L226 Difference]: Without dead ends: 514 [2019-01-14 14:57:35,786 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-14 14:57:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-01-14 14:57:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-01-14 14:57:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-14 14:57:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 777 transitions. [2019-01-14 14:57:35,806 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 777 transitions. Word has length 60 [2019-01-14 14:57:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:35,806 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 777 transitions. [2019-01-14 14:57:35,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 777 transitions. [2019-01-14 14:57:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 14:57:35,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:35,809 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 14:57:35,809 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:35,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash -892846741, now seen corresponding path program 1 times [2019-01-14 14:57:35,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:35,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:35,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:35,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 14:57:35,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:35,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:35,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:35,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:35,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:35,906 INFO L87 Difference]: Start difference. First operand 500 states and 777 transitions. Second operand 3 states. [2019-01-14 14:57:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:36,350 INFO L93 Difference]: Finished difference Result 1035 states and 1604 transitions. [2019-01-14 14:57:36,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:36,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-14 14:57:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:36,353 INFO L225 Difference]: With dead ends: 1035 [2019-01-14 14:57:36,353 INFO L226 Difference]: Without dead ends: 542 [2019-01-14 14:57:36,354 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-14 14:57:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-14 14:57:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2019-01-14 14:57:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-01-14 14:57:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2019-01-14 14:57:36,373 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 61 [2019-01-14 14:57:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:36,374 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2019-01-14 14:57:36,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2019-01-14 14:57:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 14:57:36,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:36,375 INFO L402 BasicCegarLoop]: trace histogram [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-14 14:57:36,376 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:36,376 INFO L82 PathProgramCache]: Analyzing trace with hash 27094997, now seen corresponding path program 1 times [2019-01-14 14:57:36,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:36,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:36,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:36,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:36,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:36,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:36,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:36,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:36,473 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand 3 states. [2019-01-14 14:57:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:36,991 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2019-01-14 14:57:36,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:36,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-14 14:57:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:36,996 INFO L225 Difference]: With dead ends: 1095 [2019-01-14 14:57:36,996 INFO L226 Difference]: Without dead ends: 570 [2019-01-14 14:57:36,998 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-14 14:57:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-01-14 14:57:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-01-14 14:57:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-01-14 14:57:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 873 transitions. [2019-01-14 14:57:37,029 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 873 transitions. Word has length 61 [2019-01-14 14:57:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:37,029 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 873 transitions. [2019-01-14 14:57:37,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 873 transitions. [2019-01-14 14:57:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 14:57:37,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:37,033 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2019-01-14 14:57:37,034 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:37,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:37,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1141694985, now seen corresponding path program 1 times [2019-01-14 14:57:37,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:37,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:37,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 14:57:37,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:37,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:37,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:37,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:37,127 INFO L87 Difference]: Start difference. First operand 570 states and 873 transitions. Second operand 3 states. [2019-01-14 14:57:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:37,361 INFO L93 Difference]: Finished difference Result 1143 states and 1749 transitions. [2019-01-14 14:57:37,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:37,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-01-14 14:57:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:37,364 INFO L225 Difference]: With dead ends: 1143 [2019-01-14 14:57:37,364 INFO L226 Difference]: Without dead ends: 580 [2019-01-14 14:57:37,365 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-14 14:57:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-01-14 14:57:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2019-01-14 14:57:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-01-14 14:57:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 868 transitions. [2019-01-14 14:57:37,385 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 868 transitions. Word has length 62 [2019-01-14 14:57:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:37,385 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 868 transitions. [2019-01-14 14:57:37,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 868 transitions. [2019-01-14 14:57:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-14 14:57:37,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:37,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:37,387 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:37,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:37,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1688729156, now seen corresponding path program 1 times [2019-01-14 14:57:37,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:37,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:37,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:37,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:37,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:37,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:37,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:37,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:37,463 INFO L87 Difference]: Start difference. First operand 570 states and 868 transitions. Second operand 3 states. [2019-01-14 14:57:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:38,067 INFO L93 Difference]: Finished difference Result 1180 states and 1793 transitions. [2019-01-14 14:57:38,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:38,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-14 14:57:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:38,070 INFO L225 Difference]: With dead ends: 1180 [2019-01-14 14:57:38,070 INFO L226 Difference]: Without dead ends: 617 [2019-01-14 14:57:38,072 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-14 14:57:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-01-14 14:57:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-01-14 14:57:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-01-14 14:57:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2019-01-14 14:57:38,092 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 73 [2019-01-14 14:57:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:38,092 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2019-01-14 14:57:38,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2019-01-14 14:57:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 14:57:38,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:38,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:38,094 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash -628849429, now seen corresponding path program 1 times [2019-01-14 14:57:38,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:38,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:38,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:38,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:38,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:38,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:38,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:38,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:38,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:38,152 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand 3 states. [2019-01-14 14:57:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:38,375 INFO L93 Difference]: Finished difference Result 1223 states and 1851 transitions. [2019-01-14 14:57:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:38,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-01-14 14:57:38,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:38,377 INFO L225 Difference]: With dead ends: 1223 [2019-01-14 14:57:38,378 INFO L226 Difference]: Without dead ends: 617 [2019-01-14 14:57:38,379 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-14 14:57:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-01-14 14:57:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-01-14 14:57:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-01-14 14:57:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 926 transitions. [2019-01-14 14:57:38,401 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 926 transitions. Word has length 74 [2019-01-14 14:57:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:38,401 INFO L480 AbstractCegarLoop]: Abstraction has 613 states and 926 transitions. [2019-01-14 14:57:38,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 926 transitions. [2019-01-14 14:57:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 14:57:38,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:38,404 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:38,404 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:38,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1361446465, now seen corresponding path program 1 times [2019-01-14 14:57:38,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:38,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 14:57:38,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:38,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:38,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:38,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:38,465 INFO L87 Difference]: Start difference. First operand 613 states and 926 transitions. Second operand 3 states. [2019-01-14 14:57:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:38,654 INFO L93 Difference]: Finished difference Result 1255 states and 1894 transitions. [2019-01-14 14:57:38,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:38,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-14 14:57:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:38,658 INFO L225 Difference]: With dead ends: 1255 [2019-01-14 14:57:38,658 INFO L226 Difference]: Without dead ends: 649 [2019-01-14 14:57:38,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-01-14 14:57:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-01-14 14:57:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-01-14 14:57:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 960 transitions. [2019-01-14 14:57:38,680 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 960 transitions. Word has length 83 [2019-01-14 14:57:38,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:38,681 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 960 transitions. [2019-01-14 14:57:38,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 960 transitions. [2019-01-14 14:57:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:57:38,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:38,684 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:38,685 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1716915501, now seen corresponding path program 1 times [2019-01-14 14:57:38,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:38,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:38,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:38,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 14:57:38,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:38,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:38,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:38,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:38,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:38,765 INFO L87 Difference]: Start difference. First operand 641 states and 960 transitions. Second operand 3 states. [2019-01-14 14:57:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:38,965 INFO L93 Difference]: Finished difference Result 1283 states and 1921 transitions. [2019-01-14 14:57:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:38,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:57:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:38,969 INFO L225 Difference]: With dead ends: 1283 [2019-01-14 14:57:38,969 INFO L226 Difference]: Without dead ends: 649 [2019-01-14 14:57:38,970 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-14 14:57:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-01-14 14:57:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-01-14 14:57:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-01-14 14:57:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2019-01-14 14:57:38,992 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 84 [2019-01-14 14:57:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:38,993 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2019-01-14 14:57:38,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2019-01-14 14:57:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-14 14:57:38,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:38,995 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:38,995 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:38,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1450581597, now seen corresponding path program 1 times [2019-01-14 14:57:38,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:38,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 14:57:39,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:39,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:39,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:39,072 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2019-01-14 14:57:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:39,357 INFO L93 Difference]: Finished difference Result 1315 states and 1948 transitions. [2019-01-14 14:57:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:39,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-01-14 14:57:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:39,362 INFO L225 Difference]: With dead ends: 1315 [2019-01-14 14:57:39,363 INFO L226 Difference]: Without dead ends: 681 [2019-01-14 14:57:39,364 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-14 14:57:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-01-14 14:57:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-01-14 14:57:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-01-14 14:57:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 997 transitions. [2019-01-14 14:57:39,384 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 997 transitions. Word has length 88 [2019-01-14 14:57:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:39,386 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 997 transitions. [2019-01-14 14:57:39,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 997 transitions. [2019-01-14 14:57:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-14 14:57:39,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:39,389 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] [2019-01-14 14:57:39,389 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:39,389 INFO L82 PathProgramCache]: Analyzing trace with hash -398439497, now seen corresponding path program 1 times [2019-01-14 14:57:39,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:39,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:39,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 14:57:39,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:39,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:39,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:39,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:39,477 INFO L87 Difference]: Start difference. First operand 677 states and 997 transitions. Second operand 3 states. [2019-01-14 14:57:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:39,884 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2019-01-14 14:57:39,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:39,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-14 14:57:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:39,889 INFO L225 Difference]: With dead ends: 1351 [2019-01-14 14:57:39,889 INFO L226 Difference]: Without dead ends: 681 [2019-01-14 14:57:39,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-14 14:57:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-01-14 14:57:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-01-14 14:57:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-01-14 14:57:39,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 992 transitions. [2019-01-14 14:57:39,912 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 992 transitions. Word has length 89 [2019-01-14 14:57:39,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:39,912 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 992 transitions. [2019-01-14 14:57:39,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 992 transitions. [2019-01-14 14:57:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 14:57:39,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:39,916 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1] [2019-01-14 14:57:39,917 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1868895208, now seen corresponding path program 1 times [2019-01-14 14:57:39,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:39,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 14:57:39,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:39,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:39,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:39,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:39,986 INFO L87 Difference]: Start difference. First operand 677 states and 992 transitions. Second operand 3 states. [2019-01-14 14:57:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:40,131 INFO L93 Difference]: Finished difference Result 2003 states and 2928 transitions. [2019-01-14 14:57:40,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:40,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-14 14:57:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:40,141 INFO L225 Difference]: With dead ends: 2003 [2019-01-14 14:57:40,141 INFO L226 Difference]: Without dead ends: 1333 [2019-01-14 14:57:40,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-01-14 14:57:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 679. [2019-01-14 14:57:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-01-14 14:57:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 994 transitions. [2019-01-14 14:57:40,192 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 994 transitions. Word has length 100 [2019-01-14 14:57:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:40,192 INFO L480 AbstractCegarLoop]: Abstraction has 679 states and 994 transitions. [2019-01-14 14:57:40,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 994 transitions. [2019-01-14 14:57:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-14 14:57:40,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:40,197 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1] [2019-01-14 14:57:40,197 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash 589031530, now seen corresponding path program 1 times [2019-01-14 14:57:40,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:40,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:40,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-14 14:57:40,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:40,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:40,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:40,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:40,285 INFO L87 Difference]: Start difference. First operand 679 states and 994 transitions. Second operand 3 states. [2019-01-14 14:57:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:40,467 INFO L93 Difference]: Finished difference Result 1362 states and 1992 transitions. [2019-01-14 14:57:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:40,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-14 14:57:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:40,473 INFO L225 Difference]: With dead ends: 1362 [2019-01-14 14:57:40,473 INFO L226 Difference]: Without dead ends: 690 [2019-01-14 14:57:40,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-01-14 14:57:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 677. [2019-01-14 14:57:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-01-14 14:57:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 987 transitions. [2019-01-14 14:57:40,527 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 987 transitions. Word has length 100 [2019-01-14 14:57:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:40,527 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 987 transitions. [2019-01-14 14:57:40,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 987 transitions. [2019-01-14 14:57:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 14:57:40,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:40,532 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-01-14 14:57:40,533 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash 303396910, now seen corresponding path program 1 times [2019-01-14 14:57:40,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:40,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:40,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 14:57:40,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:40,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:40,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:40,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:40,636 INFO L87 Difference]: Start difference. First operand 677 states and 987 transitions. Second operand 3 states. [2019-01-14 14:57:40,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:40,988 INFO L93 Difference]: Finished difference Result 2017 states and 2939 transitions. [2019-01-14 14:57:40,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:40,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-14 14:57:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:40,993 INFO L225 Difference]: With dead ends: 2017 [2019-01-14 14:57:40,994 INFO L226 Difference]: Without dead ends: 1347 [2019-01-14 14:57:40,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-01-14 14:57:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2019-01-14 14:57:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-01-14 14:57:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1950 transitions. [2019-01-14 14:57:41,046 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1950 transitions. Word has length 101 [2019-01-14 14:57:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:41,047 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 1950 transitions. [2019-01-14 14:57:41,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1950 transitions. [2019-01-14 14:57:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-14 14:57:41,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:41,051 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-01-14 14:57:41,051 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:41,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash -283409104, now seen corresponding path program 1 times [2019-01-14 14:57:41,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:41,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:41,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:41,171 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 14:57:41,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:57:41 BoogieIcfgContainer [2019-01-14 14:57:41,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:57:41,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:57:41,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:57:41,250 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:57:41,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:26" (3/4) ... [2019-01-14 14:57:41,255 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 14:57:41,384 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:57:41,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:57:41,390 INFO L168 Benchmark]: Toolchain (without parser) took 16601.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -236.5 MB). Peak memory consumption was 76.0 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:41,392 INFO L168 Benchmark]: CDTParser took 0.16 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-14 14:57:41,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.88 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:41,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:41,394 INFO L168 Benchmark]: Boogie Preprocessor took 60.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:57:41,394 INFO L168 Benchmark]: RCFGBuilder took 1411.07 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: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:41,394 INFO L168 Benchmark]: TraceAbstraction took 14338.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:41,397 INFO L168 Benchmark]: Witness Printer took 137.88 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.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:41,400 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.16 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 500.88 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.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 145.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1411.07 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: 63.9 MB). Peak memory consumption was 63.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14338.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -136.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Witness Printer took 137.88 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.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L648] int s ; [L649] int tmp ; [L653] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 ; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [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 = __VERIFIER_nondet_int() ; [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 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND FALSE !(tmp___1 + 12288) [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) [L632] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) [L632] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND TRUE s__state == 8512 [L302] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L303] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L304] COND TRUE __cil_tmp56 + 256UL [L305] skip = 1 [L316] s__state = 8528 [L317] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND FALSE !(! s__s3__tmp__reuse_message) [L632] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND TRUE s__state == 8528 [L321] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L322] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L324] __cil_tmp57 = (unsigned long )s__options [L325] COND TRUE __cil_tmp57 + 2097152UL [L326] s__s3__tmp__use_rsa_tmp = 1 [L331] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L358] ret = __VERIFIER_nondet_int() [L359] COND FALSE !(blastFlag == 6) [L362] COND FALSE !(ret <= 0) [L379] s__state = 8544 [L380] s__init_num = 0 [L600] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L601] COND TRUE ! s__s3__tmp__reuse_message [L602] COND TRUE ! skip [L603] COND TRUE state == 8528 [L604] COND TRUE s__state == 8544 [L605] COND TRUE tmp___7 != 1024 [L606] COND TRUE tmp___7 != 512 [L607] COND TRUE __cil_tmp58 != 4294967294 [L608] COND TRUE l != 4294967266 [L643] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 1 error locations. UNSAFE Result, 14.2s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4244 SDtfs, 4375 SDslu, 1279 SDs, 0 SdLazy, 2053 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=25, 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.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 179497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...