./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label45_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_label45_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 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:42:52,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:42:52,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:42:52,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:42:52,737 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:42:52,738 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:42:52,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:42:52,743 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:42:52,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:42:52,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:42:52,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:42:52,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:42:52,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:42:52,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:42:52,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:42:52,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:42:52,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:42:52,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:42:52,774 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:42:52,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:42:52,779 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:42:52,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:42:52,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:42:52,788 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:42:52,788 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:42:52,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:42:52,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:42:52,791 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:42:52,794 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:42:52,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:42:52,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:42:52,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:42:52,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:42:52,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:42:52,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:42:52,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:42:52,804 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:42:52,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:42:52,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:42:52,831 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:42:52,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:42:52,832 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:42:52,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:42:52,832 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:42:52,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:42:52,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:42:52,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:42:52,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:42:52,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:42:52,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:42:52,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:42:52,833 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:42:52,834 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:42:52,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:42:52,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:42:52,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:42:52,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:42:52,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:42:52,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:42:52,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:42:52,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:42:52,835 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:42:52,835 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:42:52,835 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:42:52,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:42:52,836 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 -> 6c1fad4c0512d9a273ed1e7c88caaf722fcdaad1 [2018-12-30 19:42:52,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:42:52,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:42:52,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:42:52,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:42:52,913 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:42:52,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-12-30 19:42:52,985 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4665ed7/0d20129ba709400480b619eab36e2ddb/FLAG863e0a580 [2018-12-30 19:42:53,580 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:42:53,581 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label45_true-unreach-call_false-termination.c [2018-12-30 19:42:53,605 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4665ed7/0d20129ba709400480b619eab36e2ddb/FLAG863e0a580 [2018-12-30 19:42:53,797 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4665ed7/0d20129ba709400480b619eab36e2ddb [2018-12-30 19:42:53,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:42:53,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:42:53,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:42:53,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:42:53,807 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:42:53,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:42:53" (1/1) ... [2018-12-30 19:42:53,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540addd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:53, skipping insertion in model container [2018-12-30 19:42:53,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:42:53" (1/1) ... [2018-12-30 19:42:53,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:42:53,892 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:42:54,367 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:42:54,374 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:42:54,522 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:42:54,545 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:42:54,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54 WrapperNode [2018-12-30 19:42:54,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:42:54,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:42:54,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:42:54,547 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:42:54,558 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:42:54" (1/1) ... [2018-12-30 19:42:54,668 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:42:54" (1/1) ... [2018-12-30 19:42:54,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:42:54,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:42:54,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:42:54,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:42:54,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54" (1/1) ... [2018-12-30 19:42:54,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54" (1/1) ... [2018-12-30 19:42:54,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54" (1/1) ... [2018-12-30 19:42:54,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54" (1/1) ... [2018-12-30 19:42:54,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54" (1/1) ... [2018-12-30 19:42:54,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54" (1/1) ... [2018-12-30 19:42:54,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54" (1/1) ... [2018-12-30 19:42:54,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:42:54,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:42:54,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:42:54,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:42:54,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54" (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:42:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:42:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:42:57,847 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:42:57,848 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:42:57,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:42:57 BoogieIcfgContainer [2018-12-30 19:42:57,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:42:57,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:42:57,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:42:57,856 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:42:57,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:42:53" (1/3) ... [2018-12-30 19:42:57,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f1b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:42:57, skipping insertion in model container [2018-12-30 19:42:57,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:42:54" (2/3) ... [2018-12-30 19:42:57,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f1b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:42:57, skipping insertion in model container [2018-12-30 19:42:57,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:42:57" (3/3) ... [2018-12-30 19:42:57,863 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label45_true-unreach-call_false-termination.c [2018-12-30 19:42:57,876 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:42:57,894 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:42:57,918 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:42:57,977 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:42:57,978 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:42:57,978 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:42:57,979 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:42:57,979 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:42:57,980 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:42:57,980 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:42:57,981 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:42:57,981 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:42:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:42:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-30 19:42:58,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:42:58,047 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] [2018-12-30 19:42:58,054 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:42:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:42:58,063 INFO L82 PathProgramCache]: Analyzing trace with hash -286323610, now seen corresponding path program 1 times [2018-12-30 19:42:58,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:42:58,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:42:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:58,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:42:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:42:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:58,665 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:42:58,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:58,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:42:58,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:42:58,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:42:58,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:42:58,698 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2018-12-30 19:43:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:00,226 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2018-12-30 19:43:00,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:43:00,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-30 19:43:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:00,246 INFO L225 Difference]: With dead ends: 528 [2018-12-30 19:43:00,246 INFO L226 Difference]: Without dead ends: 266 [2018-12-30 19:43:00,251 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:43:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-30 19:43:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-12-30 19:43:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-30 19:43:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2018-12-30 19:43:00,323 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 117 [2018-12-30 19:43:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:00,324 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2018-12-30 19:43:00,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:43:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2018-12-30 19:43:00,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-30 19:43:00,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:00,331 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-30 19:43:00,331 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:00,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1653159310, now seen corresponding path program 1 times [2018-12-30 19:43:00,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:00,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:00,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:00,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:43:00,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:00,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:43:00,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:43:00,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:43:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:00,535 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2018-12-30 19:43:01,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:01,876 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2018-12-30 19:43:01,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:43:01,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-30 19:43:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:01,886 INFO L225 Difference]: With dead ends: 792 [2018-12-30 19:43:01,887 INFO L226 Difference]: Without dead ends: 528 [2018-12-30 19:43:01,889 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:43:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-12-30 19:43:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-12-30 19:43:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-30 19:43:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2018-12-30 19:43:01,926 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 122 [2018-12-30 19:43:01,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:01,927 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2018-12-30 19:43:01,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:43:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2018-12-30 19:43:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-30 19:43:01,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:01,933 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:43:01,933 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:01,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash -691237342, now seen corresponding path program 1 times [2018-12-30 19:43:01,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:01,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:01,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:43:02,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:02,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:43:02,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:43:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:43:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:02,094 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states. [2018-12-30 19:43:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:03,528 INFO L93 Difference]: Finished difference Result 1185 states and 1617 transitions. [2018-12-30 19:43:03,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:43:03,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2018-12-30 19:43:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:03,539 INFO L225 Difference]: With dead ends: 1185 [2018-12-30 19:43:03,539 INFO L226 Difference]: Without dead ends: 659 [2018-12-30 19:43:03,541 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:43:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-30 19:43:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528. [2018-12-30 19:43:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-30 19:43:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 714 transitions. [2018-12-30 19:43:03,568 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 714 transitions. Word has length 130 [2018-12-30 19:43:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:03,568 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 714 transitions. [2018-12-30 19:43:03,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:43:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 714 transitions. [2018-12-30 19:43:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-30 19:43:03,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:03,572 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:03,572 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:03,573 INFO L82 PathProgramCache]: Analyzing trace with hash -183469584, now seen corresponding path program 1 times [2018-12-30 19:43:03,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:03,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:03,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:03,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:03,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-30 19:43:03,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:03,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:43:03,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:43:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:43:03,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:03,719 INFO L87 Difference]: Start difference. First operand 528 states and 714 transitions. Second operand 4 states. [2018-12-30 19:43:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:06,359 INFO L93 Difference]: Finished difference Result 1971 states and 2669 transitions. [2018-12-30 19:43:06,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:43:06,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-30 19:43:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:06,367 INFO L225 Difference]: With dead ends: 1971 [2018-12-30 19:43:06,368 INFO L226 Difference]: Without dead ends: 1445 [2018-12-30 19:43:06,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2018-12-30 19:43:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2018-12-30 19:43:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-12-30 19:43:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1706 transitions. [2018-12-30 19:43:06,422 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1706 transitions. Word has length 139 [2018-12-30 19:43:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:06,422 INFO L480 AbstractCegarLoop]: Abstraction has 1314 states and 1706 transitions. [2018-12-30 19:43:06,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:43:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1706 transitions. [2018-12-30 19:43:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-30 19:43:06,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:06,428 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:06,428 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:06,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash 7667169, now seen corresponding path program 1 times [2018-12-30 19:43:06,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:06,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:06,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:06,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:06,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:06,710 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 19:43:06,956 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 19:43:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-30 19:43:07,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:07,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:43:07,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:43:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:43:07,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:43:07,006 INFO L87 Difference]: Start difference. First operand 1314 states and 1706 transitions. Second operand 4 states. [2018-12-30 19:43:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:08,057 INFO L93 Difference]: Finished difference Result 2762 states and 3564 transitions. [2018-12-30 19:43:08,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:43:08,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-30 19:43:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:08,064 INFO L225 Difference]: With dead ends: 2762 [2018-12-30 19:43:08,065 INFO L226 Difference]: Without dead ends: 1450 [2018-12-30 19:43:08,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:43:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-12-30 19:43:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2018-12-30 19:43:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-30 19:43:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1843 transitions. [2018-12-30 19:43:08,101 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1843 transitions. Word has length 145 [2018-12-30 19:43:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:08,101 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1843 transitions. [2018-12-30 19:43:08,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:43:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1843 transitions. [2018-12-30 19:43:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-30 19:43:08,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:08,106 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] [2018-12-30 19:43:08,106 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:08,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:08,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1656987991, now seen corresponding path program 1 times [2018-12-30 19:43:08,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:08,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:08,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:08,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:08,272 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:43:08,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:08,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:43:08,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:43:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:43:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:43:08,274 INFO L87 Difference]: Start difference. First operand 1445 states and 1843 transitions. Second operand 5 states. [2018-12-30 19:43:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:10,188 INFO L93 Difference]: Finished difference Result 2888 states and 3696 transitions. [2018-12-30 19:43:10,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:43:10,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-12-30 19:43:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:10,197 INFO L225 Difference]: With dead ends: 2888 [2018-12-30 19:43:10,197 INFO L226 Difference]: Without dead ends: 1576 [2018-12-30 19:43:10,199 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:43:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2018-12-30 19:43:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2018-12-30 19:43:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-12-30 19:43:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1968 transitions. [2018-12-30 19:43:10,233 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1968 transitions. Word has length 149 [2018-12-30 19:43:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:10,233 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1968 transitions. [2018-12-30 19:43:10,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:43:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1968 transitions. [2018-12-30 19:43:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-30 19:43:10,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:10,239 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] [2018-12-30 19:43:10,239 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash 945952174, now seen corresponding path program 1 times [2018-12-30 19:43:10,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:10,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:10,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:10,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:10,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:10,346 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:43:10,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:10,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:43:10,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:43:10,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:43:10,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:43:10,349 INFO L87 Difference]: Start difference. First operand 1576 states and 1968 transitions. Second operand 3 states. [2018-12-30 19:43:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:10,922 INFO L93 Difference]: Finished difference Result 3674 states and 4634 transitions. [2018-12-30 19:43:10,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:43:10,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-12-30 19:43:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:10,932 INFO L225 Difference]: With dead ends: 3674 [2018-12-30 19:43:10,932 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 19:43:10,936 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:43:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 19:43:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2018-12-30 19:43:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 19:43:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1924 transitions. [2018-12-30 19:43:10,977 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1924 transitions. Word has length 152 [2018-12-30 19:43:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:10,978 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1924 transitions. [2018-12-30 19:43:10,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:43:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1924 transitions. [2018-12-30 19:43:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-30 19:43:10,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:10,984 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] [2018-12-30 19:43:10,984 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1818027434, now seen corresponding path program 1 times [2018-12-30 19:43:10,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:10,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:10,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:11,465 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-12-30 19:43:11,498 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:43:11,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:43:11,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:43:11,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 19:43:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 19:43:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:43:11,499 INFO L87 Difference]: Start difference. First operand 1707 states and 1924 transitions. Second operand 5 states. [2018-12-30 19:43:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:12,847 INFO L93 Difference]: Finished difference Result 4591 states and 5242 transitions. [2018-12-30 19:43:12,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:43:12,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2018-12-30 19:43:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:12,861 INFO L225 Difference]: With dead ends: 4591 [2018-12-30 19:43:12,861 INFO L226 Difference]: Without dead ends: 3017 [2018-12-30 19:43:12,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 19:43:12,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2018-12-30 19:43:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2493. [2018-12-30 19:43:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2018-12-30 19:43:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2761 transitions. [2018-12-30 19:43:12,914 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2761 transitions. Word has length 167 [2018-12-30 19:43:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:12,914 INFO L480 AbstractCegarLoop]: Abstraction has 2493 states and 2761 transitions. [2018-12-30 19:43:12,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 19:43:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2761 transitions. [2018-12-30 19:43:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-30 19:43:12,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:12,923 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] [2018-12-30 19:43:12,924 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1902421532, now seen corresponding path program 1 times [2018-12-30 19:43:12,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:12,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 5 proven. 109 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-30 19:43:13,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:43:13,394 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:43:13,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:13,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:43:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-30 19:43:13,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:43:13,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-30 19:43:13,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 19:43:13,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 19:43:13,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-30 19:43:13,768 INFO L87 Difference]: Start difference. First operand 2493 states and 2761 transitions. Second operand 9 states. [2018-12-30 19:43:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:21,084 INFO L93 Difference]: Finished difference Result 5377 states and 5933 transitions. [2018-12-30 19:43:21,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 19:43:21,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 221 [2018-12-30 19:43:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:21,097 INFO L225 Difference]: With dead ends: 5377 [2018-12-30 19:43:21,098 INFO L226 Difference]: Without dead ends: 2886 [2018-12-30 19:43:21,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 223 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-30 19:43:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2018-12-30 19:43:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2231. [2018-12-30 19:43:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-12-30 19:43:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2433 transitions. [2018-12-30 19:43:21,149 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2433 transitions. Word has length 221 [2018-12-30 19:43:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:21,150 INFO L480 AbstractCegarLoop]: Abstraction has 2231 states and 2433 transitions. [2018-12-30 19:43:21,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 19:43:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2433 transitions. [2018-12-30 19:43:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-30 19:43:21,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:43:21,160 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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, 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, 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] [2018-12-30 19:43:21,160 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:43:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:43:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash -770011340, now seen corresponding path program 1 times [2018-12-30 19:43:21,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:43:21,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:43:21,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:21,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:21,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:43:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:21,547 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-30 19:43:21,807 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-30 19:43:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-30 19:43:22,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 19:43:22,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 19:43:22,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:43:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:43:22,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 19:43:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-12-30 19:43:22,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 19:43:22,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-30 19:43:22,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 19:43:22,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 19:43:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 19:43:22,392 INFO L87 Difference]: Start difference. First operand 2231 states and 2433 transitions. Second operand 7 states. [2018-12-30 19:43:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:43:23,580 INFO L93 Difference]: Finished difference Result 5384 states and 5867 transitions. [2018-12-30 19:43:23,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 19:43:23,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 260 [2018-12-30 19:43:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:43:23,581 INFO L225 Difference]: With dead ends: 5384 [2018-12-30 19:43:23,581 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:43:23,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-30 19:43:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:43:23,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:43:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:43:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:43:23,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2018-12-30 19:43:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:43:23,588 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:43:23,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 19:43:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:43:23,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:43:23,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:43:24,397 WARN L181 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2018-12-30 19:43:24,783 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-12-30 19:43:24,787 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:43:24,787 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:43:24,787 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,787 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,787 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:43:24,788 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:43:24,789 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:43:24,790 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:43:24,791 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:43:24,792 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:43:24,792 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:43:24,792 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:43:24,792 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a17~0 1)) (.cse0 (= ~a21~0 1)) (.cse4 (= ~a20~0 1)) (.cse5 (not (= 5 ~a16~0))) (.cse7 (= ~a16~0 4)) (.cse2 (= ~a7~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a16~0 5))) (or (and (<= 14 ~a8~0) .cse0 .cse1) (and .cse2 (and (not (= ~a16~0 6)) .cse3 .cse0)) (and .cse2 .cse3 .cse4 .cse1) (and (and .cse3 .cse4 .cse0) .cse5) (and .cse6 .cse0) (and .cse7 .cse0) (and .cse2 (<= ~a17~0 0) .cse4 .cse5) (and .cse2 .cse7) (and .cse2 .cse6 .cse1))) [2018-12-30 19:43:24,792 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:43:24,793 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,794 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,795 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:43:24,796 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:43:24,797 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:43:24,797 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:43:24,797 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:43:24,797 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:43:24,797 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:43:24,797 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:43:24,797 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,797 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a17~0 1)) (.cse0 (= ~a21~0 1)) (.cse4 (= ~a20~0 1)) (.cse5 (not (= 5 ~a16~0))) (.cse7 (= ~a16~0 4)) (.cse2 (= ~a7~0 1)) (.cse6 (= ~a8~0 15)) (.cse1 (= ~a16~0 5))) (or (and (<= 14 ~a8~0) .cse0 .cse1) (and .cse2 (and (not (= ~a16~0 6)) .cse3 .cse0)) (and (and (and .cse3 .cse4) .cse5) .cse0) (and .cse2 .cse3 .cse4 .cse1) (and .cse6 .cse0) (and .cse7 .cse0) (and .cse2 (<= ~a17~0 0) .cse4 .cse5) (and .cse2 .cse7) (and .cse2 .cse6 .cse1))) [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:43:24,798 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:43:24,799 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,800 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:43:24,801 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:43:24,802 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:43:24,802 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:43:24,802 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:43:24,802 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:43:24,802 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:43:24,802 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:43:24,802 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 527) no Hoare annotation was computed. [2018-12-30 19:43:24,802 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,802 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:43:24,803 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,804 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:43:24,805 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:43:24,806 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:43:24,806 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:43:24,806 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:43:24,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:43:24 BoogieIcfgContainer [2018-12-30 19:43:24,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:43:24,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:43:24,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:43:24,833 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:43:24,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:42:57" (3/4) ... [2018-12-30 19:43:24,845 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:43:24,888 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:43:24,889 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:43:25,077 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:43:25,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:43:25,079 INFO L168 Benchmark]: Toolchain (without parser) took 31277.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -120.9 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:25,080 INFO L168 Benchmark]: CDTParser took 0.21 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:43:25,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.56 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.0 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:25,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 183.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 915.0 MB in the beginning and 1.1 GB in the end (delta: -208.4 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:25,081 INFO L168 Benchmark]: Boogie Preprocessor took 106.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:25,081 INFO L168 Benchmark]: RCFGBuilder took 3011.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.3 MB). Peak memory consumption was 99.3 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:25,081 INFO L168 Benchmark]: TraceAbstraction took 26982.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -79.2 MB). Peak memory consumption was 168.3 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:25,084 INFO L168 Benchmark]: Witness Printer took 244.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-12-30 19:43:25,087 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.21 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 743.56 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.0 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 183.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 915.0 MB in the beginning and 1.1 GB in the end (delta: -208.4 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3011.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.3 MB). Peak memory consumption was 99.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26982.10 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -79.2 MB). Peak memory consumption was 168.3 MB. Max. memory is 11.5 GB. * Witness Printer took 244.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 527]: 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: (((((((((14 <= a8 && a21 == 1) && a16 == 5) || (a7 == 1 && (!(a16 == 6) && a17 == 1) && a21 == 1)) || (((a7 == 1 && a17 == 1) && a20 == 1) && a16 == 5)) || (((a17 == 1 && a20 == 1) && a21 == 1) && !(5 == a16))) || (a8 == 15 && a21 == 1)) || (a16 == 4 && a21 == 1)) || (((a7 == 1 && a17 <= 0) && a20 == 1) && !(5 == a16))) || (a7 == 1 && a16 == 4)) || ((a7 == 1 && a8 == 15) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((14 <= a8 && a21 == 1) && a16 == 5) || (a7 == 1 && (!(a16 == 6) && a17 == 1) && a21 == 1)) || (((a17 == 1 && a20 == 1) && !(5 == a16)) && a21 == 1)) || (((a7 == 1 && a17 == 1) && a20 == 1) && a16 == 5)) || (a8 == 15 && a21 == 1)) || (a16 == 4 && a21 == 1)) || (((a7 == 1 && a17 <= 0) && a20 == 1) && !(5 == a16))) || (a7 == 1 && a16 == 4)) || ((a7 == 1 && a8 == 15) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 26.8s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 20.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 572 SDtfs, 3511 SDslu, 174 SDs, 0 SdLazy, 8055 SolverSat, 964 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 531 GetRequests, 493 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1708 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 63 NumberOfFragments, 200 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4184 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 643 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2083 NumberOfCodeBlocks, 2083 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2071 ConstructedInterpolants, 0 QuantifiedInterpolants, 862658 SizeOfPredicates, 2 NumberOfNonLiveVariables, 799 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 962/1098 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...