./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector/s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.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/bitvector/s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.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 6e01bd719f7d1aae569b8a22e5c701b53d00d960 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:16:39,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:16:39,232 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:16:39,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:16:39,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:16:39,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:16:39,247 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:16:39,249 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:16:39,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:16:39,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:16:39,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:16:39,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:16:39,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:16:39,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:16:39,257 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:16:39,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:16:39,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:16:39,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:16:39,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:16:39,264 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:16:39,265 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:16:39,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:16:39,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:16:39,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:16:39,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:16:39,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:16:39,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:16:39,272 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:16:39,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:16:39,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:16:39,278 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:16:39,279 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:16:39,279 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:16:39,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:16:39,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:16:39,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:16:39,285 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:16:39,312 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:16:39,313 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:16:39,314 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:16:39,314 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:16:39,315 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:16:39,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:16:39,316 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:16:39,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:16:39,316 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:16:39,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:16:39,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:16:39,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:16:39,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:16:39,317 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:16:39,317 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:16:39,318 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:16:39,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:16:39,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:16:39,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:16:39,321 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:16:39,321 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:16:39,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:16:39,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:16:39,322 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:16:39,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:16:39,323 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:16:39,323 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:16:39,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:16:39,323 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 -> 6e01bd719f7d1aae569b8a22e5c701b53d00d960 [2019-01-11 21:16:39,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:16:39,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:16:39,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:16:39,397 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:16:39,398 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:16:39,398 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:16:39,456 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489951cb1/7bf516a7cc11472386102ce601b6ed20/FLAGcefb95551 [2019-01-11 21:16:39,905 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:16:39,906 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:16:39,925 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489951cb1/7bf516a7cc11472386102ce601b6ed20/FLAGcefb95551 [2019-01-11 21:16:40,187 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489951cb1/7bf516a7cc11472386102ce601b6ed20 [2019-01-11 21:16:40,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:16:40,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:16:40,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:16:40,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:16:40,198 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:16:40,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4d32c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40, skipping insertion in model container [2019-01-11 21:16:40,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:16:40,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:16:40,586 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:16:40,591 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:16:40,701 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:16:40,716 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:16:40,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40 WrapperNode [2019-01-11 21:16:40,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:16:40,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:16:40,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:16:40,718 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:16:40,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:16:40,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:16:40,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:16:40,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:16:40,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... [2019-01-11 21:16:40,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:16:40,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:16:40,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:16:40,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:16:40,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:16:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:16:40,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:16:41,106 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-11 21:16:42,324 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-01-11 21:16:42,325 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-01-11 21:16:42,326 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:16:42,326 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-11 21:16:42,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:42 BoogieIcfgContainer [2019-01-11 21:16:42,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:16:42,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:16:42,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:16:42,331 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:16:42,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:16:40" (1/3) ... [2019-01-11 21:16:42,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d84a101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:16:42, skipping insertion in model container [2019-01-11 21:16:42,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:16:40" (2/3) ... [2019-01-11 21:16:42,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d84a101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:16:42, skipping insertion in model container [2019-01-11 21:16:42,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:42" (3/3) ... [2019-01-11 21:16:42,335 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt_true-unreach-call_true-no-overflow.BV.c.cil.c [2019-01-11 21:16:42,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:16:42,352 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:16:42,369 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:16:42,400 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:16:42,401 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:16:42,401 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:16:42,401 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:16:42,401 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:16:42,402 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:16:42,402 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:16:42,402 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:16:42,402 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:16:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-01-11 21:16:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-11 21:16:42,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:42,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:42,433 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:42,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -91608764, now seen corresponding path program 1 times [2019-01-11 21:16:42,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:42,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:42,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:42,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:42,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:42,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:42,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:42,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:42,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:42,759 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-01-11 21:16:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:43,333 INFO L93 Difference]: Finished difference Result 322 states and 558 transitions. [2019-01-11 21:16:43,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:43,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-01-11 21:16:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:43,350 INFO L225 Difference]: With dead ends: 322 [2019-01-11 21:16:43,350 INFO L226 Difference]: Without dead ends: 170 [2019-01-11 21:16:43,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-11 21:16:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-01-11 21:16:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-11 21:16:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 270 transitions. [2019-01-11 21:16:43,443 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 270 transitions. Word has length 43 [2019-01-11 21:16:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:43,444 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 270 transitions. [2019-01-11 21:16:43,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 270 transitions. [2019-01-11 21:16:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 21:16:43,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:43,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:43,451 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:43,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1448030283, now seen corresponding path program 1 times [2019-01-11 21:16:43,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:43,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:43,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:43,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:43,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:43,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:43,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:43,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:43,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:43,650 INFO L87 Difference]: Start difference. First operand 165 states and 270 transitions. Second operand 3 states. [2019-01-11 21:16:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:44,344 INFO L93 Difference]: Finished difference Result 371 states and 615 transitions. [2019-01-11 21:16:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:44,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-11 21:16:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:44,348 INFO L225 Difference]: With dead ends: 371 [2019-01-11 21:16:44,348 INFO L226 Difference]: Without dead ends: 211 [2019-01-11 21:16:44,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-11 21:16:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-01-11 21:16:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-11 21:16:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 347 transitions. [2019-01-11 21:16:44,373 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 347 transitions. Word has length 44 [2019-01-11 21:16:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:44,374 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 347 transitions. [2019-01-11 21:16:44,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:44,374 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 347 transitions. [2019-01-11 21:16:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 21:16:44,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:44,377 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:44,378 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1359791455, now seen corresponding path program 1 times [2019-01-11 21:16:44,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:44,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:44,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:44,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:44,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:44,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:44,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:44,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:44,469 INFO L87 Difference]: Start difference. First operand 206 states and 347 transitions. Second operand 3 states. [2019-01-11 21:16:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:44,937 INFO L93 Difference]: Finished difference Result 436 states and 741 transitions. [2019-01-11 21:16:44,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:44,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-01-11 21:16:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:44,944 INFO L225 Difference]: With dead ends: 436 [2019-01-11 21:16:44,944 INFO L226 Difference]: Without dead ends: 237 [2019-01-11 21:16:44,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-11 21:16:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-01-11 21:16:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-11 21:16:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 403 transitions. [2019-01-11 21:16:44,987 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 403 transitions. Word has length 71 [2019-01-11 21:16:44,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:44,988 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 403 transitions. [2019-01-11 21:16:44,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:44,988 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 403 transitions. [2019-01-11 21:16:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:16:44,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:44,997 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:44,997 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1343129333, now seen corresponding path program 1 times [2019-01-11 21:16:44,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:44,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:44,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:44,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:45,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:45,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:45,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:45,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:45,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:45,086 INFO L87 Difference]: Start difference. First operand 237 states and 403 transitions. Second operand 3 states. [2019-01-11 21:16:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:45,418 INFO L93 Difference]: Finished difference Result 484 states and 823 transitions. [2019-01-11 21:16:45,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:45,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:16:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:45,422 INFO L225 Difference]: With dead ends: 484 [2019-01-11 21:16:45,422 INFO L226 Difference]: Without dead ends: 254 [2019-01-11 21:16:45,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-11 21:16:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2019-01-11 21:16:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-11 21:16:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 426 transitions. [2019-01-11 21:16:45,440 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 426 transitions. Word has length 83 [2019-01-11 21:16:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:45,440 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 426 transitions. [2019-01-11 21:16:45,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 426 transitions. [2019-01-11 21:16:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 21:16:45,442 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:45,442 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:45,443 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2058793378, now seen corresponding path program 1 times [2019-01-11 21:16:45,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:45,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:45,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:45,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:45,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:45,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:45,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:45,549 INFO L87 Difference]: Start difference. First operand 252 states and 426 transitions. Second operand 3 states. [2019-01-11 21:16:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:45,847 INFO L93 Difference]: Finished difference Result 543 states and 922 transitions. [2019-01-11 21:16:45,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:45,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-01-11 21:16:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:45,851 INFO L225 Difference]: With dead ends: 543 [2019-01-11 21:16:45,851 INFO L226 Difference]: Without dead ends: 298 [2019-01-11 21:16:45,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-11 21:16:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 294. [2019-01-11 21:16:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-11 21:16:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-01-11 21:16:45,869 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-01-11 21:16:45,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:45,869 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-01-11 21:16:45,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-01-11 21:16:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:16:45,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:45,871 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:45,872 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:45,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1582529535, now seen corresponding path program 1 times [2019-01-11 21:16:45,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:45,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:45,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:45,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:45,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:45,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:45,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:45,941 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 3 states. [2019-01-11 21:16:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:46,548 INFO L93 Difference]: Finished difference Result 583 states and 991 transitions. [2019-01-11 21:16:46,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:46,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:16:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:46,551 INFO L225 Difference]: With dead ends: 583 [2019-01-11 21:16:46,551 INFO L226 Difference]: Without dead ends: 296 [2019-01-11 21:16:46,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-01-11 21:16:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2019-01-11 21:16:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-11 21:16:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 496 transitions. [2019-01-11 21:16:46,563 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 496 transitions. Word has length 84 [2019-01-11 21:16:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:46,564 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 496 transitions. [2019-01-11 21:16:46,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 496 transitions. [2019-01-11 21:16:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 21:16:46,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:46,565 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:46,566 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:46,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1574610693, now seen corresponding path program 1 times [2019-01-11 21:16:46,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:46,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:16:46,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:46,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:46,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:46,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:46,667 INFO L87 Difference]: Start difference. First operand 294 states and 496 transitions. Second operand 3 states. [2019-01-11 21:16:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:47,732 INFO L93 Difference]: Finished difference Result 585 states and 986 transitions. [2019-01-11 21:16:47,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:47,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-01-11 21:16:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:47,736 INFO L225 Difference]: With dead ends: 585 [2019-01-11 21:16:47,736 INFO L226 Difference]: Without dead ends: 296 [2019-01-11 21:16:47,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-01-11 21:16:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-01-11 21:16:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-11 21:16:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 491 transitions. [2019-01-11 21:16:47,748 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 491 transitions. Word has length 84 [2019-01-11 21:16:47,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:47,749 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 491 transitions. [2019-01-11 21:16:47,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 491 transitions. [2019-01-11 21:16:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 21:16:47,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:47,752 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:47,753 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:47,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:47,753 INFO L82 PathProgramCache]: Analyzing trace with hash -544543676, now seen corresponding path program 1 times [2019-01-11 21:16:47,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:47,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:47,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:47,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:47,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-11 21:16:47,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:47,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:47,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:47,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:47,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:47,868 INFO L87 Difference]: Start difference. First operand 292 states and 491 transitions. Second operand 3 states. [2019-01-11 21:16:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:48,319 INFO L93 Difference]: Finished difference Result 585 states and 982 transitions. [2019-01-11 21:16:48,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:48,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-11 21:16:48,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:48,323 INFO L225 Difference]: With dead ends: 585 [2019-01-11 21:16:48,323 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 21:16:48,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 21:16:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-01-11 21:16:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-11 21:16:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 496 transitions. [2019-01-11 21:16:48,338 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 496 transitions. Word has length 95 [2019-01-11 21:16:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:48,338 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 496 transitions. [2019-01-11 21:16:48,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 496 transitions. [2019-01-11 21:16:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 21:16:48,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:48,342 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:48,342 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:48,343 INFO L82 PathProgramCache]: Analyzing trace with hash -394257992, now seen corresponding path program 1 times [2019-01-11 21:16:48,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:48,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:48,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:48,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:48,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:48,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:48,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:48,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:48,441 INFO L87 Difference]: Start difference. First operand 300 states and 496 transitions. Second operand 3 states. [2019-01-11 21:16:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:49,008 INFO L93 Difference]: Finished difference Result 624 states and 1034 transitions. [2019-01-11 21:16:49,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:49,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-11 21:16:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:49,012 INFO L225 Difference]: With dead ends: 624 [2019-01-11 21:16:49,013 INFO L226 Difference]: Without dead ends: 331 [2019-01-11 21:16:49,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-01-11 21:16:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2019-01-11 21:16:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 21:16:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2019-01-11 21:16:49,025 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 97 [2019-01-11 21:16:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:49,026 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2019-01-11 21:16:49,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2019-01-11 21:16:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 21:16:49,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:49,027 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:49,028 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:49,028 INFO L82 PathProgramCache]: Analyzing trace with hash -580298112, now seen corresponding path program 1 times [2019-01-11 21:16:49,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:49,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:49,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:49,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:49,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:49,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:49,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:49,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:49,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:49,105 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand 3 states. [2019-01-11 21:16:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:49,444 INFO L93 Difference]: Finished difference Result 685 states and 1134 transitions. [2019-01-11 21:16:49,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:49,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-11 21:16:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:49,447 INFO L225 Difference]: With dead ends: 685 [2019-01-11 21:16:49,447 INFO L226 Difference]: Without dead ends: 363 [2019-01-11 21:16:49,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-11 21:16:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-01-11 21:16:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 21:16:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 585 transitions. [2019-01-11 21:16:49,460 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 585 transitions. Word has length 98 [2019-01-11 21:16:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:49,461 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 585 transitions. [2019-01-11 21:16:49,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 585 transitions. [2019-01-11 21:16:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 21:16:49,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:49,463 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:49,463 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1428014628, now seen corresponding path program 1 times [2019-01-11 21:16:49,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:49,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:49,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:49,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:49,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:49,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:49,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:49,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:49,537 INFO L87 Difference]: Start difference. First operand 356 states and 585 transitions. Second operand 3 states. [2019-01-11 21:16:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:50,442 INFO L93 Difference]: Finished difference Result 707 states and 1161 transitions. [2019-01-11 21:16:50,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:50,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-01-11 21:16:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:50,445 INFO L225 Difference]: With dead ends: 707 [2019-01-11 21:16:50,445 INFO L226 Difference]: Without dead ends: 358 [2019-01-11 21:16:50,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-11 21:16:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-01-11 21:16:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 21:16:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 581 transitions. [2019-01-11 21:16:50,458 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 581 transitions. Word has length 98 [2019-01-11 21:16:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:50,458 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 581 transitions. [2019-01-11 21:16:50,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 581 transitions. [2019-01-11 21:16:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-11 21:16:50,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:50,460 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:50,460 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:50,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1781518284, now seen corresponding path program 1 times [2019-01-11 21:16:50,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:50,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:50,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:50,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:50,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-11 21:16:50,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:50,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:50,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:50,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:50,542 INFO L87 Difference]: Start difference. First operand 356 states and 581 transitions. Second operand 3 states. [2019-01-11 21:16:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:50,970 INFO L93 Difference]: Finished difference Result 712 states and 1163 transitions. [2019-01-11 21:16:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:50,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-01-11 21:16:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:50,973 INFO L225 Difference]: With dead ends: 712 [2019-01-11 21:16:50,973 INFO L226 Difference]: Without dead ends: 363 [2019-01-11 21:16:50,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-11 21:16:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2019-01-11 21:16:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 21:16:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 576 transitions. [2019-01-11 21:16:50,989 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 576 transitions. Word has length 99 [2019-01-11 21:16:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:50,989 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 576 transitions. [2019-01-11 21:16:50,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 576 transitions. [2019-01-11 21:16:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 21:16:50,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:50,991 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:50,991 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2059318320, now seen corresponding path program 1 times [2019-01-11 21:16:50,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:50,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:50,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:16:51,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:51,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:51,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:51,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:51,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:51,069 INFO L87 Difference]: Start difference. First operand 356 states and 576 transitions. Second operand 3 states. [2019-01-11 21:16:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:51,862 INFO L93 Difference]: Finished difference Result 730 states and 1182 transitions. [2019-01-11 21:16:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:51,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-01-11 21:16:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:51,868 INFO L225 Difference]: With dead ends: 730 [2019-01-11 21:16:51,868 INFO L226 Difference]: Without dead ends: 381 [2019-01-11 21:16:51,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-01-11 21:16:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-01-11 21:16:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-11 21:16:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 605 transitions. [2019-01-11 21:16:51,890 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 605 transitions. Word has length 104 [2019-01-11 21:16:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:51,891 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 605 transitions. [2019-01-11 21:16:51,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 605 transitions. [2019-01-11 21:16:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 21:16:51,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:51,896 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:51,897 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:51,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1279717276, now seen corresponding path program 1 times [2019-01-11 21:16:51,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:51,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:51,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:51,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:51,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:16:52,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:52,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:52,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:52,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:52,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:52,021 INFO L87 Difference]: Start difference. First operand 377 states and 605 transitions. Second operand 3 states. [2019-01-11 21:16:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:52,969 INFO L93 Difference]: Finished difference Result 751 states and 1205 transitions. [2019-01-11 21:16:52,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:52,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-01-11 21:16:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:52,974 INFO L225 Difference]: With dead ends: 751 [2019-01-11 21:16:52,974 INFO L226 Difference]: Without dead ends: 381 [2019-01-11 21:16:52,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-01-11 21:16:52,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-01-11 21:16:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-11 21:16:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 599 transitions. [2019-01-11 21:16:52,987 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 599 transitions. Word has length 105 [2019-01-11 21:16:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:52,987 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 599 transitions. [2019-01-11 21:16:52,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 599 transitions. [2019-01-11 21:16:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 21:16:52,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:52,989 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:52,989 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2114985745, now seen corresponding path program 1 times [2019-01-11 21:16:52,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:52,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:52,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-11 21:16:53,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:53,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:53,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:53,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:53,120 INFO L87 Difference]: Start difference. First operand 377 states and 599 transitions. Second operand 3 states. [2019-01-11 21:16:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:53,303 INFO L93 Difference]: Finished difference Result 747 states and 1187 transitions. [2019-01-11 21:16:53,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:53,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-11 21:16:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:53,307 INFO L225 Difference]: With dead ends: 747 [2019-01-11 21:16:53,307 INFO L226 Difference]: Without dead ends: 745 [2019-01-11 21:16:53,308 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-11 21:16:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-01-11 21:16:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2019-01-11 21:16:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-01-11 21:16:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1185 transitions. [2019-01-11 21:16:53,331 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1185 transitions. Word has length 120 [2019-01-11 21:16:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:53,331 INFO L480 AbstractCegarLoop]: Abstraction has 745 states and 1185 transitions. [2019-01-11 21:16:53,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1185 transitions. [2019-01-11 21:16:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 21:16:53,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:53,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:53,334 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:53,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:53,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1757690989, now seen corresponding path program 1 times [2019-01-11 21:16:53,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:53,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:53,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:53,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:53,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:53,343 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:53,343 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:53,343 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:53,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:53,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:16:53,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:53,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 21:16:53,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:53,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:53,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:53,562 INFO L87 Difference]: Start difference. First operand 745 states and 1185 transitions. Second operand 3 states. [2019-01-11 21:16:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:53,844 INFO L93 Difference]: Finished difference Result 1851 states and 2945 transitions. [2019-01-11 21:16:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:53,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-11 21:16:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:53,850 INFO L225 Difference]: With dead ends: 1851 [2019-01-11 21:16:53,850 INFO L226 Difference]: Without dead ends: 1113 [2019-01-11 21:16:53,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-01-11 21:16:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2019-01-11 21:16:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-01-11 21:16:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1768 transitions. [2019-01-11 21:16:53,893 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1768 transitions. Word has length 121 [2019-01-11 21:16:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:53,893 INFO L480 AbstractCegarLoop]: Abstraction has 1113 states and 1768 transitions. [2019-01-11 21:16:53,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1768 transitions. [2019-01-11 21:16:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-11 21:16:53,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:53,897 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:53,897 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1944046772, now seen corresponding path program 1 times [2019-01-11 21:16:53,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:53,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:53,909 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:53,909 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:53,909 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:53,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:53,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-11 21:16:54,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:54,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:54,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:54,092 INFO L87 Difference]: Start difference. First operand 1113 states and 1768 transitions. Second operand 3 states. [2019-01-11 21:16:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:54,391 INFO L93 Difference]: Finished difference Result 2219 states and 3528 transitions. [2019-01-11 21:16:54,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:54,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-01-11 21:16:54,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:54,402 INFO L225 Difference]: With dead ends: 2219 [2019-01-11 21:16:54,402 INFO L226 Difference]: Without dead ends: 1481 [2019-01-11 21:16:54,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2019-01-11 21:16:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2019-01-11 21:16:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-01-11 21:16:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2352 transitions. [2019-01-11 21:16:54,461 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2352 transitions. Word has length 137 [2019-01-11 21:16:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:54,461 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2352 transitions. [2019-01-11 21:16:54,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2352 transitions. [2019-01-11 21:16:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-11 21:16:54,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:54,468 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:54,468 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1334074210, now seen corresponding path program 1 times [2019-01-11 21:16:54,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:54,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:54,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:54,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:54,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-01-11 21:16:54,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:54,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:54,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:54,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:54,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:54,560 INFO L87 Difference]: Start difference. First operand 1481 states and 2352 transitions. Second operand 3 states. [2019-01-11 21:16:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:56,057 INFO L93 Difference]: Finished difference Result 3059 states and 4857 transitions. [2019-01-11 21:16:56,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:56,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-01-11 21:16:56,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:56,067 INFO L225 Difference]: With dead ends: 3059 [2019-01-11 21:16:56,067 INFO L226 Difference]: Without dead ends: 1585 [2019-01-11 21:16:56,070 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-11 21:16:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-01-11 21:16:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1573. [2019-01-11 21:16:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-01-11 21:16:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2464 transitions. [2019-01-11 21:16:56,143 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2464 transitions. Word has length 158 [2019-01-11 21:16:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:56,144 INFO L480 AbstractCegarLoop]: Abstraction has 1573 states and 2464 transitions. [2019-01-11 21:16:56,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2464 transitions. [2019-01-11 21:16:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-11 21:16:56,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:56,150 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-11 21:16:56,150 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash -241439008, now seen corresponding path program 1 times [2019-01-11 21:16:56,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:56,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:56,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:56,166 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:56,166 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:56,166 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:56,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:56,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-01-11 21:16:56,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:56,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:56,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:56,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:56,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:56,389 INFO L87 Difference]: Start difference. First operand 1573 states and 2464 transitions. Second operand 3 states. [2019-01-11 21:16:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:56,725 INFO L93 Difference]: Finished difference Result 3139 states and 4920 transitions. [2019-01-11 21:16:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:56,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-01-11 21:16:56,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:56,741 INFO L225 Difference]: With dead ends: 3139 [2019-01-11 21:16:56,742 INFO L226 Difference]: Without dead ends: 1964 [2019-01-11 21:16:56,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-11 21:16:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-11 21:16:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-11 21:16:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 3077 transitions. [2019-01-11 21:16:56,889 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 3077 transitions. Word has length 158 [2019-01-11 21:16:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:56,890 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 3077 transitions. [2019-01-11 21:16:56,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 3077 transitions. [2019-01-11 21:16:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-11 21:16:56,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:56,899 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:16:56,899 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash 332308346, now seen corresponding path program 1 times [2019-01-11 21:16:56,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:56,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:56,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:56,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:56,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:56,924 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:56,925 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:56,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:56,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:57,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-11 21:16:57,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:57,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:57,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:57,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:57,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:57,173 INFO L87 Difference]: Start difference. First operand 1964 states and 3077 transitions. Second operand 3 states. [2019-01-11 21:16:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:57,418 INFO L93 Difference]: Finished difference Result 5743 states and 9049 transitions. [2019-01-11 21:16:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:57,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-01-11 21:16:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:57,439 INFO L225 Difference]: With dead ends: 5743 [2019-01-11 21:16:57,439 INFO L226 Difference]: Without dead ends: 3786 [2019-01-11 21:16:57,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-01-11 21:16:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-01-11 21:16:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-01-11 21:16:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5967 transitions. [2019-01-11 21:16:57,590 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5967 transitions. Word has length 198 [2019-01-11 21:16:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:57,591 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5967 transitions. [2019-01-11 21:16:57,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5967 transitions. [2019-01-11 21:16:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-11 21:16:57,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:57,605 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-11 21:16:57,605 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:57,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1226220023, now seen corresponding path program 1 times [2019-01-11 21:16:57,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:57,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:57,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:57,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:57,623 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:16:57,623 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:16:57,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:16:57,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:57,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:16:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-01-11 21:16:57,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:57,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:57,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:57,818 INFO L87 Difference]: Start difference. First operand 3784 states and 5967 transitions. Second operand 3 states. [2019-01-11 21:16:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:58,900 INFO L93 Difference]: Finished difference Result 7651 states and 12033 transitions. [2019-01-11 21:16:58,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:58,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-01-11 21:16:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:58,918 INFO L225 Difference]: With dead ends: 7651 [2019-01-11 21:16:58,918 INFO L226 Difference]: Without dead ends: 3874 [2019-01-11 21:16:58,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-01-11 21:16:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3784. [2019-01-11 21:16:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-01-11 21:16:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5787 transitions. [2019-01-11 21:16:59,035 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5787 transitions. Word has length 235 [2019-01-11 21:16:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:16:59,036 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5787 transitions. [2019-01-11 21:16:59,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:16:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5787 transitions. [2019-01-11 21:16:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-01-11 21:16:59,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:16:59,047 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-11 21:16:59,047 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:16:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:16:59,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1255317410, now seen corresponding path program 1 times [2019-01-11 21:16:59,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:16:59,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:16:59,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:59,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:16:59,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:16:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:16:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-01-11 21:16:59,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:16:59,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:16:59,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:16:59,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:16:59,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:16:59,186 INFO L87 Difference]: Start difference. First operand 3784 states and 5787 transitions. Second operand 3 states. [2019-01-11 21:16:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:16:59,929 INFO L93 Difference]: Finished difference Result 7683 states and 11706 transitions. [2019-01-11 21:16:59,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:16:59,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-01-11 21:16:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:16:59,946 INFO L225 Difference]: With dead ends: 7683 [2019-01-11 21:16:59,946 INFO L226 Difference]: Without dead ends: 3906 [2019-01-11 21:16:59,952 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-11 21:16:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-01-11 21:17:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3784. [2019-01-11 21:17:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-01-11 21:17:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5627 transitions. [2019-01-11 21:17:00,065 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5627 transitions. Word has length 248 [2019-01-11 21:17:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:00,066 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5627 transitions. [2019-01-11 21:17:00,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5627 transitions. [2019-01-11 21:17:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-01-11 21:17:00,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:00,081 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:00,081 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:00,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1963060854, now seen corresponding path program 1 times [2019-01-11 21:17:00,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:00,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:00,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:00,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,098 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:17:00,098 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:17:00,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:17:00,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:00,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-01-11 21:17:00,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:00,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:00,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:00,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:00,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:00,234 INFO L87 Difference]: Start difference. First operand 3784 states and 5627 transitions. Second operand 3 states. [2019-01-11 21:17:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:00,477 INFO L93 Difference]: Finished difference Result 7561 states and 11243 transitions. [2019-01-11 21:17:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:00,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-01-11 21:17:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:00,494 INFO L225 Difference]: With dead ends: 7561 [2019-01-11 21:17:00,495 INFO L226 Difference]: Without dead ends: 3784 [2019-01-11 21:17:00,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-01-11 21:17:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3784. [2019-01-11 21:17:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-01-11 21:17:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5517 transitions. [2019-01-11 21:17:00,608 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5517 transitions. Word has length 277 [2019-01-11 21:17:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:00,609 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5517 transitions. [2019-01-11 21:17:00,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5517 transitions. [2019-01-11 21:17:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-11 21:17:00,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:00,620 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:00,620 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:00,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2084683919, now seen corresponding path program 1 times [2019-01-11 21:17:00,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:00,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:00,634 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-11 21:17:00,635 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-11 21:17:00,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-11 21:17:00,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:00,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-01-11 21:17:00,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:00,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:00,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:00,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:00,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:00,888 INFO L87 Difference]: Start difference. First operand 3784 states and 5517 transitions. Second operand 3 states. [2019-01-11 21:17:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:01,145 INFO L93 Difference]: Finished difference Result 7951 states and 11633 transitions. [2019-01-11 21:17:01,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:01,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-01-11 21:17:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:01,153 INFO L225 Difference]: With dead ends: 7951 [2019-01-11 21:17:01,153 INFO L226 Difference]: Without dead ends: 2307 [2019-01-11 21:17:01,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-01-11 21:17:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-01-11 21:17:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-01-11 21:17:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3307 transitions. [2019-01-11 21:17:01,234 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3307 transitions. Word has length 305 [2019-01-11 21:17:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:01,234 INFO L480 AbstractCegarLoop]: Abstraction has 2307 states and 3307 transitions. [2019-01-11 21:17:01,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3307 transitions. [2019-01-11 21:17:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-11 21:17:01,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:01,242 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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-11 21:17:01,243 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:01,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1859888105, now seen corresponding path program 1 times [2019-01-11 21:17:01,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:01,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:01,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:01,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:01,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 21:17:01,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:01,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:01,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:01,384 INFO L87 Difference]: Start difference. First operand 2307 states and 3307 transitions. Second operand 3 states. [2019-01-11 21:17:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:01,611 INFO L93 Difference]: Finished difference Result 4829 states and 6951 transitions. [2019-01-11 21:17:01,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:01,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-01-11 21:17:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:01,626 INFO L225 Difference]: With dead ends: 4829 [2019-01-11 21:17:01,628 INFO L226 Difference]: Without dead ends: 2529 [2019-01-11 21:17:01,631 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-11 21:17:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2019-01-11 21:17:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2457. [2019-01-11 21:17:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-01-11 21:17:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3487 transitions. [2019-01-11 21:17:01,690 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3487 transitions. Word has length 326 [2019-01-11 21:17:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:01,691 INFO L480 AbstractCegarLoop]: Abstraction has 2457 states and 3487 transitions. [2019-01-11 21:17:01,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3487 transitions. [2019-01-11 21:17:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-01-11 21:17:01,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:01,700 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:01,700 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash -743110197, now seen corresponding path program 1 times [2019-01-11 21:17:01,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:01,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:01,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:01,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-01-11 21:17:01,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:01,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:01,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:01,836 INFO L87 Difference]: Start difference. First operand 2457 states and 3487 transitions. Second operand 3 states. [2019-01-11 21:17:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:02,035 INFO L93 Difference]: Finished difference Result 4949 states and 7035 transitions. [2019-01-11 21:17:02,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:02,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-01-11 21:17:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:02,041 INFO L225 Difference]: With dead ends: 4949 [2019-01-11 21:17:02,041 INFO L226 Difference]: Without dead ends: 2499 [2019-01-11 21:17:02,044 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-11 21:17:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-01-11 21:17:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2457. [2019-01-11 21:17:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-01-11 21:17:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3427 transitions. [2019-01-11 21:17:02,108 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3427 transitions. Word has length 352 [2019-01-11 21:17:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:02,108 INFO L480 AbstractCegarLoop]: Abstraction has 2457 states and 3427 transitions. [2019-01-11 21:17:02,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3427 transitions. [2019-01-11 21:17:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-01-11 21:17:02,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:02,114 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:02,114 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash -865406346, now seen corresponding path program 1 times [2019-01-11 21:17:02,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:02,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:02,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:02,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:02,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 21:17:02,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:02,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:02,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:02,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 21:17:02,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:02,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:17:02,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:17:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:17:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:17:02,557 INFO L87 Difference]: Start difference. First operand 2457 states and 3427 transitions. Second operand 4 states. [2019-01-11 21:17:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:03,005 INFO L93 Difference]: Finished difference Result 7213 states and 10041 transitions. [2019-01-11 21:17:03,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 21:17:03,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 369 [2019-01-11 21:17:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:03,016 INFO L225 Difference]: With dead ends: 7213 [2019-01-11 21:17:03,016 INFO L226 Difference]: Without dead ends: 4617 [2019-01-11 21:17:03,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 21:17:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2019-01-11 21:17:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 2534. [2019-01-11 21:17:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-01-11 21:17:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3492 transitions. [2019-01-11 21:17:03,116 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3492 transitions. Word has length 369 [2019-01-11 21:17:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:03,117 INFO L480 AbstractCegarLoop]: Abstraction has 2534 states and 3492 transitions. [2019-01-11 21:17:03,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:17:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3492 transitions. [2019-01-11 21:17:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-01-11 21:17:03,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:03,124 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:03,125 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:03,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:03,125 INFO L82 PathProgramCache]: Analyzing trace with hash 347179712, now seen corresponding path program 1 times [2019-01-11 21:17:03,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:03,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:03,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2019-01-11 21:17:03,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:03,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:03,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:03,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:03,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:03,407 INFO L87 Difference]: Start difference. First operand 2534 states and 3492 transitions. Second operand 3 states. [2019-01-11 21:17:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:03,694 INFO L93 Difference]: Finished difference Result 5073 states and 6985 transitions. [2019-01-11 21:17:03,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:03,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 437 [2019-01-11 21:17:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:03,700 INFO L225 Difference]: With dead ends: 5073 [2019-01-11 21:17:03,700 INFO L226 Difference]: Without dead ends: 2546 [2019-01-11 21:17:03,703 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-11 21:17:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-01-11 21:17:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2534. [2019-01-11 21:17:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-01-11 21:17:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3432 transitions. [2019-01-11 21:17:03,774 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3432 transitions. Word has length 437 [2019-01-11 21:17:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:03,774 INFO L480 AbstractCegarLoop]: Abstraction has 2534 states and 3432 transitions. [2019-01-11 21:17:03,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3432 transitions. [2019-01-11 21:17:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-01-11 21:17:03,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:03,783 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:03,783 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:03,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:03,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1485463445, now seen corresponding path program 1 times [2019-01-11 21:17:03,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:03,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:03,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:03,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:03,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-01-11 21:17:04,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:04,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:04,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:04,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:04,003 INFO L87 Difference]: Start difference. First operand 2534 states and 3432 transitions. Second operand 3 states. [2019-01-11 21:17:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:04,622 INFO L93 Difference]: Finished difference Result 5277 states and 7171 transitions. [2019-01-11 21:17:04,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:04,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-01-11 21:17:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:04,630 INFO L225 Difference]: With dead ends: 5277 [2019-01-11 21:17:04,630 INFO L226 Difference]: Without dead ends: 2750 [2019-01-11 21:17:04,634 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-11 21:17:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2019-01-11 21:17:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2738. [2019-01-11 21:17:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2019-01-11 21:17:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 3666 transitions. [2019-01-11 21:17:04,731 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 3666 transitions. Word has length 469 [2019-01-11 21:17:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:04,732 INFO L480 AbstractCegarLoop]: Abstraction has 2738 states and 3666 transitions. [2019-01-11 21:17:04,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 3666 transitions. [2019-01-11 21:17:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-01-11 21:17:04,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:04,743 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:17:04,745 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash 741321217, now seen corresponding path program 1 times [2019-01-11 21:17:04,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:04,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:04,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:04,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:04,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2019-01-11 21:17:05,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:17:05,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:17:05,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:17:05,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:17:05,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:17:05,147 INFO L87 Difference]: Start difference. First operand 2738 states and 3666 transitions. Second operand 3 states. [2019-01-11 21:17:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:06,600 INFO L93 Difference]: Finished difference Result 5697 states and 7663 transitions. [2019-01-11 21:17:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:17:06,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 531 [2019-01-11 21:17:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:06,605 INFO L225 Difference]: With dead ends: 5697 [2019-01-11 21:17:06,606 INFO L226 Difference]: Without dead ends: 2966 [2019-01-11 21:17:06,610 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-11 21:17:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2019-01-11 21:17:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2954. [2019-01-11 21:17:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-01-11 21:17:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3912 transitions. [2019-01-11 21:17:06,703 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3912 transitions. Word has length 531 [2019-01-11 21:17:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:06,704 INFO L480 AbstractCegarLoop]: Abstraction has 2954 states and 3912 transitions. [2019-01-11 21:17:06,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:17:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3912 transitions. [2019-01-11 21:17:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-01-11 21:17:06,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:17:06,717 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 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, 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] [2019-01-11 21:17:06,717 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:17:06,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:17:06,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1801113525, now seen corresponding path program 1 times [2019-01-11 21:17:06,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:17:06,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:17:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:06,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:17:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-11 21:17:07,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 21:17:07,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 21:17:07,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:17:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:17:07,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 21:17:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-01-11 21:17:07,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-11 21:17:07,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-11 21:17:07,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 21:17:07,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 21:17:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 21:17:07,372 INFO L87 Difference]: Start difference. First operand 2954 states and 3912 transitions. Second operand 4 states. [2019-01-11 21:17:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:17:07,618 INFO L93 Difference]: Finished difference Result 4704 states and 6236 transitions. [2019-01-11 21:17:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 21:17:07,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 597 [2019-01-11 21:17:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:17:07,620 INFO L225 Difference]: With dead ends: 4704 [2019-01-11 21:17:07,620 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:17:07,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 599 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-11 21:17:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:17:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:17:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:17:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:17:07,624 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2019-01-11 21:17:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:17:07,624 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:17:07,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 21:17:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:17:07,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:17:07,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:17:07,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,946 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 81 [2019-01-11 21:17:07,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:07,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,288 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 81 [2019-01-11 21:17:08,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:08,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 21:17:09,547 WARN L181 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-11 21:17:09,670 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 16 [2019-01-11 21:17:09,874 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-11 21:17:10,178 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-01-11 21:17:10,354 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-11 21:17:10,678 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-01-11 21:17:10,866 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-11 21:17:11,171 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-01-11 21:17:11,353 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-11 21:17:11,512 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-01-11 21:17:12,804 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 61 DAG size of output: 20 [2019-01-11 21:17:13,553 WARN L181 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-01-11 21:17:13,887 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-01-11 21:17:14,081 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-01-11 21:17:14,270 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-01-11 21:17:14,593 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-01-11 21:17:14,891 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-01-11 21:17:15,061 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-11 21:17:15,234 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-11 21:17:15,429 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-01-11 21:17:15,759 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-11 21:17:15,763 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 469) no Hoare annotation was computed. [2019-01-11 21:17:15,763 INFO L444 ceAbstractionStarter]: At program point L201(lines 197 592) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) [2019-01-11 21:17:15,763 INFO L444 ceAbstractionStarter]: At program point L102(lines 101 624) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) [2019-01-11 21:17:15,763 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 504) no Hoare annotation was computed. [2019-01-11 21:17:15,763 INFO L448 ceAbstractionStarter]: For program point L500-2(lines 208 586) no Hoare annotation was computed. [2019-01-11 21:17:15,764 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 241) no Hoare annotation was computed. [2019-01-11 21:17:15,764 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 590) no Hoare annotation was computed. [2019-01-11 21:17:15,764 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 601) no Hoare annotation was computed. [2019-01-11 21:17:15,764 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 612) no Hoare annotation was computed. [2019-01-11 21:17:15,764 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 623) no Hoare annotation was computed. [2019-01-11 21:17:15,764 INFO L444 ceAbstractionStarter]: At program point L204(lines 203 590) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:15,764 INFO L444 ceAbstractionStarter]: At program point L171(lines 167 602) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:17:15,765 INFO L444 ceAbstractionStarter]: At program point L138(lines 134 613) the Hoare annotation is: (let ((.cse0 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6))) [2019-01-11 21:17:15,766 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 80) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 275) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 208 586) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 600) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 611) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 622) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L570(lines 570 580) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 570 580) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 438 450) no Hoare annotation was computed. [2019-01-11 21:17:15,767 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 589) the Hoare annotation is: (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) [2019-01-11 21:17:15,767 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 79) no Hoare annotation was computed. [2019-01-11 21:17:15,768 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 72 80) no Hoare annotation was computed. [2019-01-11 21:17:15,768 INFO L444 ceAbstractionStarter]: At program point L406(lines 397 417) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:15,768 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 344) no Hoare annotation was computed. [2019-01-11 21:17:15,768 INFO L448 ceAbstractionStarter]: For program point L340-2(lines 208 586) no Hoare annotation was computed. [2019-01-11 21:17:15,768 INFO L451 ceAbstractionStarter]: At program point L671(lines 63 673) the Hoare annotation is: true [2019-01-11 21:17:15,768 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-01-11 21:17:15,768 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 544) no Hoare annotation was computed. [2019-01-11 21:17:15,768 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 599) no Hoare annotation was computed. [2019-01-11 21:17:15,768 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 610) no Hoare annotation was computed. [2019-01-11 21:17:15,769 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 621) no Hoare annotation was computed. [2019-01-11 21:17:15,769 INFO L451 ceAbstractionStarter]: At program point L672(lines 8 674) the Hoare annotation is: true [2019-01-11 21:17:15,769 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 577) no Hoare annotation was computed. [2019-01-11 21:17:15,769 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 446) no Hoare annotation was computed. [2019-01-11 21:17:15,769 INFO L444 ceAbstractionStarter]: At program point L177(lines 173 600) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:17:15,769 INFO L444 ceAbstractionStarter]: At program point L144(lines 140 611) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:15,769 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L444 ceAbstractionStarter]: At program point L211(lines 104 623) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 598) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 609) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 620) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 514) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 90) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 63 673) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 597) no Hoare annotation was computed. [2019-01-11 21:17:15,770 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 608) no Hoare annotation was computed. [2019-01-11 21:17:15,771 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 619) no Hoare annotation was computed. [2019-01-11 21:17:15,771 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 87) no Hoare annotation was computed. [2019-01-11 21:17:15,771 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 379) no Hoare annotation was computed. [2019-01-11 21:17:15,771 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. [2019-01-11 21:17:15,771 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 319) no Hoare annotation was computed. [2019-01-11 21:17:15,771 INFO L448 ceAbstractionStarter]: For program point L216(lines 216 220) no Hoare annotation was computed. [2019-01-11 21:17:15,771 INFO L444 ceAbstractionStarter]: At program point L183(lines 179 598) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:17:15,771 INFO L444 ceAbstractionStarter]: At program point L150(lines 146 609) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:15,771 INFO L448 ceAbstractionStarter]: For program point L216-2(lines 208 586) no Hoare annotation was computed. [2019-01-11 21:17:15,772 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:17:15,772 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 596) no Hoare annotation was computed. [2019-01-11 21:17:15,772 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 607) no Hoare annotation was computed. [2019-01-11 21:17:15,772 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 618) no Hoare annotation was computed. [2019-01-11 21:17:15,772 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 553) no Hoare annotation was computed. [2019-01-11 21:17:15,772 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 378) no Hoare annotation was computed. [2019-01-11 21:17:15,772 INFO L448 ceAbstractionStarter]: For program point L351-1(lines 351 378) no Hoare annotation was computed. [2019-01-11 21:17:15,772 INFO L444 ceAbstractionStarter]: At program point L120(lines 116 619) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse2 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-01-11 21:17:15,772 INFO L444 ceAbstractionStarter]: At program point L550(lines 63 673) the Hoare annotation is: false [2019-01-11 21:17:15,773 INFO L448 ceAbstractionStarter]: For program point L352(lines 352 375) no Hoare annotation was computed. [2019-01-11 21:17:15,773 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 265) no Hoare annotation was computed. [2019-01-11 21:17:15,773 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 259) no Hoare annotation was computed. [2019-01-11 21:17:15,773 INFO L448 ceAbstractionStarter]: For program point L188(lines 188 595) no Hoare annotation was computed. [2019-01-11 21:17:15,773 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 606) no Hoare annotation was computed. [2019-01-11 21:17:15,773 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 617) no Hoare annotation was computed. [2019-01-11 21:17:15,773 INFO L451 ceAbstractionStarter]: At program point L684(lines 675 686) the Hoare annotation is: true [2019-01-11 21:17:15,773 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 418) no Hoare annotation was computed. [2019-01-11 21:17:15,773 INFO L448 ceAbstractionStarter]: For program point L288(lines 288 292) no Hoare annotation was computed. [2019-01-11 21:17:15,773 INFO L448 ceAbstractionStarter]: For program point L288-2(lines 208 586) no Hoare annotation was computed. [2019-01-11 21:17:15,773 INFO L444 ceAbstractionStarter]: At program point L189(lines 185 596) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2019-01-11 21:17:15,777 INFO L444 ceAbstractionStarter]: At program point L156(lines 152 607) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:15,777 INFO L444 ceAbstractionStarter]: At program point L123(lines 122 617) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))) [2019-01-11 21:17:15,777 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 525) no Hoare annotation was computed. [2019-01-11 21:17:15,777 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 394) no Hoare annotation was computed. [2019-01-11 21:17:15,777 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 374) no Hoare annotation was computed. [2019-01-11 21:17:15,777 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L444 ceAbstractionStarter]: At program point L587(lines 98 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 .cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 492) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point L356-2(lines 355 372) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 594) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 605) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 616) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 460) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point L324-1(lines 324 333) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:17:15,778 INFO L451 ceAbstractionStarter]: At program point L656(lines 97 657) the Hoare annotation is: true [2019-01-11 21:17:15,779 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 593) no Hoare annotation was computed. [2019-01-11 21:17:15,779 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 604) no Hoare annotation was computed. [2019-01-11 21:17:15,779 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 615) no Hoare annotation was computed. [2019-01-11 21:17:15,779 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 245) no Hoare annotation was computed. [2019-01-11 21:17:15,779 INFO L444 ceAbstractionStarter]: At program point L195(lines 191 594) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse1 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-01-11 21:17:15,779 INFO L444 ceAbstractionStarter]: At program point L162(lines 158 605) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse6) (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))))) [2019-01-11 21:17:15,779 INFO L448 ceAbstractionStarter]: For program point L228-2(lines 208 586) no Hoare annotation was computed. [2019-01-11 21:17:15,779 INFO L448 ceAbstractionStarter]: For program point L625(lines 625 653) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 667) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 332) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 650) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 564) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 531) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point L560-2(lines 560 564) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 472) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point L527-2(lines 208 586) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 432) no Hoare annotation was computed. [2019-01-11 21:17:15,780 INFO L444 ceAbstractionStarter]: At program point L362(lines 345 380) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:15,780 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 235) no Hoare annotation was computed. [2019-01-11 21:17:15,781 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 592) no Hoare annotation was computed. [2019-01-11 21:17:15,781 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 603) no Hoare annotation was computed. [2019-01-11 21:17:15,781 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 614) no Hoare annotation was computed. [2019-01-11 21:17:15,781 INFO L444 ceAbstractionStarter]: At program point L98-2(lines 98 655) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)) (and .cse0 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse2 .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (and .cse1 .cse2 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) [2019-01-11 21:17:15,781 INFO L448 ceAbstractionStarter]: For program point L660(lines 660 664) no Hoare annotation was computed. [2019-01-11 21:17:15,781 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 636) no Hoare annotation was computed. [2019-01-11 21:17:15,781 INFO L448 ceAbstractionStarter]: For program point L660-2(lines 660 664) no Hoare annotation was computed. [2019-01-11 21:17:15,781 INFO L448 ceAbstractionStarter]: For program point L627-2(lines 626 648) no Hoare annotation was computed. [2019-01-11 21:17:15,781 INFO L444 ceAbstractionStarter]: At program point L396(lines 387 418) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (and (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8673 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0))))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse1 .cse2 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576)))) [2019-01-11 21:17:15,782 INFO L444 ceAbstractionStarter]: At program point L165(lines 164 603) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse1 (= ULTIMATE.start_ssl3_accept_~s__state~0 8448))) (or (and .cse0 .cse1 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2019-01-11 21:17:15,782 INFO L444 ceAbstractionStarter]: At program point L132(lines 125 616) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= 8481 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= 8561 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8545 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8480 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= 8657 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 ULTIMATE.start_ssl3_accept_~s__hit~0))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse8))) [2019-01-11 21:17:15,782 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-11 21:17:15,782 INFO L448 ceAbstractionStarter]: For program point L364(lines 364 368) no Hoare annotation was computed. [2019-01-11 21:17:15,782 INFO L448 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-01-11 21:17:15,782 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 404) no Hoare annotation was computed. [2019-01-11 21:17:15,782 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 591) no Hoare annotation was computed. [2019-01-11 21:17:15,782 INFO L448 ceAbstractionStarter]: For program point L167(lines 167 602) no Hoare annotation was computed. [2019-01-11 21:17:15,782 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 613) no Hoare annotation was computed. [2019-01-11 21:17:15,782 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 624) no Hoare annotation was computed. [2019-01-11 21:17:15,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:17:15 BoogieIcfgContainer [2019-01-11 21:17:15,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:17:15,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:17:15,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:17:15,851 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:17:15,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:16:42" (3/4) ... [2019-01-11 21:17:15,857 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:17:15,885 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-11 21:17:15,886 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:17:16,015 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:17:16,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:17:16,019 INFO L168 Benchmark]: Toolchain (without parser) took 35826.70 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 783.8 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -86.9 MB). Peak memory consumption was 696.9 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,021 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-11 21:17:16,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.10 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,022 INFO L168 Benchmark]: Boogie Preprocessor took 52.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,025 INFO L168 Benchmark]: RCFGBuilder took 1430.18 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: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,026 INFO L168 Benchmark]: TraceAbstraction took 33521.94 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 640.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.6 MB). Peak memory consumption was 744.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:17:16,027 INFO L168 Benchmark]: Witness Printer took 167.21 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-11 21:17:16,030 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 523.10 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 127.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1430.18 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: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33521.94 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 640.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.6 MB). Peak memory consumption was 744.7 MB. Max. memory is 11.5 GB. * Witness Printer took 167.21 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 667]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && !(8673 == s__state)) && 8672 <= s__state) && !(8672 == s__state)) && !(0 == s__hit) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (blastFlag <= 3 && 8672 <= s__state) && !(12292 == s__state) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((s__state <= 8672 && blastFlag <= 3) && !(8657 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((blastFlag <= 2 && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && s__state <= 8576) && !(8480 == s__state)) || ((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && s__s3__tmp__next_state___0 <= 8576) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) || ((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: !(8672 == s__state) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((blastFlag <= 3 && s__state == 8448) && !(0 == s__hit)) || ((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3)) || ((blastFlag <= 2 && s__state == 8448) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (((((((((((s__state <= 8672 && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && ((((((((!(8448 == s__state) && !(8673 == s__state)) && !(8656 == s__state)) && !(8657 == s__state)) && !(8561 == s__state)) && !(12292 == s__state)) && !(8481 == s__state)) && !(8560 == s__state)) && !(8672 == s__state)) && !(8480 == s__state)) && s__state <= 8576) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((s__state <= 8672 && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 3 && s__state == 8448) && s__s3__tmp__next_state___0 <= 3) || s__state <= 3) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag <= 3 && !(0 == s__hit))) || ((s__state <= 8672 && blastFlag <= 3) && 8672 <= s__state)) || ((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8673 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || (((((((((((((blastFlag <= 2 && s__state <= 8672) && !(8497 == s__state)) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((s__state <= 8672 && !(8497 == s__state)) && blastFlag <= 3) && !(8657 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8672 == s__state)) && !(8448 == s__state)) && !(8656 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && !(8480 == s__state)) && !(0 == s__hit)) || ((((((((((blastFlag <= 2 && !(8497 == s__state)) && !(8496 == s__state)) && !(8481 == s__state)) && !(8448 == s__state)) && !(8561 == s__state)) && !(8545 == s__state)) && !(8544 == s__state)) && !(8560 == s__state)) && s__state <= 8576) && !(8480 == s__state)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. SAFE Result, 33.3s OverallTime, 31 OverallIterations, 19 TraceHistogramMax, 17.4s AutomataDifference, 0.0s DeadEndRemovalTime, 8.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 5245 SDtfs, 3315 SDslu, 2431 SDs, 0 SdLazy, 2974 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2452 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3784occurred in iteration=20, 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: 1.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 2507 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 377 NumberOfFragments, 1971 HoareAnnotationTreeSize, 29 FomulaSimplifications, 39550 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7460 FormulaSimplificationTreeSizeReductionInter, 7.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 7192 NumberOfCodeBlocks, 7192 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 7159 ConstructedInterpolants, 0 QuantifiedInterpolants, 2978515 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3962 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 33 InterpolantComputations, 29 PerfectInterpolantSequences, 24782/24886 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...