./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem03_label46_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem03_label46_true-unreach-call.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 040c0aaac4458e8ce6521748c6e651f82b542145 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 01:05:19,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 01:05:19,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 01:05:19,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 01:05:19,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 01:05:19,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 01:05:19,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 01:05:19,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 01:05:19,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 01:05:19,765 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 01:05:19,766 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 01:05:19,769 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 01:05:19,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 01:05:19,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 01:05:19,772 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 01:05:19,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 01:05:19,776 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 01:05:19,781 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 01:05:19,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 01:05:19,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 01:05:19,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 01:05:19,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 01:05:19,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 01:05:19,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 01:05:19,799 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 01:05:19,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 01:05:19,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 01:05:19,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 01:05:19,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 01:05:19,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 01:05:19,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 01:05:19,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 01:05:19,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 01:05:19,810 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 01:05:19,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 01:05:19,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 01:05:19,817 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 01:05:19,842 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 01:05:19,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 01:05:19,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 01:05:19,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 01:05:19,845 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 01:05:19,845 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 01:05:19,846 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 01:05:19,846 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 01:05:19,846 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 01:05:19,846 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 01:05:19,846 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 01:05:19,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 01:05:19,848 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 01:05:19,849 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 01:05:19,849 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 01:05:19,849 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 01:05:19,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 01:05:19,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 01:05:19,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 01:05:19,850 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 01:05:19,850 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 01:05:19,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 01:05:19,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 01:05:19,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 01:05:19,851 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 01:05:19,851 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 01:05:19,851 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 01:05:19,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 01:05:19,852 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 -> 040c0aaac4458e8ce6521748c6e651f82b542145 [2019-01-12 01:05:19,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 01:05:19,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 01:05:19,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 01:05:19,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 01:05:19,937 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 01:05:19,938 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem03_label46_true-unreach-call.c [2019-01-12 01:05:19,999 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff247593c/c7d21ee6ecfc4ee3aeffed3722ba2f09/FLAGc2ad74802 [2019-01-12 01:05:20,642 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 01:05:20,643 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem03_label46_true-unreach-call.c [2019-01-12 01:05:20,658 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff247593c/c7d21ee6ecfc4ee3aeffed3722ba2f09/FLAGc2ad74802 [2019-01-12 01:05:20,809 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff247593c/c7d21ee6ecfc4ee3aeffed3722ba2f09 [2019-01-12 01:05:20,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 01:05:20,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 01:05:20,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 01:05:20,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 01:05:20,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 01:05:20,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 01:05:20" (1/1) ... [2019-01-12 01:05:20,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5636bad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:20, skipping insertion in model container [2019-01-12 01:05:20,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 01:05:20" (1/1) ... [2019-01-12 01:05:20,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 01:05:20,925 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 01:05:21,652 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 01:05:21,660 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 01:05:22,101 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 01:05:22,273 INFO L195 MainTranslator]: Completed translation [2019-01-12 01:05:22,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22 WrapperNode [2019-01-12 01:05:22,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 01:05:22,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 01:05:22,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 01:05:22,276 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 01:05:22,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... [2019-01-12 01:05:22,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... [2019-01-12 01:05:22,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 01:05:22,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 01:05:22,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 01:05:22,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 01:05:22,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... [2019-01-12 01:05:22,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... [2019-01-12 01:05:22,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... [2019-01-12 01:05:22,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... [2019-01-12 01:05:22,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... [2019-01-12 01:05:22,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... [2019-01-12 01:05:22,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... [2019-01-12 01:05:22,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 01:05:22,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 01:05:22,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 01:05:22,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 01:05:22,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 01:05:22,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 01:05:22,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 01:05:27,162 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 01:05:27,163 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 01:05:27,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:05:27 BoogieIcfgContainer [2019-01-12 01:05:27,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 01:05:27,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 01:05:27,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 01:05:27,169 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 01:05:27,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 01:05:20" (1/3) ... [2019-01-12 01:05:27,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1476d23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 01:05:27, skipping insertion in model container [2019-01-12 01:05:27,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:22" (2/3) ... [2019-01-12 01:05:27,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1476d23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 01:05:27, skipping insertion in model container [2019-01-12 01:05:27,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:05:27" (3/3) ... [2019-01-12 01:05:27,174 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label46_true-unreach-call.c [2019-01-12 01:05:27,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 01:05:27,194 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 01:05:27,212 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 01:05:27,260 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 01:05:27,261 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 01:05:27,261 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 01:05:27,261 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 01:05:27,261 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 01:05:27,261 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 01:05:27,261 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 01:05:27,261 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 01:05:27,261 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 01:05:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-01-12 01:05:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-12 01:05:27,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:27,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:27,308 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:27,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:27,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1730728613, now seen corresponding path program 1 times [2019-01-12 01:05:27,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:27,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:27,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:27,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:27,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:05:28,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:28,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:05:28,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:05:28,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:05:28,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:28,471 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-01-12 01:05:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:31,797 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-01-12 01:05:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:05:31,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-01-12 01:05:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:31,831 INFO L225 Difference]: With dead ends: 1068 [2019-01-12 01:05:31,831 INFO L226 Difference]: Without dead ends: 670 [2019-01-12 01:05:31,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-01-12 01:05:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-01-12 01:05:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-01-12 01:05:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-01-12 01:05:31,925 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 185 [2019-01-12 01:05:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:31,926 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-01-12 01:05:31,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:05:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-01-12 01:05:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-12 01:05:31,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:31,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:31,934 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:31,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:31,936 INFO L82 PathProgramCache]: Analyzing trace with hash 689139339, now seen corresponding path program 1 times [2019-01-12 01:05:31,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:31,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:31,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:31,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:31,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:05:32,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:32,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:05:32,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:05:32,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:05:32,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:32,214 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-01-12 01:05:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:34,627 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-01-12 01:05:34,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:05:34,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-01-12 01:05:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:34,637 INFO L225 Difference]: With dead ends: 1762 [2019-01-12 01:05:34,637 INFO L226 Difference]: Without dead ends: 1308 [2019-01-12 01:05:34,639 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 [2019-01-12 01:05:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-01-12 01:05:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-01-12 01:05:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-01-12 01:05:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-01-12 01:05:34,683 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 190 [2019-01-12 01:05:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:34,683 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-01-12 01:05:34,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:05:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-01-12 01:05:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-12 01:05:34,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:34,689 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:34,689 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:34,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:34,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1152691044, now seen corresponding path program 1 times [2019-01-12 01:05:34,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:34,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:34,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:34,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:05:34,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:34,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:05:34,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:05:34,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:05:34,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:34,792 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-01-12 01:05:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:37,315 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-01-12 01:05:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:05:37,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-01-12 01:05:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:37,327 INFO L225 Difference]: With dead ends: 2567 [2019-01-12 01:05:37,327 INFO L226 Difference]: Without dead ends: 1700 [2019-01-12 01:05:37,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-01-12 01:05:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-01-12 01:05:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-01-12 01:05:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-01-12 01:05:37,373 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 193 [2019-01-12 01:05:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:37,373 INFO L480 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-01-12 01:05:37,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:05:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-01-12 01:05:37,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-12 01:05:37,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:37,380 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:37,380 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:37,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1740913381, now seen corresponding path program 1 times [2019-01-12 01:05:37,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:37,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:37,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 01:05:37,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:37,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:05:37,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:05:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:05:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:37,577 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-01-12 01:05:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:38,870 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-01-12 01:05:38,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:05:38,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-01-12 01:05:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:38,884 INFO L225 Difference]: With dead ends: 4189 [2019-01-12 01:05:38,885 INFO L226 Difference]: Without dead ends: 2508 [2019-01-12 01:05:38,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:38,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-01-12 01:05:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-01-12 01:05:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-01-12 01:05:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-01-12 01:05:38,945 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 200 [2019-01-12 01:05:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:38,945 INFO L480 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-01-12 01:05:38,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:05:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-01-12 01:05:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-12 01:05:38,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:38,954 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:38,954 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1587791275, now seen corresponding path program 1 times [2019-01-12 01:05:38,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:38,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:38,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 01:05:39,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:39,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:05:39,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:05:39,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:05:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:39,139 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-01-12 01:05:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:39,867 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-01-12 01:05:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:05:39,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-01-12 01:05:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:39,887 INFO L225 Difference]: With dead ends: 7497 [2019-01-12 01:05:39,887 INFO L226 Difference]: Without dead ends: 4992 [2019-01-12 01:05:39,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-01-12 01:05:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-01-12 01:05:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-01-12 01:05:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-01-12 01:05:39,979 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 205 [2019-01-12 01:05:39,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:39,979 INFO L480 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-01-12 01:05:39,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:05:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-01-12 01:05:39,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-12 01:05:39,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:39,991 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:39,991 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:39,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:39,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1507804289, now seen corresponding path program 1 times [2019-01-12 01:05:39,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:39,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:39,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:39,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:39,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 01:05:40,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:05:40,155 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 01:05:40,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:40,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:05:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 01:05:40,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:05:40,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-01-12 01:05:40,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:05:40,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:05:40,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:40,438 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 4 states. [2019-01-12 01:05:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:41,976 INFO L93 Difference]: Finished difference Result 19911 states and 28122 transitions. [2019-01-12 01:05:41,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:05:41,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-01-12 01:05:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:42,031 INFO L225 Difference]: With dead ends: 19911 [2019-01-12 01:05:42,032 INFO L226 Difference]: Without dead ends: 14924 [2019-01-12 01:05:42,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14924 states. [2019-01-12 01:05:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14924 to 9941. [2019-01-12 01:05:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9941 states. [2019-01-12 01:05:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9941 states to 9941 states and 14011 transitions. [2019-01-12 01:05:42,260 INFO L78 Accepts]: Start accepts. Automaton has 9941 states and 14011 transitions. Word has length 214 [2019-01-12 01:05:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:42,260 INFO L480 AbstractCegarLoop]: Abstraction has 9941 states and 14011 transitions. [2019-01-12 01:05:42,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:05:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 9941 states and 14011 transitions. [2019-01-12 01:05:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-01-12 01:05:42,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:42,283 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:42,284 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1558518551, now seen corresponding path program 1 times [2019-01-12 01:05:42,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:42,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:42,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:42,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:42,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:42,780 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 01:05:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:05:42,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:42,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 01:05:42,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 01:05:42,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 01:05:42,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 01:05:42,833 INFO L87 Difference]: Start difference. First operand 9941 states and 14011 transitions. Second operand 5 states. [2019-01-12 01:05:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:45,768 INFO L93 Difference]: Finished difference Result 22383 states and 31798 transitions. [2019-01-12 01:05:45,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 01:05:45,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-01-12 01:05:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:45,804 INFO L225 Difference]: With dead ends: 22383 [2019-01-12 01:05:45,805 INFO L226 Difference]: Without dead ends: 12444 [2019-01-12 01:05:45,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 01:05:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12444 states. [2019-01-12 01:05:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12444 to 10753. [2019-01-12 01:05:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10753 states. [2019-01-12 01:05:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10753 states to 10753 states and 15161 transitions. [2019-01-12 01:05:45,995 INFO L78 Accepts]: Start accepts. Automaton has 10753 states and 15161 transitions. Word has length 223 [2019-01-12 01:05:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:45,996 INFO L480 AbstractCegarLoop]: Abstraction has 10753 states and 15161 transitions. [2019-01-12 01:05:45,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 01:05:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10753 states and 15161 transitions. [2019-01-12 01:05:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-01-12 01:05:46,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:46,018 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:46,019 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:46,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:46,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1779815714, now seen corresponding path program 1 times [2019-01-12 01:05:46,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:46,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:46,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:46,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:46,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 01:05:46,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:46,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:05:46,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:05:46,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:05:46,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:46,157 INFO L87 Difference]: Start difference. First operand 10753 states and 15161 transitions. Second operand 3 states. [2019-01-12 01:05:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:48,364 INFO L93 Difference]: Finished difference Result 21528 states and 30366 transitions. [2019-01-12 01:05:48,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:05:48,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-01-12 01:05:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:48,390 INFO L225 Difference]: With dead ends: 21528 [2019-01-12 01:05:48,390 INFO L226 Difference]: Without dead ends: 10777 [2019-01-12 01:05:48,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10777 states. [2019-01-12 01:05:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10777 to 10753. [2019-01-12 01:05:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10753 states. [2019-01-12 01:05:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10753 states to 10753 states and 14375 transitions. [2019-01-12 01:05:48,562 INFO L78 Accepts]: Start accepts. Automaton has 10753 states and 14375 transitions. Word has length 223 [2019-01-12 01:05:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:48,563 INFO L480 AbstractCegarLoop]: Abstraction has 10753 states and 14375 transitions. [2019-01-12 01:05:48,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:05:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 10753 states and 14375 transitions. [2019-01-12 01:05:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-01-12 01:05:48,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:48,579 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:48,580 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:48,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:48,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1292769297, now seen corresponding path program 1 times [2019-01-12 01:05:48,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:48,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:48,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:48,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:48,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-12 01:05:48,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:48,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:05:48,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:05:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:05:48,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:48,715 INFO L87 Difference]: Start difference. First operand 10753 states and 14375 transitions. Second operand 4 states. [2019-01-12 01:05:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:50,741 INFO L93 Difference]: Finished difference Result 39422 states and 52598 transitions. [2019-01-12 01:05:50,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:05:50,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-01-12 01:05:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:50,774 INFO L225 Difference]: With dead ends: 39422 [2019-01-12 01:05:50,774 INFO L226 Difference]: Without dead ends: 28671 [2019-01-12 01:05:50,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28671 states. [2019-01-12 01:05:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28671 to 20102. [2019-01-12 01:05:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20102 states. [2019-01-12 01:05:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20102 states to 20102 states and 25989 transitions. [2019-01-12 01:05:51,106 INFO L78 Accepts]: Start accepts. Automaton has 20102 states and 25989 transitions. Word has length 223 [2019-01-12 01:05:51,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:51,106 INFO L480 AbstractCegarLoop]: Abstraction has 20102 states and 25989 transitions. [2019-01-12 01:05:51,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:05:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20102 states and 25989 transitions. [2019-01-12 01:05:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-01-12 01:05:51,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:51,142 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:51,143 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash 959111984, now seen corresponding path program 1 times [2019-01-12 01:05:51,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:51,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:51,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:51,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-12 01:05:51,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:51,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:05:51,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:05:51,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:05:51,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:51,331 INFO L87 Difference]: Start difference. First operand 20102 states and 25989 transitions. Second operand 3 states. [2019-01-12 01:05:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:53,822 INFO L93 Difference]: Finished difference Result 55435 states and 71367 transitions. [2019-01-12 01:05:53,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:05:53,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-01-12 01:05:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:53,854 INFO L225 Difference]: With dead ends: 55435 [2019-01-12 01:05:53,854 INFO L226 Difference]: Without dead ends: 35335 [2019-01-12 01:05:53,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35335 states. [2019-01-12 01:05:54,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35335 to 35327. [2019-01-12 01:05:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35327 states. [2019-01-12 01:05:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35327 states to 35327 states and 41596 transitions. [2019-01-12 01:05:54,480 INFO L78 Accepts]: Start accepts. Automaton has 35327 states and 41596 transitions. Word has length 229 [2019-01-12 01:05:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:54,480 INFO L480 AbstractCegarLoop]: Abstraction has 35327 states and 41596 transitions. [2019-01-12 01:05:54,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:05:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 35327 states and 41596 transitions. [2019-01-12 01:05:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-12 01:05:54,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:54,506 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:54,507 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1066196502, now seen corresponding path program 1 times [2019-01-12 01:05:54,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:54,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:54,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:54,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:54,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:05:54,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:54,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:05:54,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:05:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:05:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:54,705 INFO L87 Difference]: Start difference. First operand 35327 states and 41596 transitions. Second operand 4 states. [2019-01-12 01:05:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:56,467 INFO L93 Difference]: Finished difference Result 83855 states and 99979 transitions. [2019-01-12 01:05:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:05:56,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-01-12 01:05:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:56,517 INFO L225 Difference]: With dead ends: 83855 [2019-01-12 01:05:56,517 INFO L226 Difference]: Without dead ends: 48530 [2019-01-12 01:05:56,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-01-12 01:05:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 48522. [2019-01-12 01:05:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48522 states. [2019-01-12 01:05:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48522 states to 48522 states and 55717 transitions. [2019-01-12 01:05:57,558 INFO L78 Accepts]: Start accepts. Automaton has 48522 states and 55717 transitions. Word has length 240 [2019-01-12 01:05:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:57,558 INFO L480 AbstractCegarLoop]: Abstraction has 48522 states and 55717 transitions. [2019-01-12 01:05:57,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:05:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48522 states and 55717 transitions. [2019-01-12 01:05:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-12 01:05:57,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:57,578 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:57,578 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:57,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1317057987, now seen corresponding path program 1 times [2019-01-12 01:05:57,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:57,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:57,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-12 01:05:57,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:57,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:05:57,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:05:57,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:05:57,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:57,755 INFO L87 Difference]: Start difference. First operand 48522 states and 55717 transitions. Second operand 3 states. [2019-01-12 01:05:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:58,577 INFO L93 Difference]: Finished difference Result 95951 states and 110137 transitions. [2019-01-12 01:05:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:05:58,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-01-12 01:05:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:58,624 INFO L225 Difference]: With dead ends: 95951 [2019-01-12 01:05:58,625 INFO L226 Difference]: Without dead ends: 47431 [2019-01-12 01:05:58,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47431 states. [2019-01-12 01:05:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47431 to 47431. [2019-01-12 01:05:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47431 states. [2019-01-12 01:05:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47431 states to 47431 states and 53922 transitions. [2019-01-12 01:05:59,606 INFO L78 Accepts]: Start accepts. Automaton has 47431 states and 53922 transitions. Word has length 272 [2019-01-12 01:05:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:59,606 INFO L480 AbstractCegarLoop]: Abstraction has 47431 states and 53922 transitions. [2019-01-12 01:05:59,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:05:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 47431 states and 53922 transitions. [2019-01-12 01:05:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-01-12 01:05:59,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:59,620 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:05:59,620 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:59,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:59,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2040139229, now seen corresponding path program 1 times [2019-01-12 01:05:59,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:59,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:59,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:59,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:59,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:59,922 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 01:06:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-12 01:06:00,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:00,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:06:00,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:06:00,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:06:00,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:06:00,022 INFO L87 Difference]: Start difference. First operand 47431 states and 53922 transitions. Second operand 4 states. [2019-01-12 01:06:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:02,577 INFO L93 Difference]: Finished difference Result 129032 states and 147128 transitions. [2019-01-12 01:06:02,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:06:02,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-01-12 01:06:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:02,674 INFO L225 Difference]: With dead ends: 129032 [2019-01-12 01:06:02,674 INFO L226 Difference]: Without dead ends: 81603 [2019-01-12 01:06:02,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:06:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81603 states. [2019-01-12 01:06:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81603 to 59205. [2019-01-12 01:06:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59205 states. [2019-01-12 01:06:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59205 states to 59205 states and 67869 transitions. [2019-01-12 01:06:04,267 INFO L78 Accepts]: Start accepts. Automaton has 59205 states and 67869 transitions. Word has length 283 [2019-01-12 01:06:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:04,267 INFO L480 AbstractCegarLoop]: Abstraction has 59205 states and 67869 transitions. [2019-01-12 01:06:04,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:06:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 59205 states and 67869 transitions. [2019-01-12 01:06:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-12 01:06:04,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:04,304 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 01:06:04,305 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1305533371, now seen corresponding path program 1 times [2019-01-12 01:06:04,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:04,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:04,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 01:06:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:04,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:06:04,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:06:04,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:06:04,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:04,593 INFO L87 Difference]: Start difference. First operand 59205 states and 67869 transitions. Second operand 3 states. [2019-01-12 01:06:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:05,569 INFO L93 Difference]: Finished difference Result 118400 states and 135728 transitions. [2019-01-12 01:06:05,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:06:05,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-01-12 01:06:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:05,620 INFO L225 Difference]: With dead ends: 118400 [2019-01-12 01:06:05,620 INFO L226 Difference]: Without dead ends: 59197 [2019-01-12 01:06:05,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59197 states. [2019-01-12 01:06:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59197 to 59197. [2019-01-12 01:06:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59197 states. [2019-01-12 01:06:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59197 states to 59197 states and 67853 transitions. [2019-01-12 01:06:07,065 INFO L78 Accepts]: Start accepts. Automaton has 59197 states and 67853 transitions. Word has length 310 [2019-01-12 01:06:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:07,065 INFO L480 AbstractCegarLoop]: Abstraction has 59197 states and 67853 transitions. [2019-01-12 01:06:07,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:06:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 59197 states and 67853 transitions. [2019-01-12 01:06:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-12 01:06:07,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:07,092 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:06:07,092 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:07,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:07,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1481379333, now seen corresponding path program 1 times [2019-01-12 01:06:07,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:07,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:07,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:07,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:07,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:07,437 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 01:06:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-01-12 01:06:07,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:06:07,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 01:06:07,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:07,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:06:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 01:06:07,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:06:07,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 01:06:07,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 01:06:07,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 01:06:07,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 01:06:07,832 INFO L87 Difference]: Start difference. First operand 59197 states and 67853 transitions. Second operand 6 states. [2019-01-12 01:06:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:11,856 INFO L93 Difference]: Finished difference Result 183323 states and 209775 transitions. [2019-01-12 01:06:11,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 01:06:11,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 316 [2019-01-12 01:06:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:12,657 INFO L225 Difference]: With dead ends: 183323 [2019-01-12 01:06:12,657 INFO L226 Difference]: Without dead ends: 124128 [2019-01-12 01:06:12,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 01:06:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124128 states. [2019-01-12 01:06:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124128 to 123249. [2019-01-12 01:06:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123249 states. [2019-01-12 01:06:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123249 states to 123249 states and 137985 transitions. [2019-01-12 01:06:13,782 INFO L78 Accepts]: Start accepts. Automaton has 123249 states and 137985 transitions. Word has length 316 [2019-01-12 01:06:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:13,783 INFO L480 AbstractCegarLoop]: Abstraction has 123249 states and 137985 transitions. [2019-01-12 01:06:13,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 01:06:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 123249 states and 137985 transitions. [2019-01-12 01:06:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-12 01:06:13,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:13,807 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:06:13,807 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash 970355755, now seen corresponding path program 1 times [2019-01-12 01:06:13,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:13,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:13,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:14,143 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:06:14,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:14,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:06:14,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:06:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:06:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:14,145 INFO L87 Difference]: Start difference. First operand 123249 states and 137985 transitions. Second operand 3 states. [2019-01-12 01:06:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:16,185 INFO L93 Difference]: Finished difference Result 252237 states and 282982 transitions. [2019-01-12 01:06:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:06:16,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-01-12 01:06:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:19,276 INFO L225 Difference]: With dead ends: 252237 [2019-01-12 01:06:19,276 INFO L226 Difference]: Without dead ends: 128990 [2019-01-12 01:06:19,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128990 states. [2019-01-12 01:06:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128990 to 128987. [2019-01-12 01:06:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128987 states. [2019-01-12 01:06:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128987 states to 128987 states and 143779 transitions. [2019-01-12 01:06:20,423 INFO L78 Accepts]: Start accepts. Automaton has 128987 states and 143779 transitions. Word has length 336 [2019-01-12 01:06:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:20,423 INFO L480 AbstractCegarLoop]: Abstraction has 128987 states and 143779 transitions. [2019-01-12 01:06:20,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:06:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 128987 states and 143779 transitions. [2019-01-12 01:06:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-01-12 01:06:20,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:20,447 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:06:20,447 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1175765495, now seen corresponding path program 1 times [2019-01-12 01:06:20,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:20,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:20,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-12 01:06:20,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:20,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:06:20,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:06:20,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:06:20,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:06:20,795 INFO L87 Difference]: Start difference. First operand 128987 states and 143779 transitions. Second operand 4 states. [2019-01-12 01:06:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:23,758 INFO L93 Difference]: Finished difference Result 269211 states and 300510 transitions. [2019-01-12 01:06:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:06:23,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2019-01-12 01:06:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:23,883 INFO L225 Difference]: With dead ends: 269211 [2019-01-12 01:06:23,883 INFO L226 Difference]: Without dead ends: 140226 [2019-01-12 01:06:23,929 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 [2019-01-12 01:06:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140226 states. [2019-01-12 01:06:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140226 to 140185. [2019-01-12 01:06:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140185 states. [2019-01-12 01:06:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140185 states to 140185 states and 155938 transitions. [2019-01-12 01:06:25,148 INFO L78 Accepts]: Start accepts. Automaton has 140185 states and 155938 transitions. Word has length 342 [2019-01-12 01:06:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:25,148 INFO L480 AbstractCegarLoop]: Abstraction has 140185 states and 155938 transitions. [2019-01-12 01:06:25,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:06:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 140185 states and 155938 transitions. [2019-01-12 01:06:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-12 01:06:25,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:25,180 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 01:06:25,180 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:25,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1542390012, now seen corresponding path program 1 times [2019-01-12 01:06:25,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:25,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:25,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:25,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:25,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-01-12 01:06:25,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:25,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:06:25,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:06:25,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:06:25,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:06:25,695 INFO L87 Difference]: Start difference. First operand 140185 states and 155938 transitions. Second operand 4 states. [2019-01-12 01:06:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:28,183 INFO L93 Difference]: Finished difference Result 498889 states and 555294 transitions. [2019-01-12 01:06:28,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:06:28,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2019-01-12 01:06:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:28,587 INFO L225 Difference]: With dead ends: 498889 [2019-01-12 01:06:28,587 INFO L226 Difference]: Without dead ends: 358706 [2019-01-12 01:06:28,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:06:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358706 states. [2019-01-12 01:06:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358706 to 224231. [2019-01-12 01:06:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224231 states. [2019-01-12 01:06:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224231 states to 224231 states and 249775 transitions. [2019-01-12 01:06:32,274 INFO L78 Accepts]: Start accepts. Automaton has 224231 states and 249775 transitions. Word has length 370 [2019-01-12 01:06:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:32,275 INFO L480 AbstractCegarLoop]: Abstraction has 224231 states and 249775 transitions. [2019-01-12 01:06:32,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:06:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 224231 states and 249775 transitions. [2019-01-12 01:06:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-12 01:06:32,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:32,318 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 01:06:32,318 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:32,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1941896442, now seen corresponding path program 1 times [2019-01-12 01:06:32,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:32,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:32,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:32,760 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 01:06:33,035 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 01:06:33,291 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-12 01:06:33,487 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-12 01:06:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 188 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:06:34,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:06:34,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 01:06:34,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:35,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:06:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-01-12 01:06:35,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:06:35,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-01-12 01:06:35,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 01:06:35,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 01:06:35,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-12 01:06:35,346 INFO L87 Difference]: Start difference. First operand 224231 states and 249775 transitions. Second operand 10 states. [2019-01-12 01:06:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:44,785 INFO L93 Difference]: Finished difference Result 683143 states and 760405 transitions. [2019-01-12 01:06:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 01:06:44,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 370 [2019-01-12 01:06:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:44,787 INFO L225 Difference]: With dead ends: 683143 [2019-01-12 01:06:44,787 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 01:06:44,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-12 01:06:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 01:06:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 01:06:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 01:06:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 01:06:44,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 370 [2019-01-12 01:06:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:44,953 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 01:06:44,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 01:06:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 01:06:44,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 01:06:44,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 01:06:59,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:59,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:05,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:05,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:09,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:10,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:11,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:11,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:11,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:11,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:11,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:11,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:11,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:11,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:11,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:12,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:12,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:12,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:12,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:12,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:12,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:12,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:13,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:13,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:13,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:13,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:13,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:13,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:13,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:14,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:14,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:14,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:14,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:14,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:14,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:14,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:15,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:15,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:15,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:15,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:15,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:16,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:16,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:16,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:16,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:17,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:17,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:17,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:17,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:17,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:18,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:18,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:18,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:18,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:18,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:18,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:18,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:18,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:19,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:19,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:19,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:19,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:20,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:20,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:20,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:20,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:20,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:21,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:21,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:21,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:21,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:21,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:21,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:24,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:24,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:25,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:25,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:25,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:25,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:25,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:26,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:26,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:26,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:27,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:27,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:28,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:28,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:29,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:29,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:29,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:29,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:31,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:31,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:31,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:32,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:33,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:33,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:34,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:35,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:36,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:36,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:37,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:37,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:38,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:38,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:38,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:39,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:39,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:40,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:40,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:41,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:42,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:44,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:45,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:45,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:45,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:45,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:46,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:46,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:46,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:47,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:47,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:47,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:47,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:48,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:48,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:48,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:48,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:49,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:50,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:50,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:50,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:50,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:51,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:51,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:52,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:52,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:53,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:53,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:53,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:53,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:54,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:55,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:55,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:56,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:57,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:57,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:58,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:58,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:58,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:00,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:00,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:01,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:02,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:02,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:03,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:04,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:08,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:09,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:09,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:10,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:11,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:12,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:13,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:14,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:15,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:17,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:18,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:18,918 WARN L181 SmtUtils]: Spent 1.57 m on a formula simplification. DAG size of input: 4121 DAG size of output: 2898 [2019-01-12 01:08:32,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:32,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:37,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:37,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:41,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:42,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:43,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:43,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:43,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:43,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:43,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:43,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:44,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:44,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:44,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:44,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:44,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:45,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:45,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:45,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:45,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:45,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:45,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:45,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:46,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:46,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:46,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:46,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:46,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:46,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:46,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:47,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:47,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:47,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:47,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:48,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:48,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:48,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:48,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:48,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:49,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:49,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:49,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:49,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:49,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:49,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:50,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:50,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:50,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:50,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:50,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:50,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:50,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:50,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:51,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:51,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:51,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:52,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:52,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:52,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:52,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:52,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:53,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:53,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:53,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:53,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:55,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:56,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:57,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:57,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:57,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:57,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:57,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:58,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:58,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:58,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:59,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:08:59,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:00,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:00,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:01,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:01,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:01,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:01,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:02,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:03,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:03,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:04,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:04,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:05,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:05,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:07,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:08,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:08,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:09,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:09,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:10,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:10,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:10,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:10,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:11,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:12,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:12,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:12,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:14,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:16,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:17,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:17,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:17,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:18,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:18,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:18,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:19,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:19,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:19,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:19,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:20,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:20,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:20,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:21,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:21,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:21,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:22,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:22,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:22,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:23,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:24,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:24,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:25,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:25,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:26,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:26,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:26,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:26,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:27,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:28,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:28,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:29,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:30,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:30,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:31,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:31,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:31,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:33,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:33,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:34,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:35,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:35,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:36,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:36,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:41,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:42,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:42,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:43,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:44,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:45,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:46,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:47,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:49,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:50,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:51,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:09:52,162 WARN L181 SmtUtils]: Spent 1.55 m on a formula simplification. DAG size of input: 4121 DAG size of output: 2898 [2019-01-12 01:11:56,538 WARN L181 SmtUtils]: Spent 2.07 m on a formula simplification. DAG size of input: 2775 DAG size of output: 142 [2019-01-12 01:13:58,747 WARN L181 SmtUtils]: Spent 2.04 m on a formula simplification. DAG size of input: 2775 DAG size of output: 142 [2019-01-12 01:13:58,751 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:13:58,751 INFO L448 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,752 INFO L448 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,753 INFO L448 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,754 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,755 INFO L448 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,755 INFO L448 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,755 INFO L448 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,755 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,755 INFO L448 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-01-12 01:13:58,755 INFO L448 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-01-12 01:13:58,755 INFO L448 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-01-12 01:13:58,755 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,755 INFO L448 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1590) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,756 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,757 INFO L448 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-01-12 01:13:58,758 INFO L448 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-01-12 01:13:58,759 INFO L448 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-01-12 01:13:58,760 INFO L448 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,761 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,762 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:13:58,763 INFO L448 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:13:58,764 INFO L448 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-01-12 01:13:58,764 INFO L448 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-01-12 01:13:58,764 INFO L448 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-01-12 01:13:58,764 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,764 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,764 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,765 INFO L444 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse10 (= ~a27~0 1)) (.cse3 (= ~a6~0 1)) (.cse2 (= ~a12~0 1))) (let ((.cse11 (= ~a26~0 1)) (.cse1 (= ~a18~0 1)) (.cse13 (= ~a15~0 1)) (.cse18 (not .cse2)) (.cse8 (not .cse3)) (.cse6 (not (= ~a11~0 1))) (.cse30 (not .cse10)) (.cse25 (not (= ~a20~0 1))) (.cse5 (= ~a5~0 1)) (.cse22 (= ~a16~0 1))) (let ((.cse24 (and .cse25 .cse10 .cse5 .cse22)) (.cse17 (and .cse30 .cse22)) (.cse19 (and .cse30 .cse22 .cse6)) (.cse15 (and .cse18 .cse10 .cse8 .cse5)) (.cse14 (and .cse18 .cse25)) (.cse26 (and (and .cse18 .cse30 .cse22) .cse8)) (.cse28 (and .cse2 .cse8 .cse6)) (.cse12 (or (= ~a8~0 1) (and .cse1 (= ~a4~0 1) (= ~a22~0 1) .cse5 (= ~a29~0 1) .cse13) .cse3)) (.cse0 (not (= ~a7~0 1))) (.cse23 (and .cse18 .cse6)) (.cse7 (= ~a3~0 1)) (.cse29 (not .cse11)) (.cse21 (<= ~a7~0 0)) (.cse20 (<= ~a3~0 0)) (.cse27 (and .cse18 .cse10 .cse8 .cse22)) (.cse4 (<= ~a26~0 0)) (.cse16 (<= ~a6~0 0)) (.cse9 (<= 2 ~a3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse5 .cse11) (and .cse1 .cse12 .cse5 .cse11 .cse13 .cse14) (and .cse9 (and .cse0 .cse1 .cse15)) (and .cse0 .cse16 .cse1 .cse2 .cse5 .cse11 .cse17) (and .cse1 .cse9 .cse10 .cse12 .cse4 .cse5 .cse6) (and .cse18 .cse1 .cse9 .cse12 .cse5 .cse11) (and .cse0 .cse6 .cse1 .cse10 .cse5 .cse11) (and .cse19 .cse20 .cse1 .cse2 .cse4 .cse5 .cse21) (and .cse0 .cse1 (and .cse10 .cse8 .cse5 .cse22) .cse11) (and .cse12 (and .cse0 .cse1 .cse18 .cse5 .cse11 .cse13)) (and (and .cse23 .cse5) .cse1 .cse9 .cse12) (and .cse1 .cse9 .cse11 .cse24) (and (and .cse0 .cse1 .cse5 .cse11 .cse6) .cse12) (and .cse1 .cse12 .cse11 .cse13 .cse24) (and .cse18 .cse1 .cse10 .cse12 .cse5 .cse11) (and .cse20 .cse1 .cse12 (and .cse25 .cse10) .cse5) (and .cse20 .cse1 .cse5 .cse11 .cse13 .cse26) (and .cse16 .cse1 .cse2 .cse5 .cse11 .cse7) (and .cse1 .cse9 .cse12 (and .cse10 .cse5 .cse22 .cse6)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse17) (and .cse27 .cse0 .cse1 .cse5) (and .cse20 .cse1 .cse12 .cse5 .cse11) (and .cse1 .cse10 .cse12 .cse5 .cse11 .cse6) (and .cse1 (and .cse20 (and .cse10 .cse8 .cse23 .cse5))) (and .cse1 .cse5 .cse11 .cse7 (and .cse8 .cse23)) (and .cse0 (and (and (and .cse23 .cse22) .cse8) .cse5 .cse7) .cse1) (and .cse0 .cse1 (and .cse20 .cse10 .cse23 .cse5)) (and .cse28 .cse1 .cse9 .cse5 .cse11) (and .cse9 (and .cse19 .cse0 .cse1 .cse3 .cse4 .cse5)) (and .cse9 (and .cse0 .cse1 (and .cse18 .cse8) .cse4 .cse5)) (and .cse0 .cse1 .cse15 .cse11 .cse13 .cse7) (and .cse1 .cse9 .cse4 .cse5 (and .cse8 (and .cse22 .cse14))) (and .cse1 .cse9 .cse2 .cse5 .cse11 .cse22 .cse13 .cse6) (and .cse1 (and .cse29 .cse5 (and (and .cse18 .cse25 .cse10) .cse8))) (and .cse1 (and .cse20 .cse29 .cse5 (and .cse18 .cse10 .cse8))) (and .cse20 .cse1 .cse10 .cse2 .cse5 .cse11) (and .cse20 .cse28 .cse1 .cse12 .cse4 .cse5) (and .cse20 .cse1 .cse5 .cse11 (and .cse2 (and (and .cse25 .cse6) .cse22))) (and .cse0 .cse1 .cse5 .cse11 .cse7 .cse26) (and .cse20 .cse0 .cse28 .cse1 .cse4 .cse5) (and .cse1 (and .cse23 .cse5 .cse7) .cse10 .cse3) (and .cse12 (and .cse20 .cse0 .cse1 .cse10 .cse2 .cse5 .cse22)) (and (and .cse5 (and (and .cse25 .cse23) .cse8) .cse7) .cse1) (and (and .cse5 .cse22) .cse29 .cse1 .cse9 .cse10 .cse2 .cse3 .cse21) (and (and .cse20 .cse27 .cse5) .cse1) (and .cse18 .cse1 .cse9 .cse10 .cse3 .cse4 .cse5) (and .cse16 .cse1 .cse9 .cse2 .cse5 .cse11))))) [2019-01-12 01:13:58,765 INFO L448 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L451 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,766 INFO L448 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,767 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:13:58,768 INFO L448 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,769 INFO L444 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse10 (= ~a27~0 1)) (.cse3 (= ~a6~0 1)) (.cse2 (= ~a12~0 1))) (let ((.cse11 (= ~a26~0 1)) (.cse1 (= ~a18~0 1)) (.cse13 (= ~a15~0 1)) (.cse18 (not .cse2)) (.cse8 (not .cse3)) (.cse6 (not (= ~a11~0 1))) (.cse30 (not .cse10)) (.cse25 (not (= ~a20~0 1))) (.cse5 (= ~a5~0 1)) (.cse22 (= ~a16~0 1))) (let ((.cse24 (and .cse25 .cse10 .cse5 .cse22)) (.cse17 (and .cse30 .cse22)) (.cse19 (and .cse30 .cse22 .cse6)) (.cse15 (and .cse18 .cse10 .cse8 .cse5)) (.cse14 (and .cse18 .cse25)) (.cse26 (and (and .cse18 .cse30 .cse22) .cse8)) (.cse28 (and .cse2 .cse8 .cse6)) (.cse12 (or (= ~a8~0 1) (and .cse1 (= ~a4~0 1) (= ~a22~0 1) .cse5 (= ~a29~0 1) .cse13) .cse3)) (.cse0 (not (= ~a7~0 1))) (.cse23 (and .cse18 .cse6)) (.cse7 (= ~a3~0 1)) (.cse29 (not .cse11)) (.cse21 (<= ~a7~0 0)) (.cse20 (<= ~a3~0 0)) (.cse27 (and .cse18 .cse10 .cse8 .cse22)) (.cse4 (<= ~a26~0 0)) (.cse16 (<= ~a6~0 0)) (.cse9 (<= 2 ~a3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse5 .cse11) (and .cse1 .cse12 .cse5 .cse11 .cse13 .cse14) (and .cse9 (and .cse0 .cse1 .cse15)) (and .cse0 .cse16 .cse1 .cse2 .cse5 .cse11 .cse17) (and .cse1 .cse9 .cse10 .cse12 .cse4 .cse5 .cse6) (and .cse18 .cse1 .cse9 .cse12 .cse5 .cse11) (and .cse0 .cse6 .cse1 .cse10 .cse5 .cse11) (and .cse19 .cse20 .cse1 .cse2 .cse4 .cse5 .cse21) (and .cse0 .cse1 (and .cse10 .cse8 .cse5 .cse22) .cse11) (and .cse12 (and .cse0 .cse1 .cse18 .cse5 .cse11 .cse13)) (and (and .cse23 .cse5) .cse1 .cse9 .cse12) (and .cse1 .cse9 .cse11 .cse24) (and (and .cse0 .cse1 .cse5 .cse11 .cse6) .cse12) (and .cse1 .cse12 .cse11 .cse13 .cse24) (and .cse18 .cse1 .cse10 .cse12 .cse5 .cse11) (and .cse20 .cse1 .cse12 (and .cse25 .cse10) .cse5) (and .cse20 .cse1 .cse5 .cse11 .cse13 .cse26) (and .cse16 .cse1 .cse2 .cse5 .cse11 .cse7) (and .cse1 .cse9 .cse12 (and .cse10 .cse5 .cse22 .cse6)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse17) (and .cse27 .cse0 .cse1 .cse5) (and .cse20 .cse1 .cse12 .cse5 .cse11) (and .cse1 .cse10 .cse12 .cse5 .cse11 .cse6) (and .cse1 (and .cse20 (and .cse10 .cse8 .cse23 .cse5))) (and .cse1 .cse5 .cse11 .cse7 (and .cse8 .cse23)) (and .cse0 (and (and (and .cse23 .cse22) .cse8) .cse5 .cse7) .cse1) (and .cse0 .cse1 (and .cse20 .cse10 .cse23 .cse5)) (and .cse28 .cse1 .cse9 .cse5 .cse11) (and .cse9 (and .cse19 .cse0 .cse1 .cse3 .cse4 .cse5)) (and .cse9 (and .cse0 .cse1 (and .cse18 .cse8) .cse4 .cse5)) (and .cse0 .cse1 .cse15 .cse11 .cse13 .cse7) (and .cse1 .cse9 .cse4 .cse5 (and .cse8 (and .cse22 .cse14))) (and .cse1 .cse9 .cse2 .cse5 .cse11 .cse22 .cse13 .cse6) (and .cse1 (and .cse29 .cse5 (and (and .cse18 .cse25 .cse10) .cse8))) (and .cse1 (and .cse20 .cse29 .cse5 (and .cse18 .cse10 .cse8))) (and .cse20 .cse1 .cse10 .cse2 .cse5 .cse11) (and .cse20 .cse28 .cse1 .cse12 .cse4 .cse5) (and .cse20 .cse1 .cse5 .cse11 (and .cse2 (and (and .cse25 .cse6) .cse22))) (and .cse0 .cse1 .cse5 .cse11 .cse7 .cse26) (and .cse20 .cse0 .cse28 .cse1 .cse4 .cse5) (and .cse1 (and .cse23 .cse5 .cse7) .cse10 .cse3) (and .cse12 (and .cse20 .cse0 .cse1 .cse10 .cse2 .cse5 .cse22)) (and (and .cse5 (and (and .cse25 .cse23) .cse8) .cse7) .cse1) (and (and .cse5 .cse22) .cse29 .cse1 .cse9 .cse10 .cse2 .cse3 .cse21) (and (and .cse20 .cse27 .cse5) .cse1) (and .cse18 .cse1 .cse9 .cse10 .cse3 .cse4 .cse5) (and .cse16 .cse1 .cse9 .cse2 .cse5 .cse11))))) [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,770 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,771 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-01-12 01:13:58,772 INFO L448 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:13:58,773 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,774 INFO L448 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,775 INFO L448 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,776 INFO L448 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,777 INFO L448 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,778 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,779 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,780 INFO L448 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,781 INFO L448 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:13:58,781 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,781 INFO L448 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-01-12 01:13:58,781 INFO L448 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-01-12 01:13:58,781 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,781 INFO L448 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-01-12 01:13:58,781 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-01-12 01:13:58,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 01:13:58 BoogieIcfgContainer [2019-01-12 01:13:58,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 01:13:58,873 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 01:13:58,873 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 01:13:58,874 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 01:13:58,874 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:05:27" (3/4) ... [2019-01-12 01:13:58,883 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 01:13:58,948 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 01:13:58,958 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 01:13:59,253 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 01:13:59,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 01:13:59,254 INFO L168 Benchmark]: Toolchain (without parser) took 518441.14 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 940.6 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-01-12 01:13:59,255 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 01:13:59,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1458.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -228.2 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. [2019-01-12 01:13:59,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 157.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-01-12 01:13:59,256 INFO L168 Benchmark]: Boogie Preprocessor took 129.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-01-12 01:13:59,256 INFO L168 Benchmark]: RCFGBuilder took 4603.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.7 MB in the end (delta: 246.5 MB). Peak memory consumption was 246.5 MB. Max. memory is 11.5 GB. [2019-01-12 01:13:59,257 INFO L168 Benchmark]: TraceAbstraction took 511706.93 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 896.7 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. [2019-01-12 01:13:59,257 INFO L168 Benchmark]: Witness Printer took 380.24 ms. Allocated memory is still 5.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. [2019-01-12 01:13:59,259 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.41 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1458.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -228.2 MB). Peak memory consumption was 113.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 157.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4603.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.7 MB in the end (delta: 246.5 MB). Peak memory consumption was 246.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 511706.93 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 896.7 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. * Witness Printer took 380.24 ms. Allocated memory is still 5.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1590]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((!(a7 == 1) && a18 == 1) && a12 == 1) && a6 == 1) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a3 == 1) || (((((!(a6 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && a5 == 1) && a26 == 1)) || (((((a18 == 1 && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1) && a15 == 1) && !(a12 == 1) && !(a20 == 1))) || (2 <= a3 && (!(a7 == 1) && a18 == 1) && ((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a5 == 1)) || ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a12 == 1) && a5 == 1) && a26 == 1) && !(a27 == 1) && a16 == 1)) || ((((((a18 == 1 && 2 <= a3) && a27 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1))) || (((((!(a12 == 1) && a18 == 1) && 2 <= a3) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1)) || (((((!(a7 == 1) && !(a11 == 1)) && a18 == 1) && a27 == 1) && a5 == 1) && a26 == 1)) || ((((((((!(a27 == 1) && a16 == 1) && !(a11 == 1)) && a3 <= 0) && a18 == 1) && a12 == 1) && a26 <= 0) && a5 == 1) && a7 <= 0)) || (((!(a7 == 1) && a18 == 1) && ((a27 == 1 && !(a6 == 1)) && a5 == 1) && a16 == 1) && a26 == 1)) || (((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1) && ((((!(a7 == 1) && a18 == 1) && !(a12 == 1)) && a5 == 1) && a26 == 1) && a15 == 1)) || (((((!(a12 == 1) && !(a11 == 1)) && a5 == 1) && a18 == 1) && 2 <= a3) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1))) || (((a18 == 1 && 2 <= a3) && a26 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((((!(a7 == 1) && a18 == 1) && a5 == 1) && a26 == 1) && !(a11 == 1)) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1))) || ((((a18 == 1 && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a26 == 1) && a15 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((((!(a12 == 1) && a18 == 1) && a27 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && !(a20 == 1) && a27 == 1) && a5 == 1)) || (((((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && ((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && !(a6 == 1))) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a5 == 1) && a26 == 1) && a3 == 1)) || (((a18 == 1 && 2 <= a3) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && ((a27 == 1 && a5 == 1) && a16 == 1) && !(a11 == 1))) || (((((((!(a7 == 1) && a18 == 1) && a12 == 1) && a6 == 1) && a26 <= 0) && a5 == 1) && a3 == 1) && !(a27 == 1) && a16 == 1)) || ((((((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a16 == 1) && !(a7 == 1)) && a18 == 1) && a5 == 1)) || ((((a3 <= 0 && a18 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1)) || (((((a18 == 1 && a27 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1) && !(a11 == 1))) || (a18 == 1 && a3 <= 0 && ((a27 == 1 && !(a6 == 1)) && !(a12 == 1) && !(a11 == 1)) && a5 == 1)) || ((((a18 == 1 && a5 == 1) && a26 == 1) && a3 == 1) && !(a6 == 1) && !(a12 == 1) && !(a11 == 1))) || ((!(a7 == 1) && ((((!(a12 == 1) && !(a11 == 1)) && a16 == 1) && !(a6 == 1)) && a5 == 1) && a3 == 1) && a18 == 1)) || ((!(a7 == 1) && a18 == 1) && ((a3 <= 0 && a27 == 1) && !(a12 == 1) && !(a11 == 1)) && a5 == 1)) || ((((((a12 == 1 && !(a6 == 1)) && !(a11 == 1)) && a18 == 1) && 2 <= a3) && a5 == 1) && a26 == 1)) || (2 <= a3 && ((((((!(a27 == 1) && a16 == 1) && !(a11 == 1)) && !(a7 == 1)) && a18 == 1) && a6 == 1) && a26 <= 0) && a5 == 1)) || (2 <= a3 && (((!(a7 == 1) && a18 == 1) && !(a12 == 1) && !(a6 == 1)) && a26 <= 0) && a5 == 1)) || (((((!(a7 == 1) && a18 == 1) && ((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a5 == 1) && a26 == 1) && a15 == 1) && a3 == 1)) || ((((a18 == 1 && 2 <= a3) && a26 <= 0) && a5 == 1) && !(a6 == 1) && a16 == 1 && !(a12 == 1) && !(a20 == 1))) || (((((((a18 == 1 && 2 <= a3) && a12 == 1) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && !(a11 == 1))) || (a18 == 1 && (!(a26 == 1) && a5 == 1) && ((!(a12 == 1) && !(a20 == 1)) && a27 == 1) && !(a6 == 1))) || (a18 == 1 && ((a3 <= 0 && !(a26 == 1)) && a5 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1))) || (((((a3 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a5 == 1) && a26 == 1)) || (((((a3 <= 0 && (a12 == 1 && !(a6 == 1)) && !(a11 == 1)) && a18 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a26 <= 0) && a5 == 1)) || ((((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1) && a12 == 1 && (!(a20 == 1) && !(a11 == 1)) && a16 == 1)) || (((((!(a7 == 1) && a18 == 1) && a5 == 1) && a26 == 1) && a3 == 1) && ((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && !(a6 == 1))) || (((((a3 <= 0 && !(a7 == 1)) && (a12 == 1 && !(a6 == 1)) && !(a11 == 1)) && a18 == 1) && a26 <= 0) && a5 == 1)) || (((a18 == 1 && ((!(a12 == 1) && !(a11 == 1)) && a5 == 1) && a3 == 1) && a27 == 1) && a6 == 1)) || (((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1) && (((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && a27 == 1) && a12 == 1) && a5 == 1) && a16 == 1)) || (((a5 == 1 && (!(a20 == 1) && !(a12 == 1) && !(a11 == 1)) && !(a6 == 1)) && a3 == 1) && a18 == 1)) || ((((((((a5 == 1 && a16 == 1) && !(a26 == 1)) && a18 == 1) && 2 <= a3) && a27 == 1) && a12 == 1) && a6 == 1) && a7 <= 0)) || (((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a16 == 1) && a5 == 1) && a18 == 1)) || ((((((!(a12 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && a6 == 1) && a26 <= 0) && a5 == 1)) || (((((a6 <= 0 && a18 == 1) && 2 <= a3) && a12 == 1) && a5 == 1) && a26 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((!(a7 == 1) && a18 == 1) && a12 == 1) && a6 == 1) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a3 == 1) || (((((!(a6 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && a5 == 1) && a26 == 1)) || (((((a18 == 1 && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1) && a15 == 1) && !(a12 == 1) && !(a20 == 1))) || (2 <= a3 && (!(a7 == 1) && a18 == 1) && ((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a5 == 1)) || ((((((!(a7 == 1) && a6 <= 0) && a18 == 1) && a12 == 1) && a5 == 1) && a26 == 1) && !(a27 == 1) && a16 == 1)) || ((((((a18 == 1 && 2 <= a3) && a27 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1))) || (((((!(a12 == 1) && a18 == 1) && 2 <= a3) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1)) || (((((!(a7 == 1) && !(a11 == 1)) && a18 == 1) && a27 == 1) && a5 == 1) && a26 == 1)) || ((((((((!(a27 == 1) && a16 == 1) && !(a11 == 1)) && a3 <= 0) && a18 == 1) && a12 == 1) && a26 <= 0) && a5 == 1) && a7 <= 0)) || (((!(a7 == 1) && a18 == 1) && ((a27 == 1 && !(a6 == 1)) && a5 == 1) && a16 == 1) && a26 == 1)) || (((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1) && ((((!(a7 == 1) && a18 == 1) && !(a12 == 1)) && a5 == 1) && a26 == 1) && a15 == 1)) || (((((!(a12 == 1) && !(a11 == 1)) && a5 == 1) && a18 == 1) && 2 <= a3) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1))) || (((a18 == 1 && 2 <= a3) && a26 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((((!(a7 == 1) && a18 == 1) && a5 == 1) && a26 == 1) && !(a11 == 1)) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1))) || ((((a18 == 1 && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a26 == 1) && a15 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((((!(a12 == 1) && a18 == 1) && a27 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1)) || ((((a3 <= 0 && a18 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && !(a20 == 1) && a27 == 1) && a5 == 1)) || (((((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && ((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && !(a6 == 1))) || (((((a6 <= 0 && a18 == 1) && a12 == 1) && a5 == 1) && a26 == 1) && a3 == 1)) || (((a18 == 1 && 2 <= a3) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && ((a27 == 1 && a5 == 1) && a16 == 1) && !(a11 == 1))) || (((((((!(a7 == 1) && a18 == 1) && a12 == 1) && a6 == 1) && a26 <= 0) && a5 == 1) && a3 == 1) && !(a27 == 1) && a16 == 1)) || ((((((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a16 == 1) && !(a7 == 1)) && a18 == 1) && a5 == 1)) || ((((a3 <= 0 && a18 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1)) || (((((a18 == 1 && a27 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a5 == 1) && a26 == 1) && !(a11 == 1))) || (a18 == 1 && a3 <= 0 && ((a27 == 1 && !(a6 == 1)) && !(a12 == 1) && !(a11 == 1)) && a5 == 1)) || ((((a18 == 1 && a5 == 1) && a26 == 1) && a3 == 1) && !(a6 == 1) && !(a12 == 1) && !(a11 == 1))) || ((!(a7 == 1) && ((((!(a12 == 1) && !(a11 == 1)) && a16 == 1) && !(a6 == 1)) && a5 == 1) && a3 == 1) && a18 == 1)) || ((!(a7 == 1) && a18 == 1) && ((a3 <= 0 && a27 == 1) && !(a12 == 1) && !(a11 == 1)) && a5 == 1)) || ((((((a12 == 1 && !(a6 == 1)) && !(a11 == 1)) && a18 == 1) && 2 <= a3) && a5 == 1) && a26 == 1)) || (2 <= a3 && ((((((!(a27 == 1) && a16 == 1) && !(a11 == 1)) && !(a7 == 1)) && a18 == 1) && a6 == 1) && a26 <= 0) && a5 == 1)) || (2 <= a3 && (((!(a7 == 1) && a18 == 1) && !(a12 == 1) && !(a6 == 1)) && a26 <= 0) && a5 == 1)) || (((((!(a7 == 1) && a18 == 1) && ((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a5 == 1) && a26 == 1) && a15 == 1) && a3 == 1)) || ((((a18 == 1 && 2 <= a3) && a26 <= 0) && a5 == 1) && !(a6 == 1) && a16 == 1 && !(a12 == 1) && !(a20 == 1))) || (((((((a18 == 1 && 2 <= a3) && a12 == 1) && a5 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && !(a11 == 1))) || (a18 == 1 && (!(a26 == 1) && a5 == 1) && ((!(a12 == 1) && !(a20 == 1)) && a27 == 1) && !(a6 == 1))) || (a18 == 1 && ((a3 <= 0 && !(a26 == 1)) && a5 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1))) || (((((a3 <= 0 && a18 == 1) && a27 == 1) && a12 == 1) && a5 == 1) && a26 == 1)) || (((((a3 <= 0 && (a12 == 1 && !(a6 == 1)) && !(a11 == 1)) && a18 == 1) && ((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1)) && a26 <= 0) && a5 == 1)) || ((((a3 <= 0 && a18 == 1) && a5 == 1) && a26 == 1) && a12 == 1 && (!(a20 == 1) && !(a11 == 1)) && a16 == 1)) || (((((!(a7 == 1) && a18 == 1) && a5 == 1) && a26 == 1) && a3 == 1) && ((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && !(a6 == 1))) || (((((a3 <= 0 && !(a7 == 1)) && (a12 == 1 && !(a6 == 1)) && !(a11 == 1)) && a18 == 1) && a26 <= 0) && a5 == 1)) || (((a18 == 1 && ((!(a12 == 1) && !(a11 == 1)) && a5 == 1) && a3 == 1) && a27 == 1) && a6 == 1)) || (((a8 == 1 || (((((a18 == 1 && a4 == 1) && a22 == 1) && a5 == 1) && a29 == 1) && a15 == 1)) || a6 == 1) && (((((a3 <= 0 && !(a7 == 1)) && a18 == 1) && a27 == 1) && a12 == 1) && a5 == 1) && a16 == 1)) || (((a5 == 1 && (!(a20 == 1) && !(a12 == 1) && !(a11 == 1)) && !(a6 == 1)) && a3 == 1) && a18 == 1)) || ((((((((a5 == 1 && a16 == 1) && !(a26 == 1)) && a18 == 1) && 2 <= a3) && a27 == 1) && a12 == 1) && a6 == 1) && a7 <= 0)) || (((a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a16 == 1) && a5 == 1) && a18 == 1)) || ((((((!(a12 == 1) && a18 == 1) && 2 <= a3) && a27 == 1) && a6 == 1) && a26 <= 0) && a5 == 1)) || (((((a6 <= 0 && a18 == 1) && 2 <= a3) && a12 == 1) && a5 == 1) && a26 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. SAFE Result, 511.5s OverallTime, 19 OverallIterations, 5 TraceHistogramMax, 54.1s AutomataDifference, 0.0s DeadEndRemovalTime, 433.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 3341 SDtfs, 12180 SDslu, 2281 SDs, 0 SdLazy, 18198 SolverSat, 3675 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 983 GetRequests, 928 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224231occurred in iteration=18, 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: 13.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 173753 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 4168 NumberOfFragments, 3135 HoareAnnotationTreeSize, 3 FomulaSimplifications, 298698 FormulaSimplificationTreeSizeReduction, 187.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 687622 FormulaSimplificationTreeSizeReductionInter, 246.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 5824 NumberOfCodeBlocks, 5824 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5802 ConstructedInterpolants, 0 QuantifiedInterpolants, 4875680 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1625 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 2354/2426 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...