./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_label14_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 d50ba566f02e5109971f6a90ba216a95432a7661 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 19:40:27,296 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:40:27,298 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:40:27,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:40:27,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:40:27,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:40:27,313 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:40:27,315 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:40:27,317 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:40:27,318 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:40:27,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:40:27,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:40:27,320 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:40:27,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:40:27,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:40:27,323 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:40:27,324 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:40:27,326 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:40:27,328 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:40:27,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:40:27,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:40:27,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:40:27,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:40:27,337 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:40:27,337 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:40:27,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:40:27,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:40:27,343 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:40:27,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:40:27,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:40:27,349 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:40:27,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:40:27,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:40:27,350 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:40:27,353 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:40:27,354 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:40:27,354 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 19:40:27,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:40:27,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:40:27,371 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:40:27,371 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:40:27,371 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:40:27,371 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:40:27,372 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:40:27,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:40:27,372 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:40:27,372 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:40:27,372 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:40:27,372 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:40:27,373 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:40:27,373 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:40:27,373 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:40:27,373 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:40:27,373 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:40:27,373 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:40:27,374 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:40:27,374 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:40:27,374 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:40:27,374 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:40:27,374 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:40:27,375 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:40:27,375 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:40:27,375 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:40:27,375 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:40:27,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:40:27,375 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 -> d50ba566f02e5109971f6a90ba216a95432a7661 [2018-12-30 19:40:27,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:40:27,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:40:27,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:40:27,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:40:27,464 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:40:27,465 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-12-30 19:40:27,538 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b06952b/6c14b1ba19264a8c8f4d0398ce092e96/FLAG3bf20529c [2018-12-30 19:40:28,086 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:40:28,087 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-12-30 19:40:28,105 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b06952b/6c14b1ba19264a8c8f4d0398ce092e96/FLAG3bf20529c [2018-12-30 19:40:28,331 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34b06952b/6c14b1ba19264a8c8f4d0398ce092e96 [2018-12-30 19:40:28,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:40:28,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:40:28,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:40:28,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:40:28,343 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:40:28,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:40:28" (1/1) ... [2018-12-30 19:40:28,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ab9922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:28, skipping insertion in model container [2018-12-30 19:40:28,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:40:28" (1/1) ... [2018-12-30 19:40:28,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:40:28,428 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:40:28,948 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:40:28,958 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:40:29,092 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:40:29,117 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:40:29,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29 WrapperNode [2018-12-30 19:40:29,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:40:29,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:40:29,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:40:29,119 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:40:29,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (1/1) ... [2018-12-30 19:40:29,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (1/1) ... [2018-12-30 19:40:29,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:40:29,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:40:29,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:40:29,302 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:40:29,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (1/1) ... [2018-12-30 19:40:29,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (1/1) ... [2018-12-30 19:40:29,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (1/1) ... [2018-12-30 19:40:29,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (1/1) ... [2018-12-30 19:40:29,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (1/1) ... [2018-12-30 19:40:29,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (1/1) ... [2018-12-30 19:40:29,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (1/1) ... [2018-12-30 19:40:29,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:40:29,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:40:29,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:40:29,421 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:40:29,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (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 [2018-12-30 19:40:29,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:40:29,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:40:32,602 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:40:32,604 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:40:32,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:40:32 BoogieIcfgContainer [2018-12-30 19:40:32,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:40:32,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:40:32,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:40:32,611 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:40:32,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:40:28" (1/3) ... [2018-12-30 19:40:32,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbf6844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:40:32, skipping insertion in model container [2018-12-30 19:40:32,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:40:29" (2/3) ... [2018-12-30 19:40:32,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbf6844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:40:32, skipping insertion in model container [2018-12-30 19:40:32,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:40:32" (3/3) ... [2018-12-30 19:40:32,619 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label14_true-unreach-call_false-termination.c [2018-12-30 19:40:32,631 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:40:32,645 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:40:32,667 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:40:32,713 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:40:32,714 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:40:32,714 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:40:32,714 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:40:32,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:40:32,715 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:40:32,715 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:40:32,716 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:40:32,716 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:40:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:40:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-30 19:40:32,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:32,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:32,788 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2004563326, now seen corresponding path program 1 times [2018-12-30 19:40:32,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:32,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:32,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:32,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:32,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:33,857 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-12-30 19:40:34,100 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-30 19:40:34,256 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-30 19:40:34,632 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-12-30 19:40:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:40:34,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:34,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-30 19:40:34,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 19:40:34,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 19:40:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-30 19:40:34,814 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2018-12-30 19:40:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:37,259 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2018-12-30 19:40:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 19:40:37,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2018-12-30 19:40:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:37,283 INFO L225 Difference]: With dead ends: 493 [2018-12-30 19:40:37,283 INFO L226 Difference]: Without dead ends: 193 [2018-12-30 19:40:37,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-12-30 19:40:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-30 19:40:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-30 19:40:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-30 19:40:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2018-12-30 19:40:37,342 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 131 [2018-12-30 19:40:37,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:37,343 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2018-12-30 19:40:37,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 19:40:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2018-12-30 19:40:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-30 19:40:37,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:37,347 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:37,347 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:37,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:37,348 INFO L82 PathProgramCache]: Analyzing trace with hash 481563718, now seen corresponding path program 1 times [2018-12-30 19:40:37,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:37,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:37,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:37,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:37,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 19:40:37,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:37,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:40:37,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:40:37,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:40:37,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:40:37,515 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 3 states. [2018-12-30 19:40:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:38,255 INFO L93 Difference]: Finished difference Result 457 states and 661 transitions. [2018-12-30 19:40:38,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:40:38,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2018-12-30 19:40:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:38,260 INFO L225 Difference]: With dead ends: 457 [2018-12-30 19:40:38,260 INFO L226 Difference]: Without dead ends: 324 [2018-12-30 19:40:38,262 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 [2018-12-30 19:40:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-30 19:40:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-12-30 19:40:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-30 19:40:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2018-12-30 19:40:38,291 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 135 [2018-12-30 19:40:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:38,292 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2018-12-30 19:40:38,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:40:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2018-12-30 19:40:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-30 19:40:38,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:38,299 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:38,299 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash -892512546, now seen corresponding path program 1 times [2018-12-30 19:40:38,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:38,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:38,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 19:40:38,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:38,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:40:38,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:40:38,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:40:38,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:38,473 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 4 states. [2018-12-30 19:40:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:39,233 INFO L93 Difference]: Finished difference Result 850 states and 1198 transitions. [2018-12-30 19:40:39,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:40:39,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-30 19:40:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:39,239 INFO L225 Difference]: With dead ends: 850 [2018-12-30 19:40:39,239 INFO L226 Difference]: Without dead ends: 586 [2018-12-30 19:40:39,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-12-30 19:40:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2018-12-30 19:40:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-12-30 19:40:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 783 transitions. [2018-12-30 19:40:39,273 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 783 transitions. Word has length 140 [2018-12-30 19:40:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:39,274 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 783 transitions. [2018-12-30 19:40:39,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:40:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 783 transitions. [2018-12-30 19:40:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-30 19:40:39,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:39,277 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:39,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:39,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash -970300302, now seen corresponding path program 1 times [2018-12-30 19:40:39,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:39,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:39,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:39,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:39,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-30 19:40:39,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:39,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:40:39,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:40:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:40:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:40:39,415 INFO L87 Difference]: Start difference. First operand 586 states and 783 transitions. Second operand 3 states. [2018-12-30 19:40:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:40,475 INFO L93 Difference]: Finished difference Result 1243 states and 1680 transitions. [2018-12-30 19:40:40,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:40:40,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-12-30 19:40:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:40,481 INFO L225 Difference]: With dead ends: 1243 [2018-12-30 19:40:40,481 INFO L226 Difference]: Without dead ends: 717 [2018-12-30 19:40:40,483 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 [2018-12-30 19:40:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-12-30 19:40:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 586. [2018-12-30 19:40:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-12-30 19:40:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 777 transitions. [2018-12-30 19:40:40,502 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 777 transitions. Word has length 148 [2018-12-30 19:40:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:40,502 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 777 transitions. [2018-12-30 19:40:40,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:40:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 777 transitions. [2018-12-30 19:40:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-30 19:40:40,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:40,505 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:40,505 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:40,506 INFO L82 PathProgramCache]: Analyzing trace with hash -247512496, now seen corresponding path program 1 times [2018-12-30 19:40:40,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:40,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:40,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-30 19:40:40,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:40,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:40,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:40:40,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:40:40,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:40,610 INFO L87 Difference]: Start difference. First operand 586 states and 777 transitions. Second operand 4 states. [2018-12-30 19:40:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:42,990 INFO L93 Difference]: Finished difference Result 2029 states and 2732 transitions. [2018-12-30 19:40:42,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:40:42,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-30 19:40:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:42,999 INFO L225 Difference]: With dead ends: 2029 [2018-12-30 19:40:42,999 INFO L226 Difference]: Without dead ends: 1503 [2018-12-30 19:40:43,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2018-12-30 19:40:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2018-12-30 19:40:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-12-30 19:40:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1768 transitions. [2018-12-30 19:40:43,033 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1768 transitions. Word has length 157 [2018-12-30 19:40:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:43,033 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 1768 transitions. [2018-12-30 19:40:43,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:40:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1768 transitions. [2018-12-30 19:40:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-30 19:40:43,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:43,038 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:43,038 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:43,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1736300161, now seen corresponding path program 1 times [2018-12-30 19:40:43,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:43,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:43,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-30 19:40:43,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:43,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:43,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:40:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:40:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:43,189 INFO L87 Difference]: Start difference. First operand 1372 states and 1768 transitions. Second operand 5 states. [2018-12-30 19:40:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:44,450 INFO L93 Difference]: Finished difference Result 2815 states and 3620 transitions. [2018-12-30 19:40:44,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:40:44,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2018-12-30 19:40:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:44,458 INFO L225 Difference]: With dead ends: 2815 [2018-12-30 19:40:44,458 INFO L226 Difference]: Without dead ends: 1503 [2018-12-30 19:40:44,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2018-12-30 19:40:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2018-12-30 19:40:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-12-30 19:40:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1893 transitions. [2018-12-30 19:40:44,491 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1893 transitions. Word has length 163 [2018-12-30 19:40:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:44,491 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1893 transitions. [2018-12-30 19:40:44,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:40:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1893 transitions. [2018-12-30 19:40:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-30 19:40:44,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:44,497 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:44,497 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1205837626, now seen corresponding path program 1 times [2018-12-30 19:40:44,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:44,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:44,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-30 19:40:44,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:44,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:40:44,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:40:44,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:40:44,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:40:44,605 INFO L87 Difference]: Start difference. First operand 1503 states and 1893 transitions. Second operand 3 states. [2018-12-30 19:40:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:45,207 INFO L93 Difference]: Finished difference Result 3601 states and 4557 transitions. [2018-12-30 19:40:45,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:40:45,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-12-30 19:40:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:45,217 INFO L225 Difference]: With dead ends: 3601 [2018-12-30 19:40:45,217 INFO L226 Difference]: Without dead ends: 1896 [2018-12-30 19:40:45,222 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 [2018-12-30 19:40:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2018-12-30 19:40:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1765. [2018-12-30 19:40:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-12-30 19:40:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2004 transitions. [2018-12-30 19:40:45,257 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2004 transitions. Word has length 166 [2018-12-30 19:40:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:45,258 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 2004 transitions. [2018-12-30 19:40:45,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:40:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2004 transitions. [2018-12-30 19:40:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-30 19:40:45,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:45,264 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:45,265 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:45,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:45,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1300334530, now seen corresponding path program 1 times [2018-12-30 19:40:45,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:45,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:45,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:45,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:45,722 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-12-30 19:40:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:40:45,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:45,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:45,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:40:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:40:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:45,751 INFO L87 Difference]: Start difference. First operand 1765 states and 2004 transitions. Second operand 5 states. [2018-12-30 19:40:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:46,662 INFO L93 Difference]: Finished difference Result 4782 states and 5478 transitions. [2018-12-30 19:40:46,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:40:46,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2018-12-30 19:40:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:46,676 INFO L225 Difference]: With dead ends: 4782 [2018-12-30 19:40:46,677 INFO L226 Difference]: Without dead ends: 3077 [2018-12-30 19:40:46,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2018-12-30 19:40:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2682. [2018-12-30 19:40:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-12-30 19:40:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2977 transitions. [2018-12-30 19:40:46,730 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2977 transitions. Word has length 181 [2018-12-30 19:40:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:46,730 INFO L480 AbstractCegarLoop]: Abstraction has 2682 states and 2977 transitions. [2018-12-30 19:40:46,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:40:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2977 transitions. [2018-12-30 19:40:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-30 19:40:46,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:46,737 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:46,737 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:46,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:46,738 INFO L82 PathProgramCache]: Analyzing trace with hash 766976078, now seen corresponding path program 1 times [2018-12-30 19:40:46,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:46,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:46,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:46,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:46,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-30 19:40:46,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:46,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:46,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:40:46,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:40:46,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:46,933 INFO L87 Difference]: Start difference. First operand 2682 states and 2977 transitions. Second operand 4 states. [2018-12-30 19:40:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:47,769 INFO L93 Difference]: Finished difference Result 5699 states and 6349 transitions. [2018-12-30 19:40:47,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:40:47,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2018-12-30 19:40:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:47,780 INFO L225 Difference]: With dead ends: 5699 [2018-12-30 19:40:47,780 INFO L226 Difference]: Without dead ends: 2946 [2018-12-30 19:40:47,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2018-12-30 19:40:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2682. [2018-12-30 19:40:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-12-30 19:40:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2882 transitions. [2018-12-30 19:40:47,828 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2882 transitions. Word has length 210 [2018-12-30 19:40:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:47,828 INFO L480 AbstractCegarLoop]: Abstraction has 2682 states and 2882 transitions. [2018-12-30 19:40:47,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:40:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2882 transitions. [2018-12-30 19:40:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-30 19:40:47,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:47,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:47,836 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:47,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1931153020, now seen corresponding path program 1 times [2018-12-30 19:40:47,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:47,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:47,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-30 19:40:48,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:48,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:40:48,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:40:48,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:40:48,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:40:48,049 INFO L87 Difference]: Start difference. First operand 2682 states and 2882 transitions. Second operand 3 states. [2018-12-30 19:40:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:48,923 INFO L93 Difference]: Finished difference Result 5566 states and 5992 transitions. [2018-12-30 19:40:48,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:40:48,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-12-30 19:40:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:48,936 INFO L225 Difference]: With dead ends: 5566 [2018-12-30 19:40:48,937 INFO L226 Difference]: Without dead ends: 2682 [2018-12-30 19:40:48,940 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 [2018-12-30 19:40:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2018-12-30 19:40:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2420. [2018-12-30 19:40:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2018-12-30 19:40:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2562 transitions. [2018-12-30 19:40:48,980 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2562 transitions. Word has length 235 [2018-12-30 19:40:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:48,981 INFO L480 AbstractCegarLoop]: Abstraction has 2420 states and 2562 transitions. [2018-12-30 19:40:48,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:40:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2562 transitions. [2018-12-30 19:40:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-30 19:40:48,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:48,987 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:48,988 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1131445953, now seen corresponding path program 1 times [2018-12-30 19:40:48,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:48,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:48,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-30 19:40:49,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:49,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:49,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:40:49,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:40:49,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:49,128 INFO L87 Difference]: Start difference. First operand 2420 states and 2562 transitions. Second operand 4 states. [2018-12-30 19:40:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:50,596 INFO L93 Difference]: Finished difference Result 4780 states and 5062 transitions. [2018-12-30 19:40:50,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:40:50,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2018-12-30 19:40:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:50,602 INFO L225 Difference]: With dead ends: 4780 [2018-12-30 19:40:50,602 INFO L226 Difference]: Without dead ends: 1634 [2018-12-30 19:40:50,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:40:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-12-30 19:40:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1503. [2018-12-30 19:40:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-12-30 19:40:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1570 transitions. [2018-12-30 19:40:50,626 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1570 transitions. Word has length 237 [2018-12-30 19:40:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:50,626 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1570 transitions. [2018-12-30 19:40:50,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:40:50,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1570 transitions. [2018-12-30 19:40:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-30 19:40:50,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:50,632 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:50,632 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:50,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1941854154, now seen corresponding path program 1 times [2018-12-30 19:40:50,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:50,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:50,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:50,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-12-30 19:40:51,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:51,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:51,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:40:51,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:40:51,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:51,143 INFO L87 Difference]: Start difference. First operand 1503 states and 1570 transitions. Second operand 5 states. [2018-12-30 19:40:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:51,657 INFO L93 Difference]: Finished difference Result 3023 states and 3163 transitions. [2018-12-30 19:40:51,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:40:51,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2018-12-30 19:40:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:51,664 INFO L225 Difference]: With dead ends: 3023 [2018-12-30 19:40:51,664 INFO L226 Difference]: Without dead ends: 1503 [2018-12-30 19:40:51,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2018-12-30 19:40:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2018-12-30 19:40:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2018-12-30 19:40:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1567 transitions. [2018-12-30 19:40:51,687 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1567 transitions. Word has length 259 [2018-12-30 19:40:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:51,687 INFO L480 AbstractCegarLoop]: Abstraction has 1503 states and 1567 transitions. [2018-12-30 19:40:51,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:40:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1567 transitions. [2018-12-30 19:40:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-30 19:40:51,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:51,692 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:51,692 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1207165551, now seen corresponding path program 1 times [2018-12-30 19:40:51,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:51,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:51,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 215 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-30 19:40:52,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:40:52,739 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 [2018-12-30 19:40:52,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:52,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:40:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-12-30 19:40:53,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:40:53,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-12-30 19:40:53,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-30 19:40:53,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-30 19:40:53,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-12-30 19:40:53,089 INFO L87 Difference]: Start difference. First operand 1503 states and 1567 transitions. Second operand 14 states. [2018-12-30 19:40:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:56,532 INFO L93 Difference]: Finished difference Result 2876 states and 3003 transitions. [2018-12-30 19:40:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-30 19:40:56,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 282 [2018-12-30 19:40:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:56,539 INFO L225 Difference]: With dead ends: 2876 [2018-12-30 19:40:56,540 INFO L226 Difference]: Without dead ends: 1433 [2018-12-30 19:40:56,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-12-30 19:40:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2018-12-30 19:40:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2018-12-30 19:40:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-12-30 19:40:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1495 transitions. [2018-12-30 19:40:56,574 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1495 transitions. Word has length 282 [2018-12-30 19:40:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:56,574 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 1495 transitions. [2018-12-30 19:40:56,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-30 19:40:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1495 transitions. [2018-12-30 19:40:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-12-30 19:40:56,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:40:56,580 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:40:56,580 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:40:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:40:56,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1143025436, now seen corresponding path program 1 times [2018-12-30 19:40:56,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:40:56,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:40:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:56,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:40:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:40:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:40:57,075 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-30 19:40:57,515 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-12-30 19:40:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-12-30 19:40:57,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:40:57,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:40:57,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:40:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:40:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:57,654 INFO L87 Difference]: Start difference. First operand 1433 states and 1495 transitions. Second operand 5 states. [2018-12-30 19:40:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:40:58,336 INFO L93 Difference]: Finished difference Result 2753 states and 2877 transitions. [2018-12-30 19:40:58,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:40:58,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 295 [2018-12-30 19:40:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:40:58,339 INFO L225 Difference]: With dead ends: 2753 [2018-12-30 19:40:58,339 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:40:58,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:40:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:40:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:40:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:40:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:40:58,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2018-12-30 19:40:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:40:58,343 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:40:58,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:40:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:40:58,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:40:58,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:40:59,242 WARN L181 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-12-30 19:40:59,646 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-12-30 19:40:59,651 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:40:59,651 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:40:59,651 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,651 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,651 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,651 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,651 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,651 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,651 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,652 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:40:59,653 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,654 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:40:59,655 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:40:59,655 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:40:59,655 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:40:59,655 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:40:59,655 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:40:59,655 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:40:59,655 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:40:59,655 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:40:59,656 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse6 (not (= 6 ~a16~0))) (.cse14 (= ~a21~0 1)) (.cse1 (= ~a8~0 15)) (.cse16 (= ~a20~0 1)) (.cse17 (not .cse7))) (let ((.cse10 (and .cse1 .cse16 .cse17)) (.cse15 (<= ~a7~0 0)) (.cse3 (= ~a16~0 6)) (.cse13 (and .cse6 .cse7 .cse14)) (.cse12 (= ~a16~0 5)) (.cse4 (= ~a7~0 1)) (.cse5 (<= ~a21~0 0)) (.cse11 (= ~a8~0 13)) (.cse9 (<= ~a17~0 0)) (.cse2 (= ~a12~0 8)) (.cse0 (not .cse16)) (.cse8 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse2 .cse9 .cse10) (and .cse4 .cse1 .cse8 .cse9) (and .cse4 .cse5 .cse6 .cse11 .cse2 .cse7) (and .cse10 .cse3) (and .cse1 .cse9 .cse12) (and .cse4 .cse1 .cse12) (and .cse0 .cse13) (and .cse4 .cse2 .cse9 .cse12) (and .cse8 (= ~a8~0 14) .cse2 .cse9 .cse14 .cse15) (and .cse8 .cse11 .cse2 .cse9 .cse14 .cse15) (and .cse4 .cse5 .cse11 .cse2 .cse9 .cse16 .cse3) (and .cse4 .cse13) (and .cse0 .cse12) (and .cse2 .cse7 .cse14) (and .cse4 .cse5 .cse8 .cse11 .cse9 .cse2 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse0 (and .cse8 .cse17)))))) [2018-12-30 19:40:59,656 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,656 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,656 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,656 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,656 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,656 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:40:59,656 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:40:59,656 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:40:59,657 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:40:59,657 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:40:59,658 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:40:59,659 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:40:59,660 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,661 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse6 (not (= 6 ~a16~0))) (.cse12 (= ~a21~0 1)) (.cse1 (= ~a8~0 15)) (.cse16 (= ~a20~0 1)) (.cse17 (not .cse7))) (let ((.cse10 (and .cse1 .cse16 .cse17)) (.cse15 (<= ~a7~0 0)) (.cse3 (= ~a16~0 6)) (.cse14 (and .cse6 .cse7 .cse12)) (.cse13 (= ~a16~0 5)) (.cse4 (= ~a7~0 1)) (.cse5 (<= ~a21~0 0)) (.cse11 (= ~a8~0 13)) (.cse9 (<= ~a17~0 0)) (.cse2 (= ~a12~0 8)) (.cse0 (not .cse16)) (.cse8 (= ~a16~0 4))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse2 .cse9 .cse10) (and .cse4 .cse1 .cse8 .cse9) (and .cse4 .cse5 .cse6 .cse11 .cse2 .cse7) (and (and .cse7 .cse12) .cse2) (and .cse10 .cse3) (and .cse1 .cse9 .cse13) (and .cse4 .cse1 .cse13) (and .cse0 .cse14) (and .cse4 .cse2 .cse9 .cse13) (and .cse8 (= ~a8~0 14) .cse2 .cse9 .cse12 .cse15) (and .cse8 .cse11 .cse2 .cse9 .cse12 .cse15) (and .cse4 .cse5 .cse11 .cse2 .cse9 .cse16 .cse3) (and .cse4 .cse14) (and .cse0 .cse13) (and .cse4 .cse5 .cse8 .cse11 .cse9 .cse2 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse0 (and .cse8 .cse17)))))) [2018-12-30 19:40:59,661 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,661 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,661 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,661 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,661 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:40:59,661 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:40:59,661 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:40:59,662 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,663 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:40:59,664 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,665 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,666 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:40:59,666 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,666 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:40:59,667 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:40:59,668 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2018-12-30 19:40:59,669 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:40:59,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:40:59 BoogieIcfgContainer [2018-12-30 19:40:59,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:40:59,697 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:40:59,697 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:40:59,697 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:40:59,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:40:32" (3/4) ... [2018-12-30 19:40:59,702 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:40:59,727 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:40:59,728 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:40:59,933 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:40:59,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:40:59,938 INFO L168 Benchmark]: Toolchain (without parser) took 31599.10 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -291.8 MB). Peak memory consumption was 154.3 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:59,939 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:40:59,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.65 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:59,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:59,940 INFO L168 Benchmark]: Boogie Preprocessor took 116.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:59,941 INFO L168 Benchmark]: RCFGBuilder took 3186.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 939.8 MB in the end (delta: 111.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:59,941 INFO L168 Benchmark]: TraceAbstraction took 27090.65 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 373.8 MB). Free memory was 939.8 MB in the beginning and 1.3 GB in the end (delta: -331.6 MB). Peak memory consumption was 594.3 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:59,941 INFO L168 Benchmark]: Witness Printer took 236.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:40:59,944 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 779.65 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.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 183.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3186.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 939.8 MB in the end (delta: 111.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27090.65 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 373.8 MB). Free memory was 939.8 MB in the beginning and 1.3 GB in the end (delta: -331.6 MB). Peak memory consumption was 594.3 MB. Max. memory is 11.5 GB. * Witness Printer took 236.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: 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: (((((((((((((((((((!(a20 == 1) && a8 == 15) && a12 == 8) && a16 == 6) || (((((a7 == 1 && !(a20 == 1)) && a21 <= 0) && !(6 == a16)) && a12 == 8) && a17 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((a7 == 1 && a8 == 15) && a16 == 4) && a17 <= 0)) || (((((a7 == 1 && a21 <= 0) && !(6 == a16)) && a8 == 13) && a12 == 8) && a17 == 1)) || (((a8 == 15 && a20 == 1) && !(a17 == 1)) && a16 == 6)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (!(a20 == 1) && (!(6 == a16) && a17 == 1) && a21 == 1)) || (((a7 == 1 && a12 == 8) && a17 <= 0) && a16 == 5)) || (((((a16 == 4 && a8 == 14) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || ((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (a7 == 1 && (!(6 == a16) && a17 == 1) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((a12 == 8 && a17 == 1) && a21 == 1)) || ((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a17 <= 0) && a12 == 8) && input == 4)) || (!(a20 == 1) && a16 == 4 && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(a20 == 1) && a8 == 15) && a12 == 8) && a16 == 6) || (((((a7 == 1 && !(a20 == 1)) && a21 <= 0) && !(6 == a16)) && a12 == 8) && a17 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((a7 == 1 && a8 == 15) && a16 == 4) && a17 <= 0)) || (((((a7 == 1 && a21 <= 0) && !(6 == a16)) && a8 == 13) && a12 == 8) && a17 == 1)) || ((a17 == 1 && a21 == 1) && a12 == 8)) || (((a8 == 15 && a20 == 1) && !(a17 == 1)) && a16 == 6)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (!(a20 == 1) && (!(6 == a16) && a17 == 1) && a21 == 1)) || (((a7 == 1 && a12 == 8) && a17 <= 0) && a16 == 5)) || (((((a16 == 4 && a8 == 14) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || ((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (a7 == 1 && (!(6 == a16) && a17 == 1) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || ((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a17 <= 0) && a12 == 8) && input == 4)) || (!(a20 == 1) && a16 == 4 && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 26.9s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 18.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 973 SDtfs, 3196 SDslu, 185 SDs, 0 SdLazy, 8353 SolverSat, 828 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 302 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2682occurred in iteration=8, 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.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1445 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 566 HoareAnnotationTreeSize, 3 FomulaSimplifications, 793 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 334 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 3021 NumberOfCodeBlocks, 3021 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3006 ConstructedInterpolants, 0 QuantifiedInterpolants, 3254078 SizeOfPredicates, 1 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1895/1899 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...