./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label05_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/Problem15_label05_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 68da771056b5e949718fb6dadad5d07a6902939c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:28:56,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:28:56,028 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:28:56,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:28:56,039 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:28:56,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:28:56,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:28:56,043 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:28:56,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:28:56,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:28:56,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:28:56,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:28:56,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:28:56,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:28:56,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:28:56,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:28:56,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:28:56,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:28:56,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:28:56,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:28:56,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:28:56,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:28:56,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:28:56,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:28:56,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:28:56,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:28:56,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:28:56,064 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:28:56,065 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:28:56,066 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:28:56,066 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:28:56,067 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:28:56,067 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:28:56,067 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:28:56,068 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:28:56,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:28:56,069 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:28:56,084 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:28:56,084 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:28:56,085 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:28:56,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:28:56,085 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:28:56,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:28:56,086 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:28:56,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:28:56,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:28:56,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:28:56,086 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:28:56,087 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:28:56,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:28:56,087 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:28:56,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:28:56,087 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:28:56,087 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:28:56,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:28:56,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:28:56,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:28:56,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:28:56,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:28:56,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:28:56,089 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:28:56,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:28:56,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:28:56,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:28:56,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:28:56,089 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 -> 68da771056b5e949718fb6dadad5d07a6902939c [2019-01-12 04:28:56,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:28:56,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:28:56,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:28:56,163 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:28:56,163 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:28:56,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label05_true-unreach-call.c [2019-01-12 04:28:56,235 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b07117c/2aa23564672745bab3ef942437fef0b7/FLAG18423142c [2019-01-12 04:28:56,914 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:28:56,915 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label05_true-unreach-call.c [2019-01-12 04:28:56,939 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b07117c/2aa23564672745bab3ef942437fef0b7/FLAG18423142c [2019-01-12 04:28:57,068 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b07117c/2aa23564672745bab3ef942437fef0b7 [2019-01-12 04:28:57,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:28:57,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:28:57,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:28:57,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:28:57,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:28:57,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:28:57" (1/1) ... [2019-01-12 04:28:57,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b9d187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:57, skipping insertion in model container [2019-01-12 04:28:57,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:28:57" (1/1) ... [2019-01-12 04:28:57,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:28:57,170 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:28:57,927 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:28:57,932 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:28:58,248 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:28:58,269 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:28:58,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58 WrapperNode [2019-01-12 04:28:58,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:28:58,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:28:58,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:28:58,273 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:28:58,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (1/1) ... [2019-01-12 04:28:58,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (1/1) ... [2019-01-12 04:28:58,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:28:58,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:28:58,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:28:58,678 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:28:58,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (1/1) ... [2019-01-12 04:28:58,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (1/1) ... [2019-01-12 04:28:58,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (1/1) ... [2019-01-12 04:28:58,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (1/1) ... [2019-01-12 04:28:58,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (1/1) ... [2019-01-12 04:28:58,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (1/1) ... [2019-01-12 04:28:58,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (1/1) ... [2019-01-12 04:28:58,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:28:58,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:28:58,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:28:58,860 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:28:58,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (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 04:28:58,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:28:58,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:29:05,940 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:29:05,940 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:29:05,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:29:05 BoogieIcfgContainer [2019-01-12 04:29:05,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:29:05,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:29:05,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:29:05,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:29:05,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:28:57" (1/3) ... [2019-01-12 04:29:05,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e06bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:29:05, skipping insertion in model container [2019-01-12 04:29:05,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:58" (2/3) ... [2019-01-12 04:29:05,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e06bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:29:05, skipping insertion in model container [2019-01-12 04:29:05,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:29:05" (3/3) ... [2019-01-12 04:29:05,949 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label05_true-unreach-call.c [2019-01-12 04:29:05,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:29:05,966 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:29:05,983 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:29:06,019 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:29:06,019 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:29:06,019 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:29:06,020 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:29:06,020 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:29:06,020 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:29:06,020 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:29:06,021 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:29:06,021 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:29:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:29:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 04:29:06,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:06,064 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] [2019-01-12 04:29:06,066 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:06,072 INFO L82 PathProgramCache]: Analyzing trace with hash -107486446, now seen corresponding path program 1 times [2019-01-12 04:29:06,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:06,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:06,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:06,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:06,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:06,485 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 04:29:06,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:06,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:29:06,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:06,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:06,513 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:29:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:12,748 INFO L93 Difference]: Finished difference Result 1469 states and 2719 transitions. [2019-01-12 04:29:12,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:12,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-12 04:29:12,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:12,779 INFO L225 Difference]: With dead ends: 1469 [2019-01-12 04:29:12,780 INFO L226 Difference]: Without dead ends: 978 [2019-01-12 04:29:12,788 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 04:29:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-01-12 04:29:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-01-12 04:29:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-01-12 04:29:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1489 transitions. [2019-01-12 04:29:12,887 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1489 transitions. Word has length 64 [2019-01-12 04:29:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:12,888 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1489 transitions. [2019-01-12 04:29:12,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1489 transitions. [2019-01-12 04:29:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-01-12 04:29:12,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:12,903 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, 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] [2019-01-12 04:29:12,903 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:12,904 INFO L82 PathProgramCache]: Analyzing trace with hash -824307125, now seen corresponding path program 1 times [2019-01-12 04:29:12,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:12,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:12,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:12,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:29:13,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:13,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:29:13,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:13,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:13,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:13,310 INFO L87 Difference]: Start difference. First operand 974 states and 1489 transitions. Second operand 4 states. [2019-01-12 04:29:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:18,541 INFO L93 Difference]: Finished difference Result 3748 states and 5754 transitions. [2019-01-12 04:29:18,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:18,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-01-12 04:29:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:18,567 INFO L225 Difference]: With dead ends: 3748 [2019-01-12 04:29:18,567 INFO L226 Difference]: Without dead ends: 2776 [2019-01-12 04:29:18,573 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 04:29:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-01-12 04:29:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 1873. [2019-01-12 04:29:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-01-12 04:29:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2509 transitions. [2019-01-12 04:29:18,651 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2509 transitions. Word has length 183 [2019-01-12 04:29:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:18,651 INFO L480 AbstractCegarLoop]: Abstraction has 1873 states and 2509 transitions. [2019-01-12 04:29:18,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2509 transitions. [2019-01-12 04:29:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-01-12 04:29:18,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:18,667 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:18,667 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:18,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1529893836, now seen corresponding path program 1 times [2019-01-12 04:29:18,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:18,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:18,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:18,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-12 04:29:19,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:19,427 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 04:29:19,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:19,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-01-12 04:29:19,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:29:19,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-01-12 04:29:19,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:19,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:19,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:19,960 INFO L87 Difference]: Start difference. First operand 1873 states and 2509 transitions. Second operand 4 states. [2019-01-12 04:29:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:27,318 INFO L93 Difference]: Finished difference Result 7042 states and 9298 transitions. [2019-01-12 04:29:27,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:27,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-01-12 04:29:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:27,345 INFO L225 Difference]: With dead ends: 7042 [2019-01-12 04:29:27,346 INFO L226 Difference]: Without dead ends: 5171 [2019-01-12 04:29:27,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 334 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 04:29:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5171 states. [2019-01-12 04:29:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5171 to 2775. [2019-01-12 04:29:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-01-12 04:29:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3775 transitions. [2019-01-12 04:29:27,421 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3775 transitions. Word has length 334 [2019-01-12 04:29:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:27,422 INFO L480 AbstractCegarLoop]: Abstraction has 2775 states and 3775 transitions. [2019-01-12 04:29:27,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3775 transitions. [2019-01-12 04:29:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-12 04:29:27,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:27,429 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:27,430 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:27,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:27,431 INFO L82 PathProgramCache]: Analyzing trace with hash 116850269, now seen corresponding path program 1 times [2019-01-12 04:29:27,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:27,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:27,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:27,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:28,108 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 04:29:28,359 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 04:29:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-01-12 04:29:28,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:28,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:29:28,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:29:28,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:29:28,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:29:28,717 INFO L87 Difference]: Start difference. First operand 2775 states and 3775 transitions. Second operand 5 states. [2019-01-12 04:29:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:32,486 INFO L93 Difference]: Finished difference Result 6746 states and 8862 transitions. [2019-01-12 04:29:32,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:32,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 355 [2019-01-12 04:29:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:32,507 INFO L225 Difference]: With dead ends: 6746 [2019-01-12 04:29:32,507 INFO L226 Difference]: Without dead ends: 3973 [2019-01-12 04:29:32,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:29:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2019-01-12 04:29:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3673. [2019-01-12 04:29:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-01-12 04:29:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4739 transitions. [2019-01-12 04:29:32,650 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4739 transitions. Word has length 355 [2019-01-12 04:29:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:32,650 INFO L480 AbstractCegarLoop]: Abstraction has 3673 states and 4739 transitions. [2019-01-12 04:29:32,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:29:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4739 transitions. [2019-01-12 04:29:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-01-12 04:29:32,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:32,661 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:32,662 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1441910731, now seen corresponding path program 1 times [2019-01-12 04:29:32,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:32,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:32,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:32,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:32,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:33,356 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:29:33,622 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:29:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:29:33,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:33,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:29:33,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:29:33,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:29:33,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:29:33,895 INFO L87 Difference]: Start difference. First operand 3673 states and 4739 transitions. Second operand 6 states. [2019-01-12 04:29:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:39,789 INFO L93 Difference]: Finished difference Result 7702 states and 9892 transitions. [2019-01-12 04:29:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:29:39,790 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 429 [2019-01-12 04:29:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:39,808 INFO L225 Difference]: With dead ends: 7702 [2019-01-12 04:29:39,809 INFO L226 Difference]: Without dead ends: 4031 [2019-01-12 04:29:39,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:29:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2019-01-12 04:29:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 3972. [2019-01-12 04:29:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3972 states. [2019-01-12 04:29:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 4711 transitions. [2019-01-12 04:29:39,907 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 4711 transitions. Word has length 429 [2019-01-12 04:29:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:39,908 INFO L480 AbstractCegarLoop]: Abstraction has 3972 states and 4711 transitions. [2019-01-12 04:29:39,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:29:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 4711 transitions. [2019-01-12 04:29:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-01-12 04:29:39,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:39,921 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:39,922 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash -380632207, now seen corresponding path program 1 times [2019-01-12 04:29:39,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:39,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:39,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:40,520 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:29:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-12 04:29:40,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:40,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:29:40,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:29:40,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:29:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:29:40,652 INFO L87 Difference]: Start difference. First operand 3972 states and 4711 transitions. Second operand 6 states. [2019-01-12 04:29:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:43,715 INFO L93 Difference]: Finished difference Result 8923 states and 10805 transitions. [2019-01-12 04:29:43,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:29:43,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 446 [2019-01-12 04:29:43,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:43,737 INFO L225 Difference]: With dead ends: 8923 [2019-01-12 04:29:43,737 INFO L226 Difference]: Without dead ends: 4953 [2019-01-12 04:29:43,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:29:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4953 states. [2019-01-12 04:29:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4953 to 4868. [2019-01-12 04:29:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4868 states. [2019-01-12 04:29:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 5719 transitions. [2019-01-12 04:29:43,831 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 5719 transitions. Word has length 446 [2019-01-12 04:29:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:43,832 INFO L480 AbstractCegarLoop]: Abstraction has 4868 states and 5719 transitions. [2019-01-12 04:29:43,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:29:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 5719 transitions. [2019-01-12 04:29:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-01-12 04:29:43,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:43,847 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:43,847 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:43,848 INFO L82 PathProgramCache]: Analyzing trace with hash -550407689, now seen corresponding path program 1 times [2019-01-12 04:29:43,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:43,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:43,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:43,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:43,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-01-12 04:29:44,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:44,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:29:44,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:29:44,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:29:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:29:44,428 INFO L87 Difference]: Start difference. First operand 4868 states and 5719 transitions. Second operand 3 states. [2019-01-12 04:29:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:46,891 INFO L93 Difference]: Finished difference Result 11228 states and 13435 transitions. [2019-01-12 04:29:46,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:29:46,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 565 [2019-01-12 04:29:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:46,918 INFO L225 Difference]: With dead ends: 11228 [2019-01-12 04:29:46,918 INFO L226 Difference]: Without dead ends: 6362 [2019-01-12 04:29:46,925 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 04:29:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6362 states. [2019-01-12 04:29:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6362 to 6362. [2019-01-12 04:29:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6362 states. [2019-01-12 04:29:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 7512 transitions. [2019-01-12 04:29:47,029 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 7512 transitions. Word has length 565 [2019-01-12 04:29:47,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:47,030 INFO L480 AbstractCegarLoop]: Abstraction has 6362 states and 7512 transitions. [2019-01-12 04:29:47,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:29:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 7512 transitions. [2019-01-12 04:29:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2019-01-12 04:29:47,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:47,040 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:47,040 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1294776093, now seen corresponding path program 1 times [2019-01-12 04:29:47,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:47,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:47,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:47,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:47,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 755 proven. 3 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2019-01-12 04:29:48,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:48,224 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 04:29:48,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:48,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2019-01-12 04:29:48,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:29:48,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:29:48,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:29:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:29:48,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:29:48,787 INFO L87 Difference]: Start difference. First operand 6362 states and 7512 transitions. Second operand 8 states. [2019-01-12 04:29:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:55,247 INFO L93 Difference]: Finished difference Result 17371 states and 20157 transitions. [2019-01-12 04:29:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 04:29:55,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 644 [2019-01-12 04:29:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:55,266 INFO L225 Difference]: With dead ends: 17371 [2019-01-12 04:29:55,266 INFO L226 Difference]: Without dead ends: 9650 [2019-01-12 04:29:55,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 649 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:29:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9650 states. [2019-01-12 04:29:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9650 to 7856. [2019-01-12 04:29:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7856 states. [2019-01-12 04:29:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7856 states to 7856 states and 8873 transitions. [2019-01-12 04:29:55,389 INFO L78 Accepts]: Start accepts. Automaton has 7856 states and 8873 transitions. Word has length 644 [2019-01-12 04:29:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:55,390 INFO L480 AbstractCegarLoop]: Abstraction has 7856 states and 8873 transitions. [2019-01-12 04:29:55,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:29:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 7856 states and 8873 transitions. [2019-01-12 04:29:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-01-12 04:29:55,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:55,402 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 04:29:55,402 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:55,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2081151479, now seen corresponding path program 1 times [2019-01-12 04:29:55,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:55,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:55,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:55,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:55,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-01-12 04:29:55,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:55,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:29:55,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:29:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:29:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:29:55,877 INFO L87 Difference]: Start difference. First operand 7856 states and 8873 transitions. Second operand 3 states. [2019-01-12 04:29:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:58,399 INFO L93 Difference]: Finished difference Result 15708 states and 17742 transitions. [2019-01-12 04:29:58,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:29:58,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 661 [2019-01-12 04:29:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:58,415 INFO L225 Difference]: With dead ends: 15708 [2019-01-12 04:29:58,415 INFO L226 Difference]: Without dead ends: 7854 [2019-01-12 04:29:58,423 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 04:29:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7854 states. [2019-01-12 04:29:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7854 to 7854. [2019-01-12 04:29:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2019-01-12 04:29:58,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 8869 transitions. [2019-01-12 04:29:58,523 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 8869 transitions. Word has length 661 [2019-01-12 04:29:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:58,524 INFO L480 AbstractCegarLoop]: Abstraction has 7854 states and 8869 transitions. [2019-01-12 04:29:58,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:29:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 8869 transitions. [2019-01-12 04:29:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-01-12 04:29:58,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:58,535 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:29:58,535 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:58,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1676522849, now seen corresponding path program 1 times [2019-01-12 04:29:58,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:58,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:58,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:58,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-12 04:29:59,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:59,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:29:59,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:59,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:59,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:59,123 INFO L87 Difference]: Start difference. First operand 7854 states and 8869 transitions. Second operand 4 states. [2019-01-12 04:30:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:01,948 INFO L93 Difference]: Finished difference Result 17203 states and 19659 transitions. [2019-01-12 04:30:01,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:01,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 695 [2019-01-12 04:30:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:01,969 INFO L225 Difference]: With dead ends: 17203 [2019-01-12 04:30:01,969 INFO L226 Difference]: Without dead ends: 9351 [2019-01-12 04:30:01,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 04:30:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9351 states. [2019-01-12 04:30:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9351 to 9351. [2019-01-12 04:30:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9351 states. [2019-01-12 04:30:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9351 states to 9351 states and 10334 transitions. [2019-01-12 04:30:02,124 INFO L78 Accepts]: Start accepts. Automaton has 9351 states and 10334 transitions. Word has length 695 [2019-01-12 04:30:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:02,127 INFO L480 AbstractCegarLoop]: Abstraction has 9351 states and 10334 transitions. [2019-01-12 04:30:02,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:30:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 9351 states and 10334 transitions. [2019-01-12 04:30:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2019-01-12 04:30:02,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:02,144 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:02,144 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash -778252297, now seen corresponding path program 1 times [2019-01-12 04:30:02,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:02,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:02,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:02,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 499 proven. 62 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:30:04,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:04,191 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 04:30:04,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:04,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 499 proven. 62 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:30:05,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:30:05,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 11 [2019-01-12 04:30:05,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 04:30:05,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 04:30:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:30:05,432 INFO L87 Difference]: Start difference. First operand 9351 states and 10334 transitions. Second operand 11 states. [2019-01-12 04:30:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:17,208 INFO L93 Difference]: Finished difference Result 30496 states and 33692 transitions. [2019-01-12 04:30:17,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 04:30:17,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 722 [2019-01-12 04:30:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:17,248 INFO L225 Difference]: With dead ends: 30496 [2019-01-12 04:30:17,248 INFO L226 Difference]: Without dead ends: 21147 [2019-01-12 04:30:17,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 733 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-01-12 04:30:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21147 states. [2019-01-12 04:30:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21147 to 18624. [2019-01-12 04:30:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18624 states. [2019-01-12 04:30:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18624 states to 18624 states and 20124 transitions. [2019-01-12 04:30:17,535 INFO L78 Accepts]: Start accepts. Automaton has 18624 states and 20124 transitions. Word has length 722 [2019-01-12 04:30:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:17,535 INFO L480 AbstractCegarLoop]: Abstraction has 18624 states and 20124 transitions. [2019-01-12 04:30:17,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 04:30:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18624 states and 20124 transitions. [2019-01-12 04:30:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2019-01-12 04:30:17,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:17,562 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:17,562 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:17,565 INFO L82 PathProgramCache]: Analyzing trace with hash -965881644, now seen corresponding path program 1 times [2019-01-12 04:30:17,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:17,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:17,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:17,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:17,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 643 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-01-12 04:30:18,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:18,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:30:18,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:30:18,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:30:18,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:30:18,359 INFO L87 Difference]: Start difference. First operand 18624 states and 20124 transitions. Second operand 5 states. [2019-01-12 04:30:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:23,581 INFO L93 Difference]: Finished difference Result 46819 states and 50300 transitions. [2019-01-12 04:30:23,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:30:23,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 733 [2019-01-12 04:30:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:23,623 INFO L225 Difference]: With dead ends: 46819 [2019-01-12 04:30:23,623 INFO L226 Difference]: Without dead ends: 28197 [2019-01-12 04:30:23,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:30:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28197 states. [2019-01-12 04:30:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28197 to 18624. [2019-01-12 04:30:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18624 states. [2019-01-12 04:30:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18624 states to 18624 states and 20087 transitions. [2019-01-12 04:30:23,934 INFO L78 Accepts]: Start accepts. Automaton has 18624 states and 20087 transitions. Word has length 733 [2019-01-12 04:30:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:23,935 INFO L480 AbstractCegarLoop]: Abstraction has 18624 states and 20087 transitions. [2019-01-12 04:30:23,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:30:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 18624 states and 20087 transitions. [2019-01-12 04:30:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2019-01-12 04:30:23,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:23,959 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:23,961 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:23,961 INFO L82 PathProgramCache]: Analyzing trace with hash -462299624, now seen corresponding path program 1 times [2019-01-12 04:30:23,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:23,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:23,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:23,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:23,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:24,716 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:30:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 62 proven. 615 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-01-12 04:30:25,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:25,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:30:25,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:26,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:27,554 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_3 Int)) (let ((.cse0 (mod v_prenex_3 299926))) (and (<= (+ v_prenex_3 44) 0) (<= .cse0 (+ c_~a0~0 300073)) (= 0 .cse0)))) (exists ((v_prenex_4 Int)) (let ((.cse1 (mod v_prenex_4 299926))) (and (not (= 0 .cse1)) (<= .cse1 (+ c_~a0~0 599999)) (< v_prenex_4 0) (<= (+ v_prenex_4 44) 0)))) (exists ((v_~a0~0_826 Int)) (and (<= (+ v_~a0~0_826 44) 0) (<= 0 v_~a0~0_826) (<= (mod v_~a0~0_826 299926) (+ c_~a0~0 300073))))) is different from true [2019-01-12 04:30:28,109 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-01-12 04:30:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 0 proven. 185 refuted. 0 times theorem prover too weak. 377 trivial. 492 not checked. [2019-01-12 04:30:30,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:30:30,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-01-12 04:30:30,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:30:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:30:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2019-01-12 04:30:30,231 INFO L87 Difference]: Start difference. First operand 18624 states and 20087 transitions. Second operand 9 states. [2019-01-12 04:30:37,330 WARN L181 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 39 DAG size of output: 19 [2019-01-12 04:30:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:46,864 INFO L93 Difference]: Finished difference Result 54778 states and 58417 transitions. [2019-01-12 04:30:46,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:30:46,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 786 [2019-01-12 04:30:46,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:46,866 INFO L225 Difference]: With dead ends: 54778 [2019-01-12 04:30:46,867 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:30:46,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=43, Invalid=69, Unknown=2, NotChecked=18, Total=132 [2019-01-12 04:30:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:30:46,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:30:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:30:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:30:46,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 786 [2019-01-12 04:30:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:46,892 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:30:46,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:30:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:30:46,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:30:46,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:30:47,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:47,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,228 WARN L181 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 511 DAG size of output: 345 [2019-01-12 04:30:48,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:48,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,475 WARN L181 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 511 DAG size of output: 345 [2019-01-12 04:30:49,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:30:49,988 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 365 DAG size of output: 297 [2019-01-12 04:30:52,617 WARN L181 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 335 DAG size of output: 43 [2019-01-12 04:30:54,965 WARN L181 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 335 DAG size of output: 43 [2019-01-12 04:30:56,866 WARN L181 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 294 DAG size of output: 43 [2019-01-12 04:30:56,869 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,869 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,869 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,869 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,869 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 199) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,870 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:30:56,871 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,872 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,873 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,874 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,875 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:30:56,876 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:30:56,877 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,878 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,879 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,880 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,881 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,882 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,883 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,884 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:30:56,885 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,886 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,887 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,888 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,888 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse5 (+ ~a0~0 44)) (.cse8 (+ ~a4~0 86))) (let ((.cse2 (<= (+ ~a29~0 16) 0)) (.cse3 (<= .cse8 0)) (.cse6 (= ~a2~0 2)) (.cse9 (<= .cse5 0)) (.cse7 (<= 0 (+ ~a0~0 599999))) (.cse10 (<= 44 ~a29~0)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse1 (= ~a2~0 3))) (or (and .cse0 .cse1 .cse2) (and .cse0 (let ((.cse4 (not .cse6))) (or (and .cse3 .cse4) (and .cse4 (<= 0 .cse5)) (and (< 0 (+ ~a0~0 147)) .cse3)))) (and (and .cse2 .cse3) .cse7) (and .cse0 (< 0 .cse8) .cse9 .cse7) (and .cse10 .cse6 .cse9 .cse7) (and .cse10 .cse0 .cse1)))) [2019-01-12 04:30:56,888 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:30:56,888 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:30:56,888 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,888 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,888 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:30:56,889 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:30:56,890 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,891 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,891 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,891 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,891 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,891 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,891 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse1 (+ ~a4~0 86)) (.cse8 (+ ~a0~0 44))) (let ((.cse2 (<= .cse8 0)) (.cse5 (= ~a2~0 2)) (.cse6 (<= .cse1 0)) (.cse3 (<= 0 (+ ~a0~0 599999))) (.cse4 (<= 44 ~a29~0)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse10 (= ~a2~0 3)) (.cse9 (<= (+ ~a29~0 16) 0))) (or (and .cse0 (< 0 .cse1) .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3) (and .cse0 (let ((.cse7 (not .cse5))) (or (and .cse6 .cse7) (and .cse7 (<= 0 .cse8)) (and (< 0 (+ ~a0~0 147)) .cse6)))) (and (and .cse9 .cse6) .cse3) (and .cse4 .cse0 .cse10) (and .cse0 .cse10 .cse9)))) [2019-01-12 04:30:56,891 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,891 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:30:56,891 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:30:56,891 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,892 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,893 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,894 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:30:56,895 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:30:56,896 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:30:56,897 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,897 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,897 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,897 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,897 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,897 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,897 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse1 (+ ~a4~0 86)) (.cse8 (+ ~a0~0 44))) (let ((.cse2 (<= .cse8 0)) (.cse5 (= ~a2~0 2)) (.cse6 (<= .cse1 0)) (.cse3 (<= 0 (+ ~a0~0 599999))) (.cse4 (<= 44 ~a29~0)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse10 (= ~a2~0 3)) (.cse9 (<= (+ ~a29~0 16) 0))) (or (and .cse0 (< 0 .cse1) .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3) (and .cse0 (let ((.cse7 (not .cse5))) (or (and .cse6 .cse7) (and .cse7 (<= 0 .cse8)) (and (< 0 (+ ~a0~0 147)) .cse6)))) (and (and .cse9 .cse6) .cse3) (and .cse4 .cse0 .cse10) (and .cse0 .cse10 .cse9)))) [2019-01-12 04:30:56,897 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:30:56,897 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:30:56,898 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,899 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,900 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,901 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:30:56,902 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,903 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,904 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,905 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:30:56,906 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:30:56,906 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,906 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,906 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:30:56,906 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:30:56,906 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:30:56,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:30:56 BoogieIcfgContainer [2019-01-12 04:30:56,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:30:56,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:30:56,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:30:56,945 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:30:56,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:29:05" (3/4) ... [2019-01-12 04:30:56,952 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:30:57,026 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:30:57,030 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:30:57,330 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:30:57,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:30:57,331 INFO L168 Benchmark]: Toolchain (without parser) took 120257.93 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 947.2 MB in the beginning and 1.4 GB in the end (delta: -493.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-12 04:30:57,332 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:30:57,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1196.13 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 850.5 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:57,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 405.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 850.5 MB in the beginning and 1.1 GB in the end (delta: -266.0 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:57,333 INFO L168 Benchmark]: Boogie Preprocessor took 181.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:57,333 INFO L168 Benchmark]: RCFGBuilder took 7082.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -120.4 MB). Peak memory consumption was 313.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:57,333 INFO L168 Benchmark]: TraceAbstraction took 111001.46 ms. Allocated memory was 1.3 GB in the beginning and 3.1 GB in the end (delta: 1.8 GB). Free memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: -269.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-01-12 04:30:57,334 INFO L168 Benchmark]: Witness Printer took 385.86 ms. Allocated memory is still 3.1 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:30:57,337 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1196.13 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 850.5 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 405.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 850.5 MB in the beginning and 1.1 GB in the end (delta: -266.0 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 181.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7082.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -120.4 MB). Peak memory consumption was 313.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111001.46 ms. Allocated memory was 1.3 GB in the beginning and 3.1 GB in the end (delta: 1.8 GB). Free memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: -269.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 385.86 ms. Allocated memory is still 3.1 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 199]: 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: 1766]: Loop Invariant Derived loop invariant: (((((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 44 <= 0) && 0 <= a0 + 599999) || (((44 <= a29 && a2 == 2) && a0 + 44 <= 0) && 0 <= a0 + 599999)) || (a4 + 42 <= 0 && (((a4 + 86 <= 0 && !(a2 == 2)) || (!(a2 == 2) && 0 <= a0 + 44)) || (0 < a0 + 147 && a4 + 86 <= 0)))) || ((a29 + 16 <= 0 && a4 + 86 <= 0) && 0 <= a0 + 599999)) || ((44 <= a29 && a4 + 42 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 3) && a29 + 16 <= 0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 44 <= 0) && 0 <= a0 + 599999) || (((44 <= a29 && a2 == 2) && a0 + 44 <= 0) && 0 <= a0 + 599999)) || (a4 + 42 <= 0 && (((a4 + 86 <= 0 && !(a2 == 2)) || (!(a2 == 2) && 0 <= a0 + 44)) || (0 < a0 + 147 && a4 + 86 <= 0)))) || ((a29 + 16 <= 0 && a4 + 86 <= 0) && 0 <= a0 + 599999)) || ((44 <= a29 && a4 + 42 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 3) && a29 + 16 <= 0) - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((a4 + 42 <= 0 && a2 == 3) && a29 + 16 <= 0) || (a4 + 42 <= 0 && (((a4 + 86 <= 0 && !(a2 == 2)) || (!(a2 == 2) && 0 <= a0 + 44)) || (0 < a0 + 147 && a4 + 86 <= 0)))) || ((a29 + 16 <= 0 && a4 + 86 <= 0) && 0 <= a0 + 599999)) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a0 + 44 <= 0) && 0 <= a0 + 599999)) || (((44 <= a29 && a2 == 2) && a0 + 44 <= 0) && 0 <= a0 + 599999)) || ((44 <= a29 && a4 + 42 <= 0) && a2 == 3) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 110.8s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 79.9s AutomataDifference, 0.0s DeadEndRemovalTime, 9.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 3320 SDtfs, 15629 SDslu, 1223 SDs, 0 SdLazy, 31168 SolverSat, 6574 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 63.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2596 GetRequests, 2516 SyntacticMatches, 12 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18624occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 17637 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 389 NumberOfFragments, 361 HoareAnnotationTreeSize, 4 FomulaSimplifications, 884283 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 613280 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 9103 NumberOfCodeBlocks, 9103 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 9086 ConstructedInterpolants, 230 QuantifiedInterpolants, 36151463 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2927 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 8694/10116 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...