./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_11_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_11_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 ae705993e63b3008e90aaee53f628d98e6fe9ab5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:14,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:57:14,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:57:14,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:57:14,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:57:14,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:57:14,081 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:57:14,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:57:14,084 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:57:14,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:57:14,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:57:14,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:57:14,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:57:14,088 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:57:14,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:57:14,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:57:14,091 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:57:14,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:57:14,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:57:14,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:57:14,098 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:57:14,099 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:57:14,101 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:57:14,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:57:14,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:57:14,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:57:14,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:57:14,104 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:57:14,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:57:14,106 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:57:14,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:57:14,107 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:57:14,107 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:57:14,108 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:57:14,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:57:14,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:57:14,110 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:14,124 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:57:14,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:57:14,126 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:57:14,126 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:57:14,126 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:57:14,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:57:14,127 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:57:14,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:57:14,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:57:14,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:57:14,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:57:14,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:57:14,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:57:14,128 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:57:14,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:57:14,128 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:57:14,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:57:14,130 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:57:14,130 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:57:14,131 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:57:14,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:57:14,131 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:57:14,131 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:57:14,131 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:57:14,132 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:57:14,133 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:57:14,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:57:14,133 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 -> ae705993e63b3008e90aaee53f628d98e6fe9ab5 [2019-01-14 14:57:14,186 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:57:14,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:57:14,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:57:14,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:57:14,214 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:57:14,215 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_11_false-unreach-call_false-termination.cil.c [2019-01-14 14:57:14,275 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7778b79a/d300612f65c641f391c93a0a1a523024/FLAG7ef784c2d [2019-01-14 14:57:14,734 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:57:14,734 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_11_false-unreach-call_false-termination.cil.c [2019-01-14 14:57:14,746 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7778b79a/d300612f65c641f391c93a0a1a523024/FLAG7ef784c2d [2019-01-14 14:57:15,057 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7778b79a/d300612f65c641f391c93a0a1a523024 [2019-01-14 14:57:15,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:57:15,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:57:15,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:15,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:57:15,068 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:57:15,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:15" (1/1) ... [2019-01-14 14:57:15,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e3b00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:15, skipping insertion in model container [2019-01-14 14:57:15,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:57:15" (1/1) ... [2019-01-14 14:57:15,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:57:15,128 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:57:15,428 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:15,435 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:57:15,521 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:57:15,541 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:57:15,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:15 WrapperNode [2019-01-14 14:57:15,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:57:15,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:15,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:57:15,542 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:57:15,551 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:15" (1/1) ... [2019-01-14 14:57:15,626 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:15" (1/1) ... [2019-01-14 14:57:15,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:57:15,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:57:15,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:57:15,685 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:57:15,694 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:15" (1/1) ... [2019-01-14 14:57:15,694 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:15" (1/1) ... [2019-01-14 14:57:15,698 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:15" (1/1) ... [2019-01-14 14:57:15,698 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:15" (1/1) ... [2019-01-14 14:57:15,706 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:15" (1/1) ... [2019-01-14 14:57:15,716 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:15" (1/1) ... [2019-01-14 14:57:15,719 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:15" (1/1) ... [2019-01-14 14:57:15,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:57:15,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:57:15,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:57:15,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:57:15,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:15" (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:15,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:57:15,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:57:15,929 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 14:57:16,944 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-14 14:57:16,944 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-14 14:57:16,945 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:57:16,946 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 14:57:16,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:16 BoogieIcfgContainer [2019-01-14 14:57:16,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:57:16,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:57:16,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:57:16,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:57:16,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:57:15" (1/3) ... [2019-01-14 14:57:16,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3796df40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:16, skipping insertion in model container [2019-01-14 14:57:16,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:57:15" (2/3) ... [2019-01-14 14:57:16,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3796df40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:57:16, skipping insertion in model container [2019-01-14 14:57:16,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:57:16" (3/3) ... [2019-01-14 14:57:16,955 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_11_false-unreach-call_false-termination.cil.c [2019-01-14 14:57:16,963 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:57:16,970 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:57:16,987 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:57:17,020 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:57:17,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:57:17,022 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:57:17,022 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:57:17,022 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:57:17,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:57:17,023 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:57:17,023 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:57:17,023 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:57:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-01-14 14:57:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:57:17,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:17,053 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:17,056 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:17,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1603119947, now seen corresponding path program 1 times [2019-01-14 14:57:17,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:17,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:17,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:17,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:17,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:17,288 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:17,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:17,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:17,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:17,311 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-01-14 14:57:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:18,030 INFO L93 Difference]: Finished difference Result 315 states and 541 transitions. [2019-01-14 14:57:18,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:18,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:57:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:18,048 INFO L225 Difference]: With dead ends: 315 [2019-01-14 14:57:18,048 INFO L226 Difference]: Without dead ends: 154 [2019-01-14 14:57:18,053 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:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-14 14:57:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-01-14 14:57:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-14 14:57:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 240 transitions. [2019-01-14 14:57:18,105 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 240 transitions. Word has length 25 [2019-01-14 14:57:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:18,105 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 240 transitions. [2019-01-14 14:57:18,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 240 transitions. [2019-01-14 14:57:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:57:18,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:18,108 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:18,108 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1655306444, now seen corresponding path program 1 times [2019-01-14 14:57:18,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:18,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:18,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:18,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:18,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:18,173 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:18,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:18,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:18,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:18,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:18,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:18,177 INFO L87 Difference]: Start difference. First operand 152 states and 240 transitions. Second operand 3 states. [2019-01-14 14:57:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:18,464 INFO L93 Difference]: Finished difference Result 318 states and 501 transitions. [2019-01-14 14:57:18,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:18,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:57:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:18,469 INFO L225 Difference]: With dead ends: 318 [2019-01-14 14:57:18,469 INFO L226 Difference]: Without dead ends: 173 [2019-01-14 14:57:18,470 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:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-14 14:57:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-14 14:57:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-14 14:57:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-01-14 14:57:18,492 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 26 [2019-01-14 14:57:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:18,493 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-01-14 14:57:18,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-01-14 14:57:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:57:18,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:18,494 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:18,495 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:18,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2083538751, now seen corresponding path program 1 times [2019-01-14 14:57:18,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:18,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:18,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:18,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:18,621 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:18,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:18,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:18,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:18,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:18,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:18,623 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand 3 states. [2019-01-14 14:57:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:18,973 INFO L93 Difference]: Finished difference Result 347 states and 541 transitions. [2019-01-14 14:57:18,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:18,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:57:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:18,980 INFO L225 Difference]: With dead ends: 347 [2019-01-14 14:57:18,980 INFO L226 Difference]: Without dead ends: 181 [2019-01-14 14:57:18,982 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:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-14 14:57:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-01-14 14:57:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-14 14:57:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions. [2019-01-14 14:57:18,997 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 26 [2019-01-14 14:57:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:18,998 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 280 transitions. [2019-01-14 14:57:18,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions. [2019-01-14 14:57:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:57:18,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:19,000 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:19,001 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash -467027583, now seen corresponding path program 1 times [2019-01-14 14:57:19,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:19,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:19,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:19,106 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:19,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:19,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:19,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:19,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:19,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:19,109 INFO L87 Difference]: Start difference. First operand 179 states and 280 transitions. Second operand 3 states. [2019-01-14 14:57:19,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:19,425 INFO L93 Difference]: Finished difference Result 352 states and 551 transitions. [2019-01-14 14:57:19,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:19,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:57:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:19,428 INFO L225 Difference]: With dead ends: 352 [2019-01-14 14:57:19,428 INFO L226 Difference]: Without dead ends: 180 [2019-01-14 14:57:19,430 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:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-14 14:57:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-01-14 14:57:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 14:57:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2019-01-14 14:57:19,444 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 26 [2019-01-14 14:57:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:19,445 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2019-01-14 14:57:19,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2019-01-14 14:57:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:57:19,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:19,447 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:19,447 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1902471129, now seen corresponding path program 1 times [2019-01-14 14:57:19,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:19,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:19,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:19,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:19,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:19,520 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:19,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:19,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:19,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:19,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:19,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:19,522 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 3 states. [2019-01-14 14:57:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:19,724 INFO L93 Difference]: Finished difference Result 363 states and 563 transitions. [2019-01-14 14:57:19,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:19,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:57:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:19,727 INFO L225 Difference]: With dead ends: 363 [2019-01-14 14:57:19,727 INFO L226 Difference]: Without dead ends: 190 [2019-01-14 14:57:19,728 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:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-14 14:57:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-01-14 14:57:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 14:57:19,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-01-14 14:57:19,744 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 27 [2019-01-14 14:57:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:19,745 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-01-14 14:57:19,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-01-14 14:57:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:57:19,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:19,750 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:19,750 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:19,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1605160869, now seen corresponding path program 1 times [2019-01-14 14:57:19,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:19,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:19,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:19,836 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:19,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:19,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:19,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:19,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:19,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:19,837 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 3 states. [2019-01-14 14:57:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:20,071 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2019-01-14 14:57:20,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:20,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:57:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:20,074 INFO L225 Difference]: With dead ends: 363 [2019-01-14 14:57:20,074 INFO L226 Difference]: Without dead ends: 190 [2019-01-14 14:57:20,075 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:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-14 14:57:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-01-14 14:57:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 14:57:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-01-14 14:57:20,086 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 28 [2019-01-14 14:57:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:20,086 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-01-14 14:57:20,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-01-14 14:57:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 14:57:20,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:20,089 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:20,090 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:20,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1051085342, now seen corresponding path program 1 times [2019-01-14 14:57:20,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:20,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:20,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:20,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:20,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:20,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:20,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:20,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:20,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:20,143 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 3 states. [2019-01-14 14:57:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:20,394 INFO L93 Difference]: Finished difference Result 363 states and 555 transitions. [2019-01-14 14:57:20,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:20,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 14:57:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:20,398 INFO L225 Difference]: With dead ends: 363 [2019-01-14 14:57:20,399 INFO L226 Difference]: Without dead ends: 190 [2019-01-14 14:57:20,399 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:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-14 14:57:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-01-14 14:57:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 14:57:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-01-14 14:57:20,410 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 29 [2019-01-14 14:57:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:20,410 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-01-14 14:57:20,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-01-14 14:57:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 14:57:20,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:20,413 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:20,413 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:20,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1476768639, now seen corresponding path program 1 times [2019-01-14 14:57:20,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:20,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:20,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:20,515 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:20,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:20,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:20,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 14:57:20,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 14:57:20,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 14:57:20,517 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-01-14 14:57:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:20,900 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-01-14 14:57:20,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 14:57:20,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-01-14 14:57:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:20,904 INFO L225 Difference]: With dead ends: 511 [2019-01-14 14:57:20,904 INFO L226 Difference]: Without dead ends: 338 [2019-01-14 14:57:20,905 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:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-14 14:57:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2019-01-14 14:57:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-01-14 14:57:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2019-01-14 14:57:20,922 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 29 [2019-01-14 14:57:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:20,922 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2019-01-14 14:57:20,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 14:57:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2019-01-14 14:57:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 14:57:20,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:20,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:20,925 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash -91605738, now seen corresponding path program 1 times [2019-01-14 14:57:20,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:20,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:20,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:21,006 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:21,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:21,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:21,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:21,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:21,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:21,008 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand 3 states. [2019-01-14 14:57:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:21,776 INFO L93 Difference]: Finished difference Result 698 states and 1074 transitions. [2019-01-14 14:57:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:21,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-14 14:57:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:21,781 INFO L225 Difference]: With dead ends: 698 [2019-01-14 14:57:21,781 INFO L226 Difference]: Without dead ends: 382 [2019-01-14 14:57:21,782 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:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-01-14 14:57:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-01-14 14:57:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-01-14 14:57:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 581 transitions. [2019-01-14 14:57:21,804 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 581 transitions. Word has length 43 [2019-01-14 14:57:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:21,805 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 581 transitions. [2019-01-14 14:57:21,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 581 transitions. [2019-01-14 14:57:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 14:57:21,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:21,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:21,808 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:21,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:21,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033309, now seen corresponding path program 1 times [2019-01-14 14:57:21,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:21,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:21,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:21,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:21,898 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:21,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:21,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:21,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:21,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:21,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:21,900 INFO L87 Difference]: Start difference. First operand 374 states and 581 transitions. Second operand 3 states. [2019-01-14 14:57:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:22,984 INFO L93 Difference]: Finished difference Result 775 states and 1210 transitions. [2019-01-14 14:57:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:22,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-14 14:57:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:22,988 INFO L225 Difference]: With dead ends: 775 [2019-01-14 14:57:22,989 INFO L226 Difference]: Without dead ends: 406 [2019-01-14 14:57:22,990 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:22,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-14 14:57:23,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 398. [2019-01-14 14:57:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-01-14 14:57:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 627 transitions. [2019-01-14 14:57:23,008 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 627 transitions. Word has length 44 [2019-01-14 14:57:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:23,009 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 627 transitions. [2019-01-14 14:57:23,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 627 transitions. [2019-01-14 14:57:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-14 14:57:23,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:23,012 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:23,012 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:23,012 INFO L82 PathProgramCache]: Analyzing trace with hash 501139110, now seen corresponding path program 1 times [2019-01-14 14:57:23,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:23,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:23,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:23,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 14:57:23,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:23,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:23,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:23,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:23,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:23,089 INFO L87 Difference]: Start difference. First operand 398 states and 627 transitions. Second operand 3 states. [2019-01-14 14:57:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:24,111 INFO L93 Difference]: Finished difference Result 829 states and 1310 transitions. [2019-01-14 14:57:24,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:24,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-01-14 14:57:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:24,115 INFO L225 Difference]: With dead ends: 829 [2019-01-14 14:57:24,115 INFO L226 Difference]: Without dead ends: 438 [2019-01-14 14:57:24,116 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:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-01-14 14:57:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-01-14 14:57:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-01-14 14:57:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 692 transitions. [2019-01-14 14:57:24,136 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 692 transitions. Word has length 54 [2019-01-14 14:57:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:24,136 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 692 transitions. [2019-01-14 14:57:24,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 692 transitions. [2019-01-14 14:57:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-14 14:57:24,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:24,140 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:24,141 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:24,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1234673389, now seen corresponding path program 1 times [2019-01-14 14:57:24,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:24,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:24,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:24,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:24,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 14:57:24,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:24,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:24,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:24,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:24,227 INFO L87 Difference]: Start difference. First operand 438 states and 692 transitions. Second operand 3 states. [2019-01-14 14:57:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:24,613 INFO L93 Difference]: Finished difference Result 911 states and 1440 transitions. [2019-01-14 14:57:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:24,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-01-14 14:57:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:24,618 INFO L225 Difference]: With dead ends: 911 [2019-01-14 14:57:24,618 INFO L226 Difference]: Without dead ends: 480 [2019-01-14 14:57:24,619 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:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-01-14 14:57:24,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-01-14 14:57:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-01-14 14:57:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 752 transitions. [2019-01-14 14:57:24,638 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 752 transitions. Word has length 81 [2019-01-14 14:57:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:24,638 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 752 transitions. [2019-01-14 14:57:24,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 752 transitions. [2019-01-14 14:57:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-14 14:57:24,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:24,642 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:24,642 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash -337353345, now seen corresponding path program 1 times [2019-01-14 14:57:24,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:24,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:24,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:24,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:24,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 14:57:24,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:24,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:24,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:24,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:24,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:24,715 INFO L87 Difference]: Start difference. First operand 476 states and 752 transitions. Second operand 3 states. [2019-01-14 14:57:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:25,327 INFO L93 Difference]: Finished difference Result 949 states and 1497 transitions. [2019-01-14 14:57:25,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:25,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-01-14 14:57:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:25,332 INFO L225 Difference]: With dead ends: 949 [2019-01-14 14:57:25,332 INFO L226 Difference]: Without dead ends: 480 [2019-01-14 14:57:25,333 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:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-01-14 14:57:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-01-14 14:57:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-01-14 14:57:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 749 transitions. [2019-01-14 14:57:25,350 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 749 transitions. Word has length 82 [2019-01-14 14:57:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:25,350 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 749 transitions. [2019-01-14 14:57:25,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 749 transitions. [2019-01-14 14:57:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-14 14:57:25,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:25,352 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:25,352 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:25,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:25,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1112997795, now seen corresponding path program 1 times [2019-01-14 14:57:25,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:25,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:25,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:25,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:25,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 14:57:25,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:25,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:25,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:25,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:25,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:25,429 INFO L87 Difference]: Start difference. First operand 476 states and 749 transitions. Second operand 3 states. [2019-01-14 14:57:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:26,007 INFO L93 Difference]: Finished difference Result 997 states and 1572 transitions. [2019-01-14 14:57:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:26,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-14 14:57:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:26,010 INFO L225 Difference]: With dead ends: 997 [2019-01-14 14:57:26,010 INFO L226 Difference]: Without dead ends: 528 [2019-01-14 14:57:26,012 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:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-01-14 14:57:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-01-14 14:57:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-01-14 14:57:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 804 transitions. [2019-01-14 14:57:26,030 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 804 transitions. Word has length 83 [2019-01-14 14:57:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:26,030 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 804 transitions. [2019-01-14 14:57:26,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 804 transitions. [2019-01-14 14:57:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:57:26,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:26,032 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:26,032 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1939998609, now seen corresponding path program 1 times [2019-01-14 14:57:26,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:26,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:26,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:26,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:26,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 14:57:26,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:26,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:26,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:26,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:26,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:26,113 INFO L87 Difference]: Start difference. First operand 512 states and 804 transitions. Second operand 3 states. [2019-01-14 14:57:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:26,457 INFO L93 Difference]: Finished difference Result 1033 states and 1623 transitions. [2019-01-14 14:57:26,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:26,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:57:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:26,462 INFO L225 Difference]: With dead ends: 1033 [2019-01-14 14:57:26,463 INFO L226 Difference]: Without dead ends: 528 [2019-01-14 14:57:26,464 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:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-01-14 14:57:26,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-01-14 14:57:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-01-14 14:57:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 800 transitions. [2019-01-14 14:57:26,490 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 800 transitions. Word has length 84 [2019-01-14 14:57:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:26,491 INFO L480 AbstractCegarLoop]: Abstraction has 512 states and 800 transitions. [2019-01-14 14:57:26,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 800 transitions. [2019-01-14 14:57:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-14 14:57:26,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:26,493 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:26,494 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1409112293, now seen corresponding path program 1 times [2019-01-14 14:57:26,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:26,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:26,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:26,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:26,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:26,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:26,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:26,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:26,589 INFO L87 Difference]: Start difference. First operand 512 states and 800 transitions. Second operand 3 states. [2019-01-14 14:57:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:27,804 INFO L93 Difference]: Finished difference Result 1078 states and 1682 transitions. [2019-01-14 14:57:27,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:27,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-14 14:57:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:27,807 INFO L225 Difference]: With dead ends: 1078 [2019-01-14 14:57:27,807 INFO L226 Difference]: Without dead ends: 573 [2019-01-14 14:57:27,810 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:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-01-14 14:57:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 565. [2019-01-14 14:57:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-01-14 14:57:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 881 transitions. [2019-01-14 14:57:27,830 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 881 transitions. Word has length 84 [2019-01-14 14:57:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:27,831 INFO L480 AbstractCegarLoop]: Abstraction has 565 states and 881 transitions. [2019-01-14 14:57:27,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 881 transitions. [2019-01-14 14:57:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-14 14:57:27,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:27,832 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:27,832 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:27,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1919478498, now seen corresponding path program 1 times [2019-01-14 14:57:27,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:27,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:27,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:27,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:57:27,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:27,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:27,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:27,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:27,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:27,910 INFO L87 Difference]: Start difference. First operand 565 states and 881 transitions. Second operand 3 states. [2019-01-14 14:57:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:28,163 INFO L93 Difference]: Finished difference Result 1131 states and 1761 transitions. [2019-01-14 14:57:28,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:28,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-01-14 14:57:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:28,167 INFO L225 Difference]: With dead ends: 1131 [2019-01-14 14:57:28,167 INFO L226 Difference]: Without dead ends: 571 [2019-01-14 14:57:28,168 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,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-01-14 14:57:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2019-01-14 14:57:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-01-14 14:57:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 876 transitions. [2019-01-14 14:57:28,188 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 876 transitions. Word has length 85 [2019-01-14 14:57:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:28,188 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 876 transitions. [2019-01-14 14:57:28,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 876 transitions. [2019-01-14 14:57:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-14 14:57:28,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:28,190 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:28,190 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:28,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:28,191 INFO L82 PathProgramCache]: Analyzing trace with hash -818800783, now seen corresponding path program 1 times [2019-01-14 14:57:28,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:28,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-14 14:57:28,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:28,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:28,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:28,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:28,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:28,244 INFO L87 Difference]: Start difference. First operand 563 states and 876 transitions. Second operand 3 states. [2019-01-14 14:57:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:28,386 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-01-14 14:57:28,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:28,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-01-14 14:57:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:28,389 INFO L225 Difference]: With dead ends: 1159 [2019-01-14 14:57:28,389 INFO L226 Difference]: Without dead ends: 603 [2019-01-14 14:57:28,390 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,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-01-14 14:57:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-01-14 14:57:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-01-14 14:57:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 917 transitions. [2019-01-14 14:57:28,412 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 917 transitions. Word has length 106 [2019-01-14 14:57:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:28,412 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 917 transitions. [2019-01-14 14:57:28,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 917 transitions. [2019-01-14 14:57:28,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-14 14:57:28,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:28,415 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:28,416 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1053492997, now seen corresponding path program 1 times [2019-01-14 14:57:28,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:28,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:28,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:28,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-14 14:57:28,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:28,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:28,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:28,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:28,496 INFO L87 Difference]: Start difference. First operand 593 states and 917 transitions. Second operand 3 states. [2019-01-14 14:57:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:28,737 INFO L93 Difference]: Finished difference Result 1189 states and 1839 transitions. [2019-01-14 14:57:28,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:28,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-01-14 14:57:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:28,742 INFO L225 Difference]: With dead ends: 1189 [2019-01-14 14:57:28,743 INFO L226 Difference]: Without dead ends: 603 [2019-01-14 14:57:28,744 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,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-01-14 14:57:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-01-14 14:57:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-01-14 14:57:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 911 transitions. [2019-01-14 14:57:28,763 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 911 transitions. Word has length 107 [2019-01-14 14:57:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:28,763 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 911 transitions. [2019-01-14 14:57:28,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 911 transitions. [2019-01-14 14:57:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-14 14:57:28,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:28,765 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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:28,765 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:28,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:28,766 INFO L82 PathProgramCache]: Analyzing trace with hash 532417498, now seen corresponding path program 1 times [2019-01-14 14:57:28,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:28,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:28,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:28,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-14 14:57:28,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:28,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:28,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:28,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:28,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:28,846 INFO L87 Difference]: Start difference. First operand 593 states and 911 transitions. Second operand 3 states. [2019-01-14 14:57:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:29,575 INFO L93 Difference]: Finished difference Result 1239 states and 1906 transitions. [2019-01-14 14:57:29,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:29,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-01-14 14:57:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:29,579 INFO L225 Difference]: With dead ends: 1239 [2019-01-14 14:57:29,579 INFO L226 Difference]: Without dead ends: 653 [2019-01-14 14:57:29,580 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,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-01-14 14:57:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-01-14 14:57:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-01-14 14:57:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 958 transitions. [2019-01-14 14:57:29,603 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 958 transitions. Word has length 110 [2019-01-14 14:57:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:29,603 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 958 transitions. [2019-01-14 14:57:29,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 958 transitions. [2019-01-14 14:57:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-14 14:57:29,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:29,607 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:29,607 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:29,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1562226642, now seen corresponding path program 1 times [2019-01-14 14:57:29,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:29,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:29,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:29,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:29,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-14 14:57:29,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:29,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:29,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:29,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:29,679 INFO L87 Difference]: Start difference. First operand 627 states and 958 transitions. Second operand 3 states. [2019-01-14 14:57:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:30,078 INFO L93 Difference]: Finished difference Result 1273 states and 1947 transitions. [2019-01-14 14:57:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:30,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-01-14 14:57:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:30,083 INFO L225 Difference]: With dead ends: 1273 [2019-01-14 14:57:30,083 INFO L226 Difference]: Without dead ends: 653 [2019-01-14 14:57:30,084 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,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-01-14 14:57:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-01-14 14:57:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-01-14 14:57:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 952 transitions. [2019-01-14 14:57:30,104 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 952 transitions. Word has length 111 [2019-01-14 14:57:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:30,106 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 952 transitions. [2019-01-14 14:57:30,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 952 transitions. [2019-01-14 14:57:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-14 14:57:30,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:30,108 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:30,108 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2031768980, now seen corresponding path program 1 times [2019-01-14 14:57:30,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:30,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:30,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:30,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:30,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-14 14:57:30,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:30,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:30,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:30,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:30,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:30,184 INFO L87 Difference]: Start difference. First operand 627 states and 952 transitions. Second operand 3 states. [2019-01-14 14:57:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:30,527 INFO L93 Difference]: Finished difference Result 1300 states and 1972 transitions. [2019-01-14 14:57:30,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:30,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-01-14 14:57:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:30,532 INFO L225 Difference]: With dead ends: 1300 [2019-01-14 14:57:30,532 INFO L226 Difference]: Without dead ends: 680 [2019-01-14 14:57:30,533 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,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-01-14 14:57:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-01-14 14:57:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-01-14 14:57:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1020 transitions. [2019-01-14 14:57:30,562 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1020 transitions. Word has length 122 [2019-01-14 14:57:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:30,562 INFO L480 AbstractCegarLoop]: Abstraction has 674 states and 1020 transitions. [2019-01-14 14:57:30,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1020 transitions. [2019-01-14 14:57:30,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-14 14:57:30,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:30,566 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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,566 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:30,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:30,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1706022811, now seen corresponding path program 1 times [2019-01-14 14:57:30,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:30,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:30,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:30,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:30,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-14 14:57:30,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:30,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:30,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:30,693 INFO L87 Difference]: Start difference. First operand 674 states and 1020 transitions. Second operand 3 states. [2019-01-14 14:57:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:31,012 INFO L93 Difference]: Finished difference Result 1343 states and 2030 transitions. [2019-01-14 14:57:31,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:31,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-01-14 14:57:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:31,020 INFO L225 Difference]: With dead ends: 1343 [2019-01-14 14:57:31,020 INFO L226 Difference]: Without dead ends: 1341 [2019-01-14 14:57:31,020 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:31,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-01-14 14:57:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2019-01-14 14:57:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-01-14 14:57:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2026 transitions. [2019-01-14 14:57:31,065 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2026 transitions. Word has length 123 [2019-01-14 14:57:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:31,066 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2026 transitions. [2019-01-14 14:57:31,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2026 transitions. [2019-01-14 14:57:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-14 14:57:31,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:31,070 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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,070 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:31,072 INFO L82 PathProgramCache]: Analyzing trace with hash 601196500, now seen corresponding path program 1 times [2019-01-14 14:57:31,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:31,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:31,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-14 14:57:31,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:31,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:31,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:31,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:31,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:31,157 INFO L87 Difference]: Start difference. First operand 1339 states and 2026 transitions. Second operand 3 states. [2019-01-14 14:57:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:31,333 INFO L93 Difference]: Finished difference Result 3328 states and 5034 transitions. [2019-01-14 14:57:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:31,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-01-14 14:57:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:31,344 INFO L225 Difference]: With dead ends: 3328 [2019-01-14 14:57:31,344 INFO L226 Difference]: Without dead ends: 1996 [2019-01-14 14:57:31,347 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:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-01-14 14:57:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2019-01-14 14:57:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-01-14 14:57:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3012 transitions. [2019-01-14 14:57:31,414 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3012 transitions. Word has length 124 [2019-01-14 14:57:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:31,414 INFO L480 AbstractCegarLoop]: Abstraction has 1994 states and 3012 transitions. [2019-01-14 14:57:31,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3012 transitions. [2019-01-14 14:57:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-14 14:57:31,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:31,419 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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,419 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1540663978, now seen corresponding path program 1 times [2019-01-14 14:57:31,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:31,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:31,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-14 14:57:31,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:31,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:31,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:31,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:31,494 INFO L87 Difference]: Start difference. First operand 1994 states and 3012 transitions. Second operand 3 states. [2019-01-14 14:57:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:31,591 INFO L93 Difference]: Finished difference Result 4616 states and 6971 transitions. [2019-01-14 14:57:31,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:31,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-01-14 14:57:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:31,600 INFO L225 Difference]: With dead ends: 4616 [2019-01-14 14:57:31,600 INFO L226 Difference]: Without dead ends: 2629 [2019-01-14 14:57:31,603 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:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-01-14 14:57:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2019-01-14 14:57:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-01-14 14:57:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3961 transitions. [2019-01-14 14:57:31,677 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3961 transitions. Word has length 124 [2019-01-14 14:57:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:31,677 INFO L480 AbstractCegarLoop]: Abstraction has 2627 states and 3961 transitions. [2019-01-14 14:57:31,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3961 transitions. [2019-01-14 14:57:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-14 14:57:31,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:31,681 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2019-01-14 14:57:31,681 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:31,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:31,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1091794830, now seen corresponding path program 1 times [2019-01-14 14:57:31,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:31,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:31,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:31,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-14 14:57:31,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:31,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:31,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:31,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:31,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:31,752 INFO L87 Difference]: Start difference. First operand 2627 states and 3961 transitions. Second operand 3 states. [2019-01-14 14:57:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:32,646 INFO L93 Difference]: Finished difference Result 5375 states and 8098 transitions. [2019-01-14 14:57:32,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:32,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-01-14 14:57:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:32,656 INFO L225 Difference]: With dead ends: 5375 [2019-01-14 14:57:32,656 INFO L226 Difference]: Without dead ends: 2755 [2019-01-14 14:57:32,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:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-01-14 14:57:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-01-14 14:57:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-01-14 14:57:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4076 transitions. [2019-01-14 14:57:32,724 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4076 transitions. Word has length 132 [2019-01-14 14:57:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:32,724 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 4076 transitions. [2019-01-14 14:57:32,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4076 transitions. [2019-01-14 14:57:32,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-14 14:57:32,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:32,728 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2019-01-14 14:57:32,728 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:32,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:32,729 INFO L82 PathProgramCache]: Analyzing trace with hash -106917274, now seen corresponding path program 1 times [2019-01-14 14:57:32,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:32,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:32,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:32,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:32,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-14 14:57:32,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:32,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:57:32,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:32,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:32,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:32,795 INFO L87 Difference]: Start difference. First operand 2723 states and 4076 transitions. Second operand 3 states. [2019-01-14 14:57:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:33,023 INFO L93 Difference]: Finished difference Result 5471 states and 8181 transitions. [2019-01-14 14:57:33,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:33,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-01-14 14:57:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:33,032 INFO L225 Difference]: With dead ends: 5471 [2019-01-14 14:57:33,032 INFO L226 Difference]: Without dead ends: 2755 [2019-01-14 14:57:33,035 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:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-01-14 14:57:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-01-14 14:57:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-01-14 14:57:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4044 transitions. [2019-01-14 14:57:33,121 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4044 transitions. Word has length 133 [2019-01-14 14:57:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:33,122 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 4044 transitions. [2019-01-14 14:57:33,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4044 transitions. [2019-01-14 14:57:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-14 14:57:33,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:33,125 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:33,125 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2091342634, now seen corresponding path program 1 times [2019-01-14 14:57:33,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:33,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:33,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:33,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-14 14:57:33,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:33,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:33,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:33,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:33,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:33,212 INFO L87 Difference]: Start difference. First operand 2723 states and 4044 transitions. Second operand 3 states. [2019-01-14 14:57:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:33,812 INFO L93 Difference]: Finished difference Result 5521 states and 8174 transitions. [2019-01-14 14:57:33,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:33,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-01-14 14:57:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:33,822 INFO L225 Difference]: With dead ends: 5521 [2019-01-14 14:57:33,822 INFO L226 Difference]: Without dead ends: 2805 [2019-01-14 14:57:33,825 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:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-01-14 14:57:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2723. [2019-01-14 14:57:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-01-14 14:57:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3956 transitions. [2019-01-14 14:57:33,884 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3956 transitions. Word has length 163 [2019-01-14 14:57:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:33,884 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 3956 transitions. [2019-01-14 14:57:33,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3956 transitions. [2019-01-14 14:57:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-14 14:57:33,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:33,886 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:33,887 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1144304748, now seen corresponding path program 1 times [2019-01-14 14:57:33,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:33,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:33,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-14 14:57:33,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:33,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:33,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:33,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:33,958 INFO L87 Difference]: Start difference. First operand 2723 states and 3956 transitions. Second operand 3 states. [2019-01-14 14:57:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:34,232 INFO L93 Difference]: Finished difference Result 5711 states and 8273 transitions. [2019-01-14 14:57:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:34,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-01-14 14:57:34,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:34,245 INFO L225 Difference]: With dead ends: 5711 [2019-01-14 14:57:34,246 INFO L226 Difference]: Without dead ends: 2995 [2019-01-14 14:57:34,249 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:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-01-14 14:57:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2839. [2019-01-14 14:57:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-01-14 14:57:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4044 transitions. [2019-01-14 14:57:34,315 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4044 transitions. Word has length 163 [2019-01-14 14:57:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:34,315 INFO L480 AbstractCegarLoop]: Abstraction has 2839 states and 4044 transitions. [2019-01-14 14:57:34,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4044 transitions. [2019-01-14 14:57:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-14 14:57:34,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:34,318 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:34,318 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:34,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1925800112, now seen corresponding path program 1 times [2019-01-14 14:57:34,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:34,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:34,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:34,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-01-14 14:57:34,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:57:34,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:57:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:34,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:57:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-01-14 14:57:34,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:57:34,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:57:34,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:57:34,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:57:34,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:57:34,855 INFO L87 Difference]: Start difference. First operand 2839 states and 4044 transitions. Second operand 5 states. [2019-01-14 14:57:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:39,462 INFO L93 Difference]: Finished difference Result 11986 states and 16865 transitions. [2019-01-14 14:57:39,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 14:57:39,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-01-14 14:57:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:39,500 INFO L225 Difference]: With dead ends: 11986 [2019-01-14 14:57:39,500 INFO L226 Difference]: Without dead ends: 8938 [2019-01-14 14:57:39,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 14:57:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8938 states. [2019-01-14 14:57:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8938 to 6258. [2019-01-14 14:57:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6258 states. [2019-01-14 14:57:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6258 states to 6258 states and 8817 transitions. [2019-01-14 14:57:39,837 INFO L78 Accepts]: Start accepts. Automaton has 6258 states and 8817 transitions. Word has length 171 [2019-01-14 14:57:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:39,837 INFO L480 AbstractCegarLoop]: Abstraction has 6258 states and 8817 transitions. [2019-01-14 14:57:39,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:57:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6258 states and 8817 transitions. [2019-01-14 14:57:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-14 14:57:39,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:39,847 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:39,848 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:39,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash 869103292, now seen corresponding path program 1 times [2019-01-14 14:57:39,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:39,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:39,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 133 proven. 11 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-01-14 14:57:40,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:57:40,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:57:40,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:40,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:57:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-01-14 14:57:40,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:57:40,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:57:40,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:57:40,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:57:40,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:57:40,284 INFO L87 Difference]: Start difference. First operand 6258 states and 8817 transitions. Second operand 5 states. [2019-01-14 14:57:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:42,159 INFO L93 Difference]: Finished difference Result 17788 states and 24955 transitions. [2019-01-14 14:57:42,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 14:57:42,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-01-14 14:57:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:42,178 INFO L225 Difference]: With dead ends: 17788 [2019-01-14 14:57:42,179 INFO L226 Difference]: Without dead ends: 11138 [2019-01-14 14:57:42,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 14:57:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-01-14 14:57:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 7362. [2019-01-14 14:57:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7362 states. [2019-01-14 14:57:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7362 states to 7362 states and 10073 transitions. [2019-01-14 14:57:42,519 INFO L78 Accepts]: Start accepts. Automaton has 7362 states and 10073 transitions. Word has length 178 [2019-01-14 14:57:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:42,519 INFO L480 AbstractCegarLoop]: Abstraction has 7362 states and 10073 transitions. [2019-01-14 14:57:42,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:57:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 7362 states and 10073 transitions. [2019-01-14 14:57:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-01-14 14:57:42,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:42,529 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:42,529 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash 984815525, now seen corresponding path program 1 times [2019-01-14 14:57:42,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:42,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:42,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:42,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:42,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 113 proven. 6 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-01-14 14:57:42,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 14:57:42,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 14:57:42,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:42,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 14:57:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-01-14 14:57:42,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 14:57:42,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-14 14:57:42,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 14:57:42,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 14:57:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 14:57:42,951 INFO L87 Difference]: Start difference. First operand 7362 states and 10073 transitions. Second operand 5 states. [2019-01-14 14:57:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:43,695 INFO L93 Difference]: Finished difference Result 14947 states and 20105 transitions. [2019-01-14 14:57:43,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 14:57:43,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-01-14 14:57:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:43,717 INFO L225 Difference]: With dead ends: 14947 [2019-01-14 14:57:43,718 INFO L226 Difference]: Without dead ends: 7243 [2019-01-14 14:57:43,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 14:57:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7243 states. [2019-01-14 14:57:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7243 to 4921. [2019-01-14 14:57:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4921 states. [2019-01-14 14:57:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4921 states to 4921 states and 6642 transitions. [2019-01-14 14:57:43,968 INFO L78 Accepts]: Start accepts. Automaton has 4921 states and 6642 transitions. Word has length 179 [2019-01-14 14:57:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:43,969 INFO L480 AbstractCegarLoop]: Abstraction has 4921 states and 6642 transitions. [2019-01-14 14:57:43,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 14:57:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4921 states and 6642 transitions. [2019-01-14 14:57:43,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-14 14:57:43,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:43,975 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:43,976 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:43,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:43,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1086543804, now seen corresponding path program 1 times [2019-01-14 14:57:43,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:43,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:43,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:43,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:57:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-14 14:57:44,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:57:44,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:57:44,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:57:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:57:44,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:57:44,152 INFO L87 Difference]: Start difference. First operand 4921 states and 6642 transitions. Second operand 3 states. [2019-01-14 14:57:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:57:44,559 INFO L93 Difference]: Finished difference Result 11224 states and 15019 transitions. [2019-01-14 14:57:44,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:57:44,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-01-14 14:57:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:57:44,574 INFO L225 Difference]: With dead ends: 11224 [2019-01-14 14:57:44,575 INFO L226 Difference]: Without dead ends: 6377 [2019-01-14 14:57:44,581 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:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6377 states. [2019-01-14 14:57:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6377 to 5416. [2019-01-14 14:57:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5416 states. [2019-01-14 14:57:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5416 states to 5416 states and 7280 transitions. [2019-01-14 14:57:44,901 INFO L78 Accepts]: Start accepts. Automaton has 5416 states and 7280 transitions. Word has length 182 [2019-01-14 14:57:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:57:44,901 INFO L480 AbstractCegarLoop]: Abstraction has 5416 states and 7280 transitions. [2019-01-14 14:57:44,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:57:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5416 states and 7280 transitions. [2019-01-14 14:57:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-14 14:57:44,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:57:44,911 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:57:44,912 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:57:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:57:44,912 INFO L82 PathProgramCache]: Analyzing trace with hash 941780496, now seen corresponding path program 1 times [2019-01-14 14:57:44,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:57:44,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:57:44,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:44,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:57:44,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:57:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 14:57:45,099 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 14:57:45,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:57:45 BoogieIcfgContainer [2019-01-14 14:57:45,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:57:45,206 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:57:45,206 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:57:45,206 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:57:45,208 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:16" (3/4) ... [2019-01-14 14:57:45,212 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 14:57:45,409 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:57:45,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:57:45,414 INFO L168 Benchmark]: Toolchain (without parser) took 30351.63 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 500.2 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -204.4 MB). Peak memory consumption was 295.8 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:45,416 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:45,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.37 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:45,416 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:45,418 INFO L168 Benchmark]: Boogie Preprocessor took 39.34 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:45,419 INFO L168 Benchmark]: RCFGBuilder took 1222.84 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: 60.3 MB). Peak memory consumption was 60.3 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:45,419 INFO L168 Benchmark]: TraceAbstraction took 28257.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 374.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -116.6 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:45,419 INFO L168 Benchmark]: Witness Printer took 203.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 14:57:45,424 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 477.37 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 142.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.34 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 1222.84 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: 60.3 MB). Peak memory consumption was 60.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28257.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 374.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -116.6 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. * Witness Printer took 203.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 631]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L636] int s ; [L637] int tmp ; [L641] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 ; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength ; [L42] int s__session__cipher ; [L43] int buf ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 = __VERIFIER_nondet_int() ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND TRUE tmp___1 + 12288 [L91] COND TRUE tmp___2 + 16384 [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L294] COND FALSE !(ret <= 0) [L297] COND FALSE !(\read(s__hit)) [L300] s__state = 8512 [L302] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L307] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L308] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L309] COND TRUE __cil_tmp56 + 256UL [L310] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L360] ret = __VERIFIER_nondet_int() [L361] COND FALSE !(ret <= 0) [L378] s__state = 8544 [L379] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L383] COND TRUE s__verify_mode + 1 [L384] COND FALSE !(s__session__peer != 0) [L395] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L396] __cil_tmp61 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L397] COND FALSE !(__cil_tmp61 + 256UL) [L407] s__s3__tmp__cert_request = 1 [L408] ret = __VERIFIER_nondet_int() [L409] COND FALSE !(ret <= 0) [L412] s__state = 8448 [L413] s__s3__tmp__next_state___0 = 8576 [L414] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND TRUE s__state == 8448 [L435] COND FALSE !(num1 > 0L) [L444] s__state = s__s3__tmp__next_state___0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND TRUE s__state == 8576 [L448] ret = __VERIFIER_nondet_int() [L449] COND FALSE !(ret <= 0) [L452] COND FALSE !(ret == 2) [L455] ret = __VERIFIER_nondet_int() [L456] COND FALSE !(ret <= 0) [L459] s__init_num = 0 [L460] s__state = 8592 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND TRUE state == 8576 [L604] COND TRUE s__state == 8592 [L605] COND TRUE tmp___1 != -12288 [L606] COND TRUE tmp___2 != -16384 [L607] COND TRUE __cil_tmp56 != 4294967040 [L608] COND TRUE __cil_tmp58 != 4294967294 [L609] COND TRUE tmp___7 != 1024 [L610] COND TRUE tmp___7 != 512 [L631] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. UNSAFE Result, 28.1s OverallTime, 34 OverallIterations, 7 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6144 SDtfs, 6105 SDslu, 3367 SDs, 0 SdLazy, 3784 SolverSat, 1251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7362occurred in iteration=31, 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: 2.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 10246 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3803 NumberOfCodeBlocks, 3803 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3576 ConstructedInterpolants, 0 QuantifiedInterpolants, 810181 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1020 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 36 InterpolantComputations, 33 PerfectInterpolantSequences, 3606/3634 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...