./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.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/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.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 936e1fac1e718929285e646469efe9b1619e10b2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-12 00:53:33,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:53:33,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:53:33,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:53:33,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:53:33,307 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:53:33,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:53:33,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:53:33,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:53:33,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:53:33,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:53:33,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:53:33,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:53:33,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:53:33,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:53:33,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:53:33,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:53:33,322 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:53:33,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:53:33,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:53:33,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:53:33,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:53:33,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:53:33,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:53:33,331 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:53:33,332 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:53:33,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:53:33,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:53:33,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:53:33,336 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:53:33,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:53:33,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:53:33,337 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:53:33,337 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:53:33,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:53:33,339 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:53:33,339 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:53:33,353 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:53:33,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:53:33,355 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:53:33,355 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:53:33,355 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:53:33,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:53:33,356 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:53:33,356 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:53:33,356 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:53:33,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:53:33,356 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:53:33,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:53:33,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:53:33,357 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:53:33,357 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:53:33,357 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:53:33,357 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:53:33,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:53:33,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:53:33,358 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:53:33,358 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:53:33,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:53:33,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:53:33,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:53:33,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:53:33,359 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:53:33,359 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:53:33,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:53:33,360 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 -> 936e1fac1e718929285e646469efe9b1619e10b2 [2019-01-12 00:53:33,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:53:33,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:53:33,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:53:33,431 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:53:33,431 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:53:33,432 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.c [2019-01-12 00:53:33,497 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0a2d152/43f1dff93da745c994a90c43674d7a97/FLAG7818aed8d [2019-01-12 00:53:34,068 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:53:34,069 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label41_true-unreach-call_false-termination.c [2019-01-12 00:53:34,089 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0a2d152/43f1dff93da745c994a90c43674d7a97/FLAG7818aed8d [2019-01-12 00:53:34,299 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0a2d152/43f1dff93da745c994a90c43674d7a97 [2019-01-12 00:53:34,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:53:34,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:53:34,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:53:34,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:53:34,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:53:34,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:34,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672937de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34, skipping insertion in model container [2019-01-12 00:53:34,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:34,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:53:34,384 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:53:34,812 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:53:34,819 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:53:34,916 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:53:34,933 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:53:34,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34 WrapperNode [2019-01-12 00:53:34,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:53:34,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:53:34,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:53:34,935 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:53:35,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:35,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:35,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:53:35,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:53:35,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:53:35,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:53:35,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:35,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:35,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:35,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:35,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:35,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:35,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (1/1) ... [2019-01-12 00:53:35,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:53:35,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:53:35,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:53:35,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:53:35,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (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-12 00:53:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:53:35,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:53:38,460 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:53:38,460 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:53:38,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:38 BoogieIcfgContainer [2019-01-12 00:53:38,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:53:38,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:53:38,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:53:38,467 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:53:38,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:53:34" (1/3) ... [2019-01-12 00:53:38,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be17d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:53:38, skipping insertion in model container [2019-01-12 00:53:38,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:34" (2/3) ... [2019-01-12 00:53:38,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be17d86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:53:38, skipping insertion in model container [2019-01-12 00:53:38,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:38" (3/3) ... [2019-01-12 00:53:38,473 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label41_true-unreach-call_false-termination.c [2019-01-12 00:53:38,484 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:53:38,493 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:53:38,509 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:53:38,541 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:53:38,542 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:53:38,542 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:53:38,543 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:53:38,544 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:53:38,544 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:53:38,544 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:53:38,544 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:53:38,545 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:53:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:53:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-12 00:53:38,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:38,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:53:38,583 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash 867355110, now seen corresponding path program 1 times [2019-01-12 00:53:38,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:38,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:38,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:38,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:38,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:39,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:39,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:39,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:39,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:39,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:39,364 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-01-12 00:53:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:41,749 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-01-12 00:53:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:41,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-01-12 00:53:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:41,772 INFO L225 Difference]: With dead ends: 662 [2019-01-12 00:53:41,772 INFO L226 Difference]: Without dead ends: 397 [2019-01-12 00:53:41,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-12 00:53:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-01-12 00:53:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-12 00:53:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-01-12 00:53:41,897 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 85 [2019-01-12 00:53:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:41,898 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-01-12 00:53:41,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-01-12 00:53:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-12 00:53:41,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:41,903 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:53:41,904 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:41,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1655802317, now seen corresponding path program 1 times [2019-01-12 00:53:41,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:41,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:41,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:41,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:42,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:42,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:42,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:42,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:42,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:42,010 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-01-12 00:53:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:43,251 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-01-12 00:53:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:43,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-12 00:53:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:43,259 INFO L225 Difference]: With dead ends: 1054 [2019-01-12 00:53:43,259 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:53:43,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:53:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-01-12 00:53:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:53:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-01-12 00:53:43,311 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 91 [2019-01-12 00:53:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:43,312 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-01-12 00:53:43,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-01-12 00:53:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 00:53:43,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:43,321 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:53:43,321 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1661592781, now seen corresponding path program 1 times [2019-01-12 00:53:43,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:43,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:43,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:43,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:43,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:43,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:43,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:43,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:43,506 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-01-12 00:53:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:44,768 INFO L93 Difference]: Finished difference Result 2102 states and 2850 transitions. [2019-01-12 00:53:44,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:44,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-01-12 00:53:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:44,775 INFO L225 Difference]: With dead ends: 2102 [2019-01-12 00:53:44,775 INFO L226 Difference]: Without dead ends: 1183 [2019-01-12 00:53:44,777 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-12 00:53:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-01-12 00:53:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2019-01-12 00:53:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-12 00:53:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1319 transitions. [2019-01-12 00:53:44,808 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1319 transitions. Word has length 92 [2019-01-12 00:53:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:44,809 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1319 transitions. [2019-01-12 00:53:44,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1319 transitions. [2019-01-12 00:53:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 00:53:44,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:44,813 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:53:44,813 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash -539431419, now seen corresponding path program 1 times [2019-01-12 00:53:44,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:44,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:44,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:44,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:44,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:53:44,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:44,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:44,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:44,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:44,968 INFO L87 Difference]: Start difference. First operand 1052 states and 1319 transitions. Second operand 3 states. [2019-01-12 00:53:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:46,399 INFO L93 Difference]: Finished difference Result 2757 states and 3480 transitions. [2019-01-12 00:53:46,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:46,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 00:53:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:46,408 INFO L225 Difference]: With dead ends: 2757 [2019-01-12 00:53:46,408 INFO L226 Difference]: Without dead ends: 1576 [2019-01-12 00:53:46,410 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-12 00:53:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-01-12 00:53:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-01-12 00:53:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:53:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1638 transitions. [2019-01-12 00:53:46,449 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1638 transitions. Word has length 100 [2019-01-12 00:53:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:46,449 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1638 transitions. [2019-01-12 00:53:46,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1638 transitions. [2019-01-12 00:53:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 00:53:46,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:46,452 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:53:46,452 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:46,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:46,453 INFO L82 PathProgramCache]: Analyzing trace with hash -36212071, now seen corresponding path program 1 times [2019-01-12 00:53:46,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:46,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:46,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:46,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:46,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:46,678 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:53:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:53:46,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:46,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:46,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:46,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:46,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:46,766 INFO L87 Difference]: Start difference. First operand 1445 states and 1638 transitions. Second operand 4 states. [2019-01-12 00:53:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:47,615 INFO L93 Difference]: Finished difference Result 3027 states and 3424 transitions. [2019-01-12 00:53:47,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:53:47,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-01-12 00:53:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:47,624 INFO L225 Difference]: With dead ends: 3027 [2019-01-12 00:53:47,624 INFO L226 Difference]: Without dead ends: 1584 [2019-01-12 00:53:47,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:53:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-01-12 00:53:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1576. [2019-01-12 00:53:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:53:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1772 transitions. [2019-01-12 00:53:47,660 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1772 transitions. Word has length 108 [2019-01-12 00:53:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:47,661 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1772 transitions. [2019-01-12 00:53:47,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1772 transitions. [2019-01-12 00:53:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 00:53:47,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:47,667 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:53:47,668 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1928303825, now seen corresponding path program 1 times [2019-01-12 00:53:47,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:47,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:47,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:47,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:47,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:47,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:47,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:47,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:47,841 INFO L87 Difference]: Start difference. First operand 1576 states and 1772 transitions. Second operand 4 states. [2019-01-12 00:53:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:48,501 INFO L93 Difference]: Finished difference Result 3674 states and 4184 transitions. [2019-01-12 00:53:48,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:48,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-01-12 00:53:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:48,511 INFO L225 Difference]: With dead ends: 3674 [2019-01-12 00:53:48,511 INFO L226 Difference]: Without dead ends: 2231 [2019-01-12 00:53:48,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-01-12 00:53:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1576. [2019-01-12 00:53:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:53:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1745 transitions. [2019-01-12 00:53:48,546 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1745 transitions. Word has length 112 [2019-01-12 00:53:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:48,547 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1745 transitions. [2019-01-12 00:53:48,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1745 transitions. [2019-01-12 00:53:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-12 00:53:48,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:48,551 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-01-12 00:53:48,551 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1476523833, now seen corresponding path program 1 times [2019-01-12 00:53:48,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:48,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:48,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:48,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:48,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:49,179 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-12 00:53:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-01-12 00:53:49,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:49,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 00:53:49,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:53:49,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:53:49,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:53:49,318 INFO L87 Difference]: Start difference. First operand 1576 states and 1745 transitions. Second operand 8 states. [2019-01-12 00:53:50,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:50,792 INFO L93 Difference]: Finished difference Result 3451 states and 3825 transitions. [2019-01-12 00:53:50,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 00:53:50,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2019-01-12 00:53:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:50,801 INFO L225 Difference]: With dead ends: 3451 [2019-01-12 00:53:50,801 INFO L226 Difference]: Without dead ends: 2008 [2019-01-12 00:53:50,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:53:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-01-12 00:53:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1707. [2019-01-12 00:53:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:53:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2019-01-12 00:53:50,839 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 172 [2019-01-12 00:53:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:50,839 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2019-01-12 00:53:50,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:53:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2019-01-12 00:53:50,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-12 00:53:50,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:50,844 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:53:50,844 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:50,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1669631844, now seen corresponding path program 1 times [2019-01-12 00:53:50,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:50,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:50,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:50,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:50,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-12 00:53:51,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:53:51,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:53:51,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:51,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:53:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 00:53:51,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:53:51,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-01-12 00:53:51,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:51,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:51,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:51,453 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand 4 states. [2019-01-12 00:53:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:53,453 INFO L93 Difference]: Finished difference Result 3541 states and 3907 transitions. [2019-01-12 00:53:53,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:53,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-01-12 00:53:53,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:53,454 INFO L225 Difference]: With dead ends: 3541 [2019-01-12 00:53:53,454 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:53:53,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:53:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:53:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:53:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:53:53,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2019-01-12 00:53:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:53,462 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:53:53,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:53:53,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:53:53,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:53:53,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:53,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:54,629 WARN L181 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2019-01-12 00:53:55,086 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 27 [2019-01-12 00:53:55,089 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:53:55,090 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:53:55,090 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,090 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,090 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,090 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,090 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,090 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,090 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:53:55,090 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,091 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:53:55,092 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,093 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,094 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,094 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,094 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,094 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:53:55,094 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:53:55,094 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:53:55,094 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:53:55,094 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:53:55,094 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:53:55,095 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:53:55,095 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:53:55,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 431) no Hoare annotation was computed. [2019-01-12 00:53:55,095 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:53:55,096 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a21~0 1)) (.cse4 (= ~a20~0 1)) (.cse1 (not (= ~a8~0 13))) (.cse0 (<= ~a17~0 0))) (or (and .cse0 .cse1) (= ~a7~0 1) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse1) (and .cse4 .cse1 (= ~a16~0 5)) (and (not (= ~a16~0 6)) .cse0))) [2019-01-12 00:53:55,096 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,096 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,096 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,096 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,096 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,096 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:53:55,096 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:53:55,097 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:53:55,097 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:53:55,097 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:53:55,097 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:53:55,097 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:53:55,097 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:53:55,097 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:53:55,097 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:53:55,097 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:53:55,098 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:53:55,098 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:53:55,098 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:53:55,098 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,098 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,098 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,098 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,098 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,098 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:53:55,098 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,099 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:53:55,100 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:53:55,101 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:53:55,101 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:53:55,101 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:53:55,101 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:53:55,101 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:53:55,101 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,101 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a21~0 1)) (.cse4 (= ~a20~0 1)) (.cse1 (not (= ~a8~0 13))) (.cse0 (<= ~a17~0 0))) (or (and .cse0 .cse1) (= ~a7~0 1) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse1) (and .cse4 .cse1 (= ~a16~0 5)) (and (not (= ~a16~0 6)) .cse0))) [2019-01-12 00:53:55,101 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,101 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:53:55,102 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:53:55,103 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,104 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:53:55,105 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,105 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,105 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:53:55,105 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:53:55,105 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:53:55,105 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:53:55,105 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:53:55,105 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:53:55,105 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,106 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:53:55,107 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,108 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:53:55,109 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:53:55,110 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:53:55,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:53:55 BoogieIcfgContainer [2019-01-12 00:53:55,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:53:55,130 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:53:55,130 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:53:55,130 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:53:55,130 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:38" (3/4) ... [2019-01-12 00:53:55,135 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:53:55,174 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:53:55,176 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:53:55,427 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:53:55,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:53:55,429 INFO L168 Benchmark]: Toolchain (without parser) took 21125.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 941.9 MB in the beginning and 926.3 MB in the end (delta: 15.7 MB). Peak memory consumption was 332.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:55,430 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:53:55,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.35 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:55,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:55,432 INFO L168 Benchmark]: Boogie Preprocessor took 101.34 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:55,432 INFO L168 Benchmark]: RCFGBuilder took 3266.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:55,433 INFO L168 Benchmark]: TraceAbstraction took 16666.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 945.3 MB in the end (delta: 59.5 MB). Peak memory consumption was 243.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:55,433 INFO L168 Benchmark]: Witness Printer took 298.28 ms. Allocated memory is still 1.3 GB. Free memory was 945.3 MB in the beginning and 926.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:55,436 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 628.35 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 158.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -202.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.34 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3266.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16666.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 945.3 MB in the end (delta: 59.5 MB). Peak memory consumption was 243.5 MB. Max. memory is 11.5 GB. * Witness Printer took 298.28 ms. Allocated memory is still 1.3 GB. Free memory was 945.3 MB in the beginning and 926.3 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 431]: 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: 30]: Loop Invariant Derived loop invariant: (((((a17 <= 0 && !(a8 == 13)) || a7 == 1) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && !(a8 == 13))) || ((a20 == 1 && !(a8 == 13)) && a16 == 5)) || (!(a16 == 6) && a17 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((a17 <= 0 && !(a8 == 13)) || a7 == 1) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && !(a8 == 13))) || ((a20 == 1 && !(a8 == 13)) && a16 == 5)) || (!(a16 == 6) && a17 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 16.5s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 589 SDtfs, 1933 SDslu, 101 SDs, 0 SdLazy, 4412 SolverSat, 723 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1357 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 105 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3324 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1580 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1138 NumberOfCodeBlocks, 1138 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1129 ConstructedInterpolants, 0 QuantifiedInterpolants, 431413 SizeOfPredicates, 1 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 527/531 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...