./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem16_label53_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem16_label53_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 e0ac1fa423e9e02c6d8ce0ab648943b01e42bafe .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 23:34:50,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:34:50,026 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:34:50,039 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:34:50,039 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:34:50,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:34:50,042 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:34:50,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:34:50,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:34:50,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:34:50,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:34:50,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:34:50,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:34:50,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:34:50,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:34:50,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:34:50,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:34:50,055 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:34:50,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:34:50,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:34:50,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:34:50,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:34:50,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:34:50,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:34:50,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:34:50,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:34:50,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:34:50,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:34:50,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:34:50,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:34:50,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:34:50,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:34:50,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:34:50,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:34:50,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:34:50,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:34:50,075 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 23:34:50,091 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:34:50,091 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:34:50,093 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:34:50,093 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:34:50,093 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:34:50,094 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:34:50,094 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:34:50,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:34:50,094 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:34:50,094 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:34:50,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:34:50,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:34:50,096 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:34:50,096 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:34:50,096 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:34:50,096 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:34:50,096 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:34:50,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:34:50,097 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:34:50,097 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:34:50,097 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:34:50,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:34:50,098 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:34:50,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:34:50,099 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:34:50,099 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:34:50,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:34:50,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:34:50,100 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 -> e0ac1fa423e9e02c6d8ce0ab648943b01e42bafe [2018-12-30 23:34:50,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:34:50,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:34:50,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:34:50,155 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:34:50,155 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:34:50,156 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem16_label53_true-unreach-call.c [2018-12-30 23:34:50,213 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6a79a79/4b5972b284314b2b817b8e74480d5a27/FLAG9714ed054 [2018-12-30 23:34:50,926 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:34:50,927 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem16_label53_true-unreach-call.c [2018-12-30 23:34:50,948 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6a79a79/4b5972b284314b2b817b8e74480d5a27/FLAG9714ed054 [2018-12-30 23:34:51,048 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a6a79a79/4b5972b284314b2b817b8e74480d5a27 [2018-12-30 23:34:51,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:34:51,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:34:51,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:34:51,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:34:51,060 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:34:51,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:34:51" (1/1) ... [2018-12-30 23:34:51,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf28d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:51, skipping insertion in model container [2018-12-30 23:34:51,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:34:51" (1/1) ... [2018-12-30 23:34:51,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:34:51,175 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:34:52,006 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:34:52,014 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:34:52,270 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:34:52,316 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:34:52,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52 WrapperNode [2018-12-30 23:34:52,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:34:52,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:34:52,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:34:52,321 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:34:52,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... [2018-12-30 23:34:52,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... [2018-12-30 23:34:52,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:34:52,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:34:52,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:34:52,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:34:52,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... [2018-12-30 23:34:52,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... [2018-12-30 23:34:52,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... [2018-12-30 23:34:52,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... [2018-12-30 23:34:52,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... [2018-12-30 23:34:52,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... [2018-12-30 23:34:52,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... [2018-12-30 23:34:52,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:34:52,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:34:52,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:34:52,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:34:52,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:34:52,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:34:52,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:34:59,011 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:34:59,012 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-30 23:34:59,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:34:59 BoogieIcfgContainer [2018-12-30 23:34:59,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:34:59,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:34:59,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:34:59,018 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:34:59,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:34:51" (1/3) ... [2018-12-30 23:34:59,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4a8d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:34:59, skipping insertion in model container [2018-12-30 23:34:59,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:34:52" (2/3) ... [2018-12-30 23:34:59,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4a8d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:34:59, skipping insertion in model container [2018-12-30 23:34:59,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:34:59" (3/3) ... [2018-12-30 23:34:59,022 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label53_true-unreach-call.c [2018-12-30 23:34:59,032 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:34:59,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:34:59,061 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:34:59,110 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:34:59,111 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:34:59,111 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:34:59,111 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:34:59,111 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:34:59,111 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:34:59,112 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:34:59,112 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:34:59,112 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:34:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2018-12-30 23:34:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 23:34:59,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:34:59,156 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] [2018-12-30 23:34:59,159 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:34:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:34:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2018-12-30 23:34:59,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:34:59,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:34:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:34:59,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:34:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:34:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:34:59,631 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-30 23:34:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:34:59,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:34:59,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:34:59,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:34:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:34:59,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:34:59,677 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2018-12-30 23:35:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:04,912 INFO L93 Difference]: Finished difference Result 1454 states and 2762 transitions. [2018-12-30 23:35:04,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:35:04,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-30 23:35:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:04,940 INFO L225 Difference]: With dead ends: 1454 [2018-12-30 23:35:04,940 INFO L226 Difference]: Without dead ends: 991 [2018-12-30 23:35:04,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:35:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-12-30 23:35:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2018-12-30 23:35:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2018-12-30 23:35:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1615 transitions. [2018-12-30 23:35:05,064 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1615 transitions. Word has length 37 [2018-12-30 23:35:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:05,065 INFO L480 AbstractCegarLoop]: Abstraction has 991 states and 1615 transitions. [2018-12-30 23:35:05,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:35:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1615 transitions. [2018-12-30 23:35:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-30 23:35:05,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:05,076 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:35:05,077 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:05,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1477322986, now seen corresponding path program 1 times [2018-12-30 23:35:05,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:05,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:05,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 23:35:05,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:05,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:35:05,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:35:05,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:35:05,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:35:05,438 INFO L87 Difference]: Start difference. First operand 991 states and 1615 transitions. Second operand 5 states. [2018-12-30 23:35:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:10,222 INFO L93 Difference]: Finished difference Result 2309 states and 3677 transitions. [2018-12-30 23:35:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:35:10,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 196 [2018-12-30 23:35:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:10,231 INFO L225 Difference]: With dead ends: 2309 [2018-12-30 23:35:10,231 INFO L226 Difference]: Without dead ends: 1320 [2018-12-30 23:35:10,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:35:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2018-12-30 23:35:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2018-12-30 23:35:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2018-12-30 23:35:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1866 transitions. [2018-12-30 23:35:10,264 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1866 transitions. Word has length 196 [2018-12-30 23:35:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:10,265 INFO L480 AbstractCegarLoop]: Abstraction has 1320 states and 1866 transitions. [2018-12-30 23:35:10,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:35:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1866 transitions. [2018-12-30 23:35:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-30 23:35:10,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:10,271 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:35:10,271 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2098910767, now seen corresponding path program 1 times [2018-12-30 23:35:10,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:10,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:10,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:10,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-30 23:35:10,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:10,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:35:10,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:35:10,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:35:10,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:35:10,579 INFO L87 Difference]: Start difference. First operand 1320 states and 1866 transitions. Second operand 4 states. [2018-12-30 23:35:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:15,162 INFO L93 Difference]: Finished difference Result 4941 states and 6928 transitions. [2018-12-30 23:35:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:35:15,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-30 23:35:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:15,181 INFO L225 Difference]: With dead ends: 4941 [2018-12-30 23:35:15,182 INFO L226 Difference]: Without dead ends: 3623 [2018-12-30 23:35:15,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:35:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2018-12-30 23:35:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623. [2018-12-30 23:35:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2018-12-30 23:35:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4625 transitions. [2018-12-30 23:35:15,254 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4625 transitions. Word has length 197 [2018-12-30 23:35:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:15,255 INFO L480 AbstractCegarLoop]: Abstraction has 3623 states and 4625 transitions. [2018-12-30 23:35:15,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:35:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4625 transitions. [2018-12-30 23:35:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-30 23:35:15,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:15,263 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:35:15,263 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:15,264 INFO L82 PathProgramCache]: Analyzing trace with hash -912780600, now seen corresponding path program 1 times [2018-12-30 23:35:15,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:15,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:15,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:15,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:15,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-30 23:35:15,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:15,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 23:35:15,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:35:15,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:35:15,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:35:15,652 INFO L87 Difference]: Start difference. First operand 3623 states and 4625 transitions. Second operand 3 states. [2018-12-30 23:35:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:17,397 INFO L93 Difference]: Finished difference Result 8889 states and 11524 transitions. [2018-12-30 23:35:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:35:17,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-12-30 23:35:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:17,423 INFO L225 Difference]: With dead ends: 8889 [2018-12-30 23:35:17,423 INFO L226 Difference]: Without dead ends: 5268 [2018-12-30 23:35:17,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:35:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2018-12-30 23:35:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 3952. [2018-12-30 23:35:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2018-12-30 23:35:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5003 transitions. [2018-12-30 23:35:17,507 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5003 transitions. Word has length 300 [2018-12-30 23:35:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:17,508 INFO L480 AbstractCegarLoop]: Abstraction has 3952 states and 5003 transitions. [2018-12-30 23:35:17,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:35:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5003 transitions. [2018-12-30 23:35:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-12-30 23:35:17,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:17,520 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, 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, 4, 4, 3, 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] [2018-12-30 23:35:17,520 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:17,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2049856684, now seen corresponding path program 1 times [2018-12-30 23:35:17,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:17,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:17,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:17,913 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2018-12-30 23:35:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2018-12-30 23:35:18,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:18,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:35:18,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:35:18,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:35:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:35:18,211 INFO L87 Difference]: Start difference. First operand 3952 states and 5003 transitions. Second operand 4 states. [2018-12-30 23:35:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:21,319 INFO L93 Difference]: Finished difference Result 14811 states and 18613 transitions. [2018-12-30 23:35:21,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:35:21,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2018-12-30 23:35:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:21,368 INFO L225 Difference]: With dead ends: 14811 [2018-12-30 23:35:21,368 INFO L226 Difference]: Without dead ends: 10861 [2018-12-30 23:35:21,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:35:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2018-12-30 23:35:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 7242. [2018-12-30 23:35:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7242 states. [2018-12-30 23:35:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 9061 transitions. [2018-12-30 23:35:21,527 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 9061 transitions. Word has length 466 [2018-12-30 23:35:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:21,528 INFO L480 AbstractCegarLoop]: Abstraction has 7242 states and 9061 transitions. [2018-12-30 23:35:21,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:35:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 9061 transitions. [2018-12-30 23:35:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-12-30 23:35:21,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:21,543 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:35:21,543 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:21,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash -486035987, now seen corresponding path program 1 times [2018-12-30 23:35:21,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:21,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:21,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:21,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:21,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:21,973 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-30 23:35:22,121 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-12-30 23:35:22,331 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-12-30 23:35:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-30 23:35:23,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:23,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:35:23,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:35:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:35:23,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:35:23,102 INFO L87 Difference]: Start difference. First operand 7242 states and 9061 transitions. Second operand 7 states. [2018-12-30 23:35:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:28,014 INFO L93 Difference]: Finished difference Result 14813 states and 18463 transitions. [2018-12-30 23:35:28,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:35:28,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 505 [2018-12-30 23:35:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:28,049 INFO L225 Difference]: With dead ends: 14813 [2018-12-30 23:35:28,049 INFO L226 Difference]: Without dead ends: 7573 [2018-12-30 23:35:28,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:35:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2018-12-30 23:35:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7571. [2018-12-30 23:35:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2018-12-30 23:35:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 9396 transitions. [2018-12-30 23:35:28,202 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 9396 transitions. Word has length 505 [2018-12-30 23:35:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:28,203 INFO L480 AbstractCegarLoop]: Abstraction has 7571 states and 9396 transitions. [2018-12-30 23:35:28,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:35:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 9396 transitions. [2018-12-30 23:35:28,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-12-30 23:35:28,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:28,225 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, 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, 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] [2018-12-30 23:35:28,225 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:28,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:28,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1206968833, now seen corresponding path program 1 times [2018-12-30 23:35:28,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:28,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:28,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:28,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:28,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:28,867 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-30 23:35:29,209 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-30 23:35:29,581 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-12-30 23:35:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-12-30 23:35:29,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:29,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:35:29,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:35:29,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:35:29,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:35:29,952 INFO L87 Difference]: Start difference. First operand 7571 states and 9396 transitions. Second operand 7 states. [2018-12-30 23:35:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:33,094 INFO L93 Difference]: Finished difference Result 14999 states and 18643 transitions. [2018-12-30 23:35:33,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:35:33,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 592 [2018-12-30 23:35:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:33,118 INFO L225 Difference]: With dead ends: 14999 [2018-12-30 23:35:33,118 INFO L226 Difference]: Without dead ends: 7571 [2018-12-30 23:35:33,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:35:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2018-12-30 23:35:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2018-12-30 23:35:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2018-12-30 23:35:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 8226 transitions. [2018-12-30 23:35:33,226 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 8226 transitions. Word has length 592 [2018-12-30 23:35:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:33,227 INFO L480 AbstractCegarLoop]: Abstraction has 7571 states and 8226 transitions. [2018-12-30 23:35:33,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:35:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 8226 transitions. [2018-12-30 23:35:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2018-12-30 23:35:33,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:33,237 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-12-30 23:35:33,237 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1851622877, now seen corresponding path program 1 times [2018-12-30 23:35:33,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:33,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:33,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-12-30 23:35:34,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:34,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:35:34,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:35:34,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:35:34,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:35:34,018 INFO L87 Difference]: Start difference. First operand 7571 states and 8226 transitions. Second operand 4 states. [2018-12-30 23:35:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:37,502 INFO L93 Difference]: Finished difference Result 17114 states and 18620 transitions. [2018-12-30 23:35:37,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:35:37,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 620 [2018-12-30 23:35:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:37,529 INFO L225 Difference]: With dead ends: 17114 [2018-12-30 23:35:37,529 INFO L226 Difference]: Without dead ends: 9874 [2018-12-30 23:35:37,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:35:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9874 states. [2018-12-30 23:35:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9874 to 9216. [2018-12-30 23:35:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9216 states. [2018-12-30 23:35:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9845 transitions. [2018-12-30 23:35:37,658 INFO L78 Accepts]: Start accepts. Automaton has 9216 states and 9845 transitions. Word has length 620 [2018-12-30 23:35:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:37,659 INFO L480 AbstractCegarLoop]: Abstraction has 9216 states and 9845 transitions. [2018-12-30 23:35:37,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:35:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states and 9845 transitions. [2018-12-30 23:35:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2018-12-30 23:35:37,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:37,677 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:35:37,678 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash 920429046, now seen corresponding path program 1 times [2018-12-30 23:35:37,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:37,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:37,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:37,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 875 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-30 23:35:38,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:38,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:35:38,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:35:38,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:35:38,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:35:38,430 INFO L87 Difference]: Start difference. First operand 9216 states and 9845 transitions. Second operand 4 states. [2018-12-30 23:35:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:40,873 INFO L93 Difference]: Finished difference Result 20733 states and 22166 transitions. [2018-12-30 23:35:40,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:35:40,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 782 [2018-12-30 23:35:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:40,895 INFO L225 Difference]: With dead ends: 20733 [2018-12-30 23:35:40,895 INFO L226 Difference]: Without dead ends: 11848 [2018-12-30 23:35:40,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:35:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2018-12-30 23:35:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 10861. [2018-12-30 23:35:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2018-12-30 23:35:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11439 transitions. [2018-12-30 23:35:41,042 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11439 transitions. Word has length 782 [2018-12-30 23:35:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:41,043 INFO L480 AbstractCegarLoop]: Abstraction has 10861 states and 11439 transitions. [2018-12-30 23:35:41,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:35:41,043 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11439 transitions. [2018-12-30 23:35:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2018-12-30 23:35:41,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:41,069 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:35:41,069 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:41,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:41,070 INFO L82 PathProgramCache]: Analyzing trace with hash -573342841, now seen corresponding path program 1 times [2018-12-30 23:35:41,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:41,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:41,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:41,648 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-30 23:35:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2045 backedges. 1273 proven. 6 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2018-12-30 23:35:42,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:35:42,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:35:42,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:42,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:35:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2045 backedges. 1273 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2018-12-30 23:35:43,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:35:43,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 23:35:43,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:35:43,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:35:43,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:35:43,532 INFO L87 Difference]: Start difference. First operand 10861 states and 11439 transitions. Second operand 5 states. [2018-12-30 23:35:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:47,245 INFO L93 Difference]: Finished difference Result 27313 states and 28739 transitions. [2018-12-30 23:35:47,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:35:47,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1060 [2018-12-30 23:35:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:47,273 INFO L225 Difference]: With dead ends: 27313 [2018-12-30 23:35:47,274 INFO L226 Difference]: Without dead ends: 15138 [2018-12-30 23:35:47,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 1060 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:35:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2018-12-30 23:35:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 12506. [2018-12-30 23:35:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2018-12-30 23:35:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 13044 transitions. [2018-12-30 23:35:47,473 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 13044 transitions. Word has length 1060 [2018-12-30 23:35:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:47,474 INFO L480 AbstractCegarLoop]: Abstraction has 12506 states and 13044 transitions. [2018-12-30 23:35:47,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:35:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 13044 transitions. [2018-12-30 23:35:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1576 [2018-12-30 23:35:47,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:47,517 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:35:47,518 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash -147486429, now seen corresponding path program 1 times [2018-12-30 23:35:47,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:47,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:47,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:47,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:48,407 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-30 23:35:48,679 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-30 23:35:48,939 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 12 [2018-12-30 23:35:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4451 backedges. 3102 proven. 0 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2018-12-30 23:35:50,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:35:50,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:35:50,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:35:50,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:35:50,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:35:50,896 INFO L87 Difference]: Start difference. First operand 12506 states and 13044 transitions. Second operand 6 states. [2018-12-30 23:35:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:35:53,724 INFO L93 Difference]: Finished difference Result 25348 states and 26440 transitions. [2018-12-30 23:35:53,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:35:53,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1575 [2018-12-30 23:35:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:35:53,751 INFO L225 Difference]: With dead ends: 25348 [2018-12-30 23:35:53,751 INFO L226 Difference]: Without dead ends: 13173 [2018-12-30 23:35:53,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:35:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13173 states. [2018-12-30 23:35:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13173 to 12835. [2018-12-30 23:35:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12835 states. [2018-12-30 23:35:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13379 transitions. [2018-12-30 23:35:53,915 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13379 transitions. Word has length 1575 [2018-12-30 23:35:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:35:53,917 INFO L480 AbstractCegarLoop]: Abstraction has 12835 states and 13379 transitions. [2018-12-30 23:35:53,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:35:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13379 transitions. [2018-12-30 23:35:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1787 [2018-12-30 23:35:53,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:35:53,966 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 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, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:35:53,966 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:35:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:35:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1060144217, now seen corresponding path program 1 times [2018-12-30 23:35:53,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:35:53,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:35:53,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:53,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:53,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:35:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:35:54,920 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-30 23:35:55,242 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-12-30 23:35:55,997 WARN L181 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-12-30 23:35:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6345 backedges. 2571 proven. 242 refuted. 0 times theorem prover too weak. 3532 trivial. 0 not checked. [2018-12-30 23:35:59,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:35:59,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:35:59,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:35:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:00,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:36:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6345 backedges. 2571 proven. 0 refuted. 0 times theorem prover too weak. 3774 trivial. 0 not checked. [2018-12-30 23:36:02,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:36:02,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2018-12-30 23:36:02,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:36:02,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:36:02,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:36:02,222 INFO L87 Difference]: Start difference. First operand 12835 states and 13379 transitions. Second operand 9 states. [2018-12-30 23:36:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:08,420 INFO L93 Difference]: Finished difference Result 27317 states and 28463 transitions. [2018-12-30 23:36:08,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:36:08,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1786 [2018-12-30 23:36:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:08,448 INFO L225 Difference]: With dead ends: 27317 [2018-12-30 23:36:08,449 INFO L226 Difference]: Without dead ends: 14813 [2018-12-30 23:36:08,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1800 GetRequests, 1785 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:36:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14813 states. [2018-12-30 23:36:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14813 to 12835. [2018-12-30 23:36:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12835 states. [2018-12-30 23:36:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13377 transitions. [2018-12-30 23:36:08,670 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13377 transitions. Word has length 1786 [2018-12-30 23:36:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:08,672 INFO L480 AbstractCegarLoop]: Abstraction has 12835 states and 13377 transitions. [2018-12-30 23:36:08,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:36:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13377 transitions. [2018-12-30 23:36:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1817 [2018-12-30 23:36:08,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:36:08,744 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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] [2018-12-30 23:36:08,745 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:36:08,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:36:08,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1280677957, now seen corresponding path program 1 times [2018-12-30 23:36:08,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:36:08,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:36:08,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:08,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:08,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:09,678 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-12-30 23:36:09,996 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-12-30 23:36:10,326 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-30 23:36:10,782 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-12-30 23:36:11,288 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-12-30 23:36:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7193 backedges. 2574 proven. 157 refuted. 0 times theorem prover too weak. 4462 trivial. 0 not checked. [2018-12-30 23:36:13,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:36:13,713 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 [2018-12-30 23:36:13,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:14,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:36:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7193 backedges. 2731 proven. 0 refuted. 0 times theorem prover too weak. 4462 trivial. 0 not checked. [2018-12-30 23:36:16,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:36:16,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-12-30 23:36:16,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:36:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:36:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:36:16,324 INFO L87 Difference]: Start difference. First operand 12835 states and 13377 transitions. Second operand 9 states. [2018-12-30 23:36:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:23,372 INFO L93 Difference]: Finished difference Result 36002 states and 37540 transitions. [2018-12-30 23:36:23,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-30 23:36:23,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1816 [2018-12-30 23:36:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:23,407 INFO L225 Difference]: With dead ends: 36002 [2018-12-30 23:36:23,407 INFO L226 Difference]: Without dead ends: 23169 [2018-12-30 23:36:23,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1842 GetRequests, 1824 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-12-30 23:36:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23169 states. [2018-12-30 23:36:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23169 to 18099. [2018-12-30 23:36:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18099 states. [2018-12-30 23:36:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18823 transitions. [2018-12-30 23:36:23,700 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18823 transitions. Word has length 1816 [2018-12-30 23:36:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:23,701 INFO L480 AbstractCegarLoop]: Abstraction has 18099 states and 18823 transitions. [2018-12-30 23:36:23,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:36:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18823 transitions. [2018-12-30 23:36:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1989 [2018-12-30 23:36:23,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:36:23,753 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-30 23:36:23,753 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:36:23,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:36:23,754 INFO L82 PathProgramCache]: Analyzing trace with hash -917324877, now seen corresponding path program 1 times [2018-12-30 23:36:23,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:36:23,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:36:23,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:23,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:23,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:25,204 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2018-12-30 23:36:25,379 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-30 23:36:25,952 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2018-12-30 23:36:26,495 WARN L181 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-12-30 23:36:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 7509 backedges. 3472 proven. 249 refuted. 0 times theorem prover too weak. 3788 trivial. 0 not checked. [2018-12-30 23:36:31,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:36:31,942 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 [2018-12-30 23:36:31,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:32,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:36:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7509 backedges. 4135 proven. 0 refuted. 0 times theorem prover too weak. 3374 trivial. 0 not checked. [2018-12-30 23:36:34,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:36:34,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2018-12-30 23:36:34,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:36:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:36:34,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:36:34,168 INFO L87 Difference]: Start difference. First operand 18099 states and 18823 transitions. Second operand 9 states. [2018-12-30 23:36:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:42,193 INFO L93 Difference]: Finished difference Result 39835 states and 41450 transitions. [2018-12-30 23:36:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:36:42,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1988 [2018-12-30 23:36:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:42,216 INFO L225 Difference]: With dead ends: 39835 [2018-12-30 23:36:42,216 INFO L226 Difference]: Without dead ends: 21738 [2018-12-30 23:36:42,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2008 GetRequests, 1991 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:36:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21738 states. [2018-12-30 23:36:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21738 to 20934. [2018-12-30 23:36:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20934 states. [2018-12-30 23:36:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20934 states to 20934 states and 21537 transitions. [2018-12-30 23:36:42,510 INFO L78 Accepts]: Start accepts. Automaton has 20934 states and 21537 transitions. Word has length 1988 [2018-12-30 23:36:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:42,511 INFO L480 AbstractCegarLoop]: Abstraction has 20934 states and 21537 transitions. [2018-12-30 23:36:42,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:36:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 20934 states and 21537 transitions. [2018-12-30 23:36:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2300 [2018-12-30 23:36:42,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:36:42,564 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:36:42,565 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:36:42,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:36:42,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1315368267, now seen corresponding path program 1 times [2018-12-30 23:36:42,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:36:42,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:36:42,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:42,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:43,914 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-30 23:36:44,170 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-30 23:36:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9548 backedges. 4862 proven. 569 refuted. 0 times theorem prover too weak. 4117 trivial. 0 not checked. [2018-12-30 23:36:47,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:36:47,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:36:47,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:36:48,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:36:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9548 backedges. 4967 proven. 464 refuted. 0 times theorem prover too weak. 4117 trivial. 0 not checked. [2018-12-30 23:36:52,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:36:52,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2018-12-30 23:36:52,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:36:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:36:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:36:52,108 INFO L87 Difference]: Start difference. First operand 20934 states and 21537 transitions. Second operand 9 states. [2018-12-30 23:36:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:36:57,853 INFO L93 Difference]: Finished difference Result 45527 states and 46810 transitions. [2018-12-30 23:36:57,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-30 23:36:57,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2299 [2018-12-30 23:36:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:36:57,880 INFO L225 Difference]: With dead ends: 45527 [2018-12-30 23:36:57,880 INFO L226 Difference]: Without dead ends: 25253 [2018-12-30 23:36:57,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2312 GetRequests, 2299 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-30 23:36:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25253 states. [2018-12-30 23:36:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25253 to 22462. [2018-12-30 23:36:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22462 states. [2018-12-30 23:36:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22462 states to 22462 states and 23044 transitions. [2018-12-30 23:36:58,167 INFO L78 Accepts]: Start accepts. Automaton has 22462 states and 23044 transitions. Word has length 2299 [2018-12-30 23:36:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:36:58,168 INFO L480 AbstractCegarLoop]: Abstraction has 22462 states and 23044 transitions. [2018-12-30 23:36:58,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:36:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 22462 states and 23044 transitions. [2018-12-30 23:36:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2322 [2018-12-30 23:36:58,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:36:58,215 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:36:58,215 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:36:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:36:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash -540256854, now seen corresponding path program 1 times [2018-12-30 23:36:58,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:36:58,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:36:58,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:58,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:36:58,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:36:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:37:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9704 backedges. 6474 proven. 2243 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2018-12-30 23:37:07,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:37:07,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:37:07,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:37:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:37:08,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:37:09,336 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a18~0_902 Int)) (let ((.cse0 (mod v_~a18~0_902 299922))) (and (<= .cse0 (+ c_~a18~0 300079)) (= 0 .cse0)))) (exists ((v_prenex_1 Int)) (let ((.cse1 (mod v_prenex_1 299922))) (and (<= .cse1 (+ c_~a18~0 600001)) (< v_prenex_1 0) (not (= 0 .cse1))))) (exists ((v_prenex_2 Int)) (and (<= (mod v_prenex_2 299922) (+ c_~a18~0 300079)) (<= 0 v_prenex_2)))) is different from true [2018-12-30 23:37:09,914 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-12-30 23:37:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9704 backedges. 1467 proven. 0 refuted. 0 times theorem prover too weak. 8202 trivial. 35 not checked. [2018-12-30 23:37:13,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:37:13,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-12-30 23:37:13,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-30 23:37:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-30 23:37:13,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2018-12-30 23:37:13,785 INFO L87 Difference]: Start difference. First operand 22462 states and 23044 transitions. Second operand 11 states. [2018-12-30 23:37:26,498 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2018-12-30 23:37:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:37:35,583 INFO L93 Difference]: Finished difference Result 47869 states and 49104 transitions. [2018-12-30 23:37:35,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-30 23:37:35,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 2321 [2018-12-30 23:37:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:37:35,608 INFO L225 Difference]: With dead ends: 47869 [2018-12-30 23:37:35,609 INFO L226 Difference]: Without dead ends: 26067 [2018-12-30 23:37:35,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2351 GetRequests, 2328 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=58, Invalid=213, Unknown=5, NotChecked=30, Total=306 [2018-12-30 23:37:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26067 states. [2018-12-30 23:37:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26067 to 23449. [2018-12-30 23:37:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23449 states. [2018-12-30 23:37:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23449 states to 23449 states and 23968 transitions. [2018-12-30 23:37:35,907 INFO L78 Accepts]: Start accepts. Automaton has 23449 states and 23968 transitions. Word has length 2321 [2018-12-30 23:37:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:37:35,909 INFO L480 AbstractCegarLoop]: Abstraction has 23449 states and 23968 transitions. [2018-12-30 23:37:35,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-30 23:37:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 23449 states and 23968 transitions. [2018-12-30 23:37:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2718 [2018-12-30 23:37:35,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:37:35,985 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-12-30 23:37:35,986 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:37:35,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:37:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1837760336, now seen corresponding path program 1 times [2018-12-30 23:37:35,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:37:35,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:37:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:37:35,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:37:35,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:37:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:37:37,864 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-30 23:37:38,112 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-30 23:37:38,302 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-30 23:37:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12860 backedges. 8330 proven. 1970 refuted. 0 times theorem prover too weak. 2560 trivial. 0 not checked. [2018-12-30 23:37:46,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:37:46,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:37:46,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:37:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:37:47,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:37:48,138 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-12-30 23:37:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12860 backedges. 9270 proven. 1030 refuted. 0 times theorem prover too weak. 2560 trivial. 0 not checked. [2018-12-30 23:37:56,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:37:56,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2018-12-30 23:37:56,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-30 23:37:56,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-30 23:37:56,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-12-30 23:37:56,764 INFO L87 Difference]: Start difference. First operand 23449 states and 23968 transitions. Second operand 19 states. [2018-12-30 23:38:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:38:08,408 INFO L93 Difference]: Finished difference Result 46896 states and 47940 transitions. [2018-12-30 23:38:08,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-30 23:38:08,409 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 2717 [2018-12-30 23:38:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:38:08,435 INFO L225 Difference]: With dead ends: 46896 [2018-12-30 23:38:08,435 INFO L226 Difference]: Without dead ends: 24107 [2018-12-30 23:38:08,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2737 GetRequests, 2716 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2018-12-30 23:38:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24107 states. [2018-12-30 23:38:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24107 to 20853. [2018-12-30 23:38:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20853 states. [2018-12-30 23:38:08,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20853 states to 20853 states and 21156 transitions. [2018-12-30 23:38:08,692 INFO L78 Accepts]: Start accepts. Automaton has 20853 states and 21156 transitions. Word has length 2717 [2018-12-30 23:38:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:38:08,695 INFO L480 AbstractCegarLoop]: Abstraction has 20853 states and 21156 transitions. [2018-12-30 23:38:08,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-30 23:38:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 20853 states and 21156 transitions. [2018-12-30 23:38:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2812 [2018-12-30 23:38:08,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:38:08,773 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:38:08,774 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:38:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:38:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1586490837, now seen corresponding path program 1 times [2018-12-30 23:38:08,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:38:08,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:38:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:38:08,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:38:08,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:38:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:38:10,215 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-30 23:38:10,470 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-12-30 23:38:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13540 backedges. 7231 proven. 1107 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-12-30 23:38:15,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:38:15,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:38:15,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:38:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:38:15,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:38:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13540 backedges. 2908 proven. 0 refuted. 0 times theorem prover too weak. 10632 trivial. 0 not checked. [2018-12-30 23:38:21,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:38:21,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-12-30 23:38:21,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:38:21,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:38:21,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:38:21,350 INFO L87 Difference]: Start difference. First operand 20853 states and 21156 transitions. Second operand 9 states. [2018-12-30 23:38:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:38:26,989 INFO L93 Difference]: Finished difference Result 41151 states and 41756 transitions. [2018-12-30 23:38:26,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:38:26,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2811 [2018-12-30 23:38:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:38:26,995 INFO L225 Difference]: With dead ends: 41151 [2018-12-30 23:38:26,995 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:38:27,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2828 GetRequests, 2815 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-12-30 23:38:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:38:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:38:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:38:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:38:27,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2811 [2018-12-30 23:38:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:38:27,010 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:38:27,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:38:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:38:27,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:38:27,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:38:27,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:27,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:27,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:27,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:27,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:27,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:27,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:27,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:27,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:27,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:28,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:28,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:28,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:28,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:28,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:28,325 WARN L181 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 602 DAG size of output: 499 [2018-12-30 23:38:28,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:28,815 WARN L181 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 327 [2018-12-30 23:38:28,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:28,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:38:29,837 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 605 DAG size of output: 500 [2018-12-30 23:38:47,400 WARN L181 SmtUtils]: Spent 17.56 s on a formula simplification. DAG size of input: 468 DAG size of output: 139 [2018-12-30 23:38:53,764 WARN L181 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 317 DAG size of output: 127 [2018-12-30 23:39:08,475 WARN L181 SmtUtils]: Spent 14.71 s on a formula simplification. DAG size of input: 468 DAG size of output: 139 [2018-12-30 23:39:08,478 INFO L448 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,479 INFO L448 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,480 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,480 INFO L448 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,480 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,480 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:39:08,480 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,480 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:39:08,480 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:39:08,481 INFO L444 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse2 (= ~a12~0 7)) (.cse4 (= ~a16~0 10))) (let ((.cse13 (<= ~a16~0 11)) (.cse33 (not .cse4)) (.cse11 (= ~a15~0 3)) (.cse30 (not .cse2))) (let ((.cse15 (= ~a12~0 6)) (.cse1 (= ~a16~0 9)) (.cse17 (and .cse13 .cse33 .cse11 .cse30)) (.cse24 (= 4 ULTIMATE.start_calculate_output_~input)) (.cse23 (= 3 ULTIMATE.start_calculate_output_~input)) (.cse20 (= 6 ULTIMATE.start_calculate_output_~input)) (.cse22 (= 5 ULTIMATE.start_calculate_output_~input)) (.cse31 (and .cse13 .cse33 .cse11)) (.cse3 (= ~a12~0 5)) (.cse14 (<= (+ ~a18~0 79) 0))) (let ((.cse26 (and .cse13 .cse33 .cse3 .cse14)) (.cse25 (or (and .cse31 .cse14) (and (<= (+ ~a18~0 87) 0) .cse11 .cse30))) (.cse19 (and .cse13 .cse33 .cse14)) (.cse21 (or (= 2 ULTIMATE.start_calculate_output_~input) .cse24 .cse23 .cse20 (= 1 ULTIMATE.start_calculate_output_~input) .cse22)) (.cse28 (and (not (= 8 ~a12~0)) .cse17)) (.cse8 (= ~a12~0 9)) (.cse5 (= ~a16~0 8)) (.cse16 (exists ((v_prenex_1 Int)) (let ((.cse34 (mod v_prenex_1 299922))) (and (< v_prenex_1 0) (not (= 0 .cse34)) (<= (+ .cse34 150) ~a18~0))))) (.cse12 (not .cse1)) (.cse7 (= ~a12~0 8)) (.cse10 (<= 11 ~a16~0)) (.cse6 (<= ~a18~0 134)) (.cse9 (< 0 (+ ~a18~0 156))) (.cse0 (= ~a15~0 4)) (.cse29 (and .cse13 .cse33 .cse15)) (.cse27 (<= (+ ~a18~0 391209) 0)) (.cse32 (< 134 ~a18~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 (<= 598710 ~a18~0) (not (= 2 ULTIMATE.start_calculate_output2_~input)) .cse4) (and .cse5 .cse0 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse8 .cse9) (and .cse10 .cse11 .cse6 .cse7) (and .cse11 .cse6 .cse3 .cse9) (and .cse0 (and .cse12 .cse3 (and .cse13 .cse14))) (and .cse11 (<= 594219 ~a18~0) .cse15) (and .cse0 .cse5 .cse2 .cse6) (and .cse16 .cse0 .cse5 .cse8) (and .cse16 .cse11 .cse3) (and .cse10 .cse11 .cse8) (and .cse5 .cse17) (and .cse11 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse6 .cse7 .cse9) (and (exists ((v_prenex_1 Int)) (let ((.cse18 (mod v_prenex_1 299922))) (and (<= .cse18 (+ ~a18~0 600001)) (< v_prenex_1 0) (not (= 0 .cse18))))) .cse1 .cse19 (not .cse20) .cse21 (not .cse22) (not .cse23) (not .cse24) .cse8 .cse0) (and .cse25 .cse2) (and .cse0 .cse9 .cse26) (and .cse12 (and .cse13 .cse11 .cse15)) (and .cse0 (and .cse26 .cse27)) (and .cse16 .cse28) (and .cse7 .cse25) (and .cse0 .cse1 .cse19 .cse21 .cse8 .cse9) (and .cse28 .cse8 .cse9) (and .cse0 (and .cse13 .cse12 .cse15)) (and .cse0 (and .cse6 .cse29) .cse9) (and .cse10 .cse11 .cse30 .cse14) (and .cse0 .cse3 .cse5) (and (and .cse31 .cse2) .cse32) (and .cse16 .cse13 .cse11 .cse12 .cse30 (not (= 9 ~a12~0))) (and .cse16 .cse11 .cse12 .cse7) (and .cse7 (and .cse17 .cse6)) (and .cse10 .cse11 .cse6 .cse2 .cse9) (and .cse0 .cse29 .cse27) (and (and .cse13 .cse11 .cse3) .cse32)))))) [2018-12-30 23:39:08,481 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,481 INFO L448 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,481 INFO L448 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,481 INFO L448 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,481 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,481 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,481 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,482 INFO L448 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,483 INFO L448 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,484 INFO L448 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:39:08,485 INFO L448 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,486 INFO L444 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse6 (= ~a12~0 7)) (.cse15 (= ~a16~0 10))) (let ((.cse3 (<= ~a16~0 11)) (.cse25 (not .cse15)) (.cse8 (= ~a15~0 3)) (.cse9 (not .cse6))) (let ((.cse10 (= ~a12~0 6)) (.cse19 (and .cse3 .cse25 .cse8 .cse9)) (.cse5 (= ~a16~0 9)) (.cse2 (= ~a12~0 5)) (.cse4 (<= (+ ~a18~0 79) 0))) (let ((.cse16 (= 3 ULTIMATE.start_calculate_output_~input)) (.cse11 (= ~a16~0 8)) (.cse17 (and .cse3 .cse25 .cse2 .cse4)) (.cse20 (exists ((v_prenex_1 Int)) (let ((.cse26 (mod v_prenex_1 299922))) (and (< v_prenex_1 0) (not (= 0 .cse26)) (<= (+ .cse26 150) ~a18~0))))) (.cse23 (and .cse3 .cse25 .cse8)) (.cse1 (not .cse5)) (.cse18 (= ~a12~0 8)) (.cse7 (<= 11 ~a16~0)) (.cse12 (<= ~a18~0 134)) (.cse13 (= ~a12~0 9)) (.cse14 (< 0 (+ ~a18~0 156))) (.cse21 (and (not (= 8 ~a12~0)) .cse19)) (.cse0 (= ~a15~0 4)) (.cse22 (and .cse3 .cse25 .cse10)) (.cse24 (<= (+ ~a18~0 391209) 0))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4))) (and .cse0 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse4) (and .cse0 .cse3 .cse1 .cse10) (and .cse1 (and .cse3 .cse8 .cse10)) (and .cse11 .cse0 .cse12 .cse13 .cse14) (and .cse11 .cse0 .cse6 .cse12) (and .cse0 .cse2 (<= 598710 ~a18~0) (not (= 2 ULTIMATE.start_calculate_output2_~input)) .cse15) (and .cse0 (or (not .cse16) .cse12) .cse2 .cse11) (and .cse0 .cse17 .cse14) (and .cse7 .cse8 .cse13) (and .cse11 .cse0 .cse12 .cse18) (and (and .cse19 .cse12) .cse18) (and .cse0 .cse5 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) .cse16 (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse4 .cse13 .cse14) (and .cse20 .cse11 .cse0 .cse13) (and .cse20 .cse21) (and (and (<= (+ ~a18~0 87) 0) .cse8) .cse18) (and .cse7 .cse8 .cse12 .cse18) (and .cse8 .cse12 .cse2 .cse14) (and .cse0 (and .cse12 .cse22) .cse14) (and .cse8 (<= 594219 ~a18~0) .cse10) (and (and .cse23 .cse6) (< 134 ~a18~0)) (and .cse20 .cse3 .cse8 .cse1 .cse9 (not (= 9 ~a12~0))) (and .cse20 .cse8 .cse2) (and .cse11 .cse19) (and (and .cse3 .cse8 .cse2) .cse14) (and .cse0 .cse17 .cse24) (and .cse20 .cse8 .cse1 .cse18) (and (and .cse23 .cse4) .cse6) (and .cse8 .cse12 .cse1 .cse10) (and .cse0 .cse5 .cse12 .cse18 .cse14) (and .cse7 .cse8 .cse12 .cse6 .cse14) (and .cse13 .cse14 .cse21) (and .cse0 .cse22 .cse24)))))) [2018-12-30 23:39:08,486 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,486 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,486 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,486 INFO L448 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,486 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,486 INFO L448 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,486 INFO L448 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L448 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,487 INFO L451 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,488 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,489 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:39:08,490 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:39:08,491 INFO L444 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse2 (= ~a12~0 7)) (.cse4 (= ~a16~0 10))) (let ((.cse13 (<= ~a16~0 11)) (.cse33 (not .cse4)) (.cse11 (= ~a15~0 3)) (.cse30 (not .cse2))) (let ((.cse15 (= ~a12~0 6)) (.cse1 (= ~a16~0 9)) (.cse17 (and .cse13 .cse33 .cse11 .cse30)) (.cse24 (= 4 ULTIMATE.start_calculate_output_~input)) (.cse23 (= 3 ULTIMATE.start_calculate_output_~input)) (.cse20 (= 6 ULTIMATE.start_calculate_output_~input)) (.cse22 (= 5 ULTIMATE.start_calculate_output_~input)) (.cse31 (and .cse13 .cse33 .cse11)) (.cse3 (= ~a12~0 5)) (.cse14 (<= (+ ~a18~0 79) 0))) (let ((.cse26 (and .cse13 .cse33 .cse3 .cse14)) (.cse25 (or (and .cse31 .cse14) (and (<= (+ ~a18~0 87) 0) .cse11 .cse30))) (.cse19 (and .cse13 .cse33 .cse14)) (.cse21 (or (= 2 ULTIMATE.start_calculate_output_~input) .cse24 .cse23 .cse20 (= 1 ULTIMATE.start_calculate_output_~input) .cse22)) (.cse28 (and (not (= 8 ~a12~0)) .cse17)) (.cse8 (= ~a12~0 9)) (.cse5 (= ~a16~0 8)) (.cse16 (exists ((v_prenex_1 Int)) (let ((.cse34 (mod v_prenex_1 299922))) (and (< v_prenex_1 0) (not (= 0 .cse34)) (<= (+ .cse34 150) ~a18~0))))) (.cse12 (not .cse1)) (.cse7 (= ~a12~0 8)) (.cse10 (<= 11 ~a16~0)) (.cse6 (<= ~a18~0 134)) (.cse9 (< 0 (+ ~a18~0 156))) (.cse0 (= ~a15~0 4)) (.cse29 (and .cse13 .cse33 .cse15)) (.cse27 (<= (+ ~a18~0 391209) 0)) (.cse32 (< 134 ~a18~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 (<= 598710 ~a18~0) (not (= 2 ULTIMATE.start_calculate_output2_~input)) .cse4) (and .cse5 .cse0 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse8 .cse9) (and .cse10 .cse11 .cse6 .cse7) (and .cse11 .cse6 .cse3 .cse9) (and .cse0 (and .cse12 .cse3 (and .cse13 .cse14))) (and .cse11 (<= 594219 ~a18~0) .cse15) (and .cse0 .cse5 .cse2 .cse6) (and .cse16 .cse0 .cse5 .cse8) (and .cse16 .cse11 .cse3) (and .cse10 .cse11 .cse8) (and .cse5 .cse17) (and .cse11 .cse6 .cse12 .cse15) (and .cse0 .cse1 .cse6 .cse7 .cse9) (and (exists ((v_prenex_1 Int)) (let ((.cse18 (mod v_prenex_1 299922))) (and (<= .cse18 (+ ~a18~0 600001)) (< v_prenex_1 0) (not (= 0 .cse18))))) .cse1 .cse19 (not .cse20) .cse21 (not .cse22) (not .cse23) (not .cse24) .cse8 .cse0) (and .cse25 .cse2) (and .cse0 .cse9 .cse26) (and .cse12 (and .cse13 .cse11 .cse15)) (and .cse0 (and .cse26 .cse27)) (and .cse16 .cse28) (and .cse7 .cse25) (and .cse0 .cse1 .cse19 .cse21 .cse8 .cse9) (and .cse28 .cse8 .cse9) (and .cse0 (and .cse13 .cse12 .cse15)) (and .cse0 (and .cse6 .cse29) .cse9) (and .cse10 .cse11 .cse30 .cse14) (and .cse0 .cse3 .cse5) (and (and .cse31 .cse2) .cse32) (and .cse16 .cse13 .cse11 .cse12 .cse30 (not (= 9 ~a12~0))) (and .cse16 .cse11 .cse12 .cse7) (and .cse7 (and .cse17 .cse6)) (and .cse10 .cse11 .cse6 .cse2 .cse9) (and .cse0 .cse29 .cse27) (and (and .cse13 .cse11 .cse3) .cse32)))))) [2018-12-30 23:39:08,491 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,491 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,491 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,491 INFO L448 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,491 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:39:08,492 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,493 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:39:08,494 INFO L448 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,495 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,496 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,497 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,498 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,499 INFO L448 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,500 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,501 INFO L448 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,502 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,503 INFO L448 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,504 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,505 INFO L448 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,506 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:39:08,507 INFO L448 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,508 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,509 INFO L448 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:39:08,510 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,511 INFO L448 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,512 INFO L448 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,513 INFO L448 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2018-12-30 23:39:08,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,573 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,574 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,575 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,579 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,580 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,581 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:08,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:39:08 BoogieIcfgContainer [2018-12-30 23:39:08,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:39:08,589 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:39:08,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:39:08,589 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:39:08,590 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:34:59" (3/4) ... [2018-12-30 23:39:08,594 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:39:08,649 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-30 23:39:08,652 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:39:08,720 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((a15 == 4 && a16 == 9) && a12 == 7) || ((((a15 == 4 && a12 == 5) && 598710 <= a18) && !(2 == input)) && a16 == 10)) || (((a16 == 8 && a15 == 4) && a18 <= 134) && a12 == 8)) || ((((a15 == 4 && a16 == 8) && a18 <= 134) && a12 == 9) && 0 < a18 + 156)) || (((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 8)) || (((a15 == 3 && a18 <= 134) && a12 == 5) && 0 < a18 + 156)) || (a15 == 4 && (!(a16 == 9) && a12 == 5) && a16 <= 11 && a18 + 79 <= 0)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || (((a15 == 4 && a16 == 8) && a12 == 7) && a18 <= 134)) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 4) && a16 == 8) && a12 == 9)) || (((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && a12 == 5)) || ((11 <= a16 && a15 == 3) && a12 == 9)) || (a16 == 8 && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (((a15 == 3 && a18 <= 134) && !(a16 == 9)) && a12 == 6)) || ((((a15 == 4 && a16 == 9) && a18 <= 134) && a12 == 8) && 0 < a18 + 156)) || ((((((((((\exists v_prenex_1 : int :: (v_prenex_1 % 299922 <= a18 + 600001 && v_prenex_1 < 0) && !(0 == v_prenex_1 % 299922)) && a16 == 9) && (a16 <= 11 && !(a16 == 10)) && a18 + 79 <= 0) && !(6 == input)) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && !(5 == input)) && !(3 == input)) && !(4 == input)) && a12 == 9) && a15 == 4)) || (((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) || ((a18 + 87 <= 0 && a15 == 3) && !(a12 == 7))) && a12 == 7)) || ((a15 == 4 && 0 < a18 + 156) && ((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0)) || (!(a16 == 9) && (a16 <= 11 && a15 == 3) && a12 == 6)) || (a15 == 4 && (((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0) && a18 + 391209 <= 0)) || ((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && !(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (a12 == 8 && ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) || ((a18 + 87 <= 0 && a15 == 3) && !(a12 == 7))))) || (((((a15 == 4 && a16 == 9) && (a16 <= 11 && !(a16 == 10)) && a18 + 79 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a12 == 9) && 0 < a18 + 156)) || (((!(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a12 == 9) && 0 < a18 + 156)) || (a15 == 4 && (a16 <= 11 && !(a16 == 9)) && a12 == 6)) || ((a15 == 4 && a18 <= 134 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && 0 < a18 + 156)) || (((11 <= a16 && a15 == 3) && !(a12 == 7)) && a18 + 79 <= 0)) || ((a15 == 4 && a12 == 5) && a16 == 8)) || ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a12 == 7) && 134 < a18)) || ((((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a16 <= 11) && a15 == 3) && !(a16 == 9)) && !(a12 == 7)) && !(9 == a12))) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && !(a16 == 9)) && a12 == 8)) || (a12 == 8 && (((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a18 <= 134)) || ((((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 7) && 0 < a18 + 156)) || ((a15 == 4 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && a18 + 391209 <= 0)) || (((a16 <= 11 && a15 == 3) && a12 == 5) && 134 < a18) [2018-12-30 23:39:08,729 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((a15 == 4 && a16 == 9) && a12 == 7) || ((((a15 == 4 && a12 == 5) && 598710 <= a18) && !(2 == input)) && a16 == 10)) || (((a16 == 8 && a15 == 4) && a18 <= 134) && a12 == 8)) || ((((a15 == 4 && a16 == 8) && a18 <= 134) && a12 == 9) && 0 < a18 + 156)) || (((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 8)) || (((a15 == 3 && a18 <= 134) && a12 == 5) && 0 < a18 + 156)) || (a15 == 4 && (!(a16 == 9) && a12 == 5) && a16 <= 11 && a18 + 79 <= 0)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || (((a15 == 4 && a16 == 8) && a12 == 7) && a18 <= 134)) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 4) && a16 == 8) && a12 == 9)) || (((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && a12 == 5)) || ((11 <= a16 && a15 == 3) && a12 == 9)) || (a16 == 8 && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (((a15 == 3 && a18 <= 134) && !(a16 == 9)) && a12 == 6)) || ((((a15 == 4 && a16 == 9) && a18 <= 134) && a12 == 8) && 0 < a18 + 156)) || ((((((((((\exists v_prenex_1 : int :: (v_prenex_1 % 299922 <= a18 + 600001 && v_prenex_1 < 0) && !(0 == v_prenex_1 % 299922)) && a16 == 9) && (a16 <= 11 && !(a16 == 10)) && a18 + 79 <= 0) && !(6 == input)) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && !(5 == input)) && !(3 == input)) && !(4 == input)) && a12 == 9) && a15 == 4)) || (((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) || ((a18 + 87 <= 0 && a15 == 3) && !(a12 == 7))) && a12 == 7)) || ((a15 == 4 && 0 < a18 + 156) && ((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0)) || (!(a16 == 9) && (a16 <= 11 && a15 == 3) && a12 == 6)) || (a15 == 4 && (((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0) && a18 + 391209 <= 0)) || ((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && !(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (a12 == 8 && ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) || ((a18 + 87 <= 0 && a15 == 3) && !(a12 == 7))))) || (((((a15 == 4 && a16 == 9) && (a16 <= 11 && !(a16 == 10)) && a18 + 79 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a12 == 9) && 0 < a18 + 156)) || (((!(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a12 == 9) && 0 < a18 + 156)) || (a15 == 4 && (a16 <= 11 && !(a16 == 9)) && a12 == 6)) || ((a15 == 4 && a18 <= 134 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && 0 < a18 + 156)) || (((11 <= a16 && a15 == 3) && !(a12 == 7)) && a18 + 79 <= 0)) || ((a15 == 4 && a12 == 5) && a16 == 8)) || ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a12 == 7) && 134 < a18)) || ((((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a16 <= 11) && a15 == 3) && !(a16 == 9)) && !(a12 == 7)) && !(9 == a12))) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && !(a16 == 9)) && a12 == 8)) || (a12 == 8 && (((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a18 <= 134)) || ((((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 7) && 0 < a18 + 156)) || ((a15 == 4 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && a18 + 391209 <= 0)) || (((a16 <= 11 && a15 == 3) && a12 == 5) && 134 < a18) [2018-12-30 23:39:08,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((a15 == 4 && (!(a16 == 9) && a12 == 5) && a16 <= 11 && a18 + 79 <= 0) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((11 <= a16 && a15 == 3) && !(a12 == 7)) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && !(a16 == 9)) && a12 == 6)) || (!(a16 == 9) && (a16 <= 11 && a15 == 3) && a12 == 6)) || ((((a16 == 8 && a15 == 4) && a18 <= 134) && a12 == 9) && 0 < a18 + 156)) || (((a16 == 8 && a15 == 4) && a12 == 7) && a18 <= 134)) || ((((a15 == 4 && a12 == 5) && 598710 <= a18) && !(2 == input)) && a16 == 10)) || (((a15 == 4 && (!(3 == input) || a18 <= 134)) && a12 == 5) && a16 == 8)) || ((a15 == 4 && ((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((11 <= a16 && a15 == 3) && a12 == 9)) || (((a16 == 8 && a15 == 4) && a18 <= 134) && a12 == 8)) || (((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a18 <= 134) && a12 == 8)) || (((((a15 == 4 && a16 == 9) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a18 + 79 <= 0) && a12 == 9) && 0 < a18 + 156)) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a16 == 8) && a15 == 4) && a12 == 9)) || ((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && !(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || ((a18 + 87 <= 0 && a15 == 3) && a12 == 8)) || (((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 8)) || (((a15 == 3 && a18 <= 134) && a12 == 5) && 0 < a18 + 156)) || ((a15 == 4 && a18 <= 134 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && 0 < a18 + 156)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a12 == 7) && 134 < a18)) || ((((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a16 <= 11) && a15 == 3) && !(a16 == 9)) && !(a12 == 7)) && !(9 == a12))) || (((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && a12 == 5)) || (a16 == 8 && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (((a16 <= 11 && a15 == 3) && a12 == 5) && 0 < a18 + 156)) || ((a15 == 4 && ((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0) && a18 + 391209 <= 0)) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && !(a16 == 9)) && a12 == 8)) || ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) && a12 == 7)) || (((a15 == 3 && a18 <= 134) && !(a16 == 9)) && a12 == 6)) || ((((a15 == 4 && a16 == 9) && a18 <= 134) && a12 == 8) && 0 < a18 + 156)) || ((((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 7) && 0 < a18 + 156)) || ((a12 == 9 && 0 < a18 + 156) && !(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || ((a15 == 4 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && a18 + 391209 <= 0) [2018-12-30 23:39:08,989 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:39:08,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:39:08,990 INFO L168 Benchmark]: Toolchain (without parser) took 257937.89 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 941.8 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-30 23:39:08,992 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:39:08,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1263.07 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 872.0 MB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:08,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 361.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 872.0 MB in the beginning and 1.1 GB in the end (delta: -238.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:08,995 INFO L168 Benchmark]: Boogie Preprocessor took 138.99 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: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:08,996 INFO L168 Benchmark]: RCFGBuilder took 6193.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 843.7 MB in the end (delta: 254.6 MB). Peak memory consumption was 254.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:09,000 INFO L168 Benchmark]: TraceAbstraction took 249574.25 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 843.7 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-12-30 23:39:09,000 INFO L168 Benchmark]: Witness Printer took 400.46 ms. Allocated memory is still 5.0 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 80.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. [2018-12-30 23:39:09,006 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1263.07 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 872.0 MB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 361.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 872.0 MB in the beginning and 1.1 GB in the end (delta: -238.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.99 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: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6193.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 843.7 MB in the end (delta: 254.6 MB). Peak memory consumption was 254.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 249574.25 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 843.7 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 400.46 ms. Allocated memory is still 5.0 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 80.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: 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: 23]: Loop Invariant [2018-12-30 23:39:09,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,054 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,055 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a15 == 4 && a16 == 9) && a12 == 7) || ((((a15 == 4 && a12 == 5) && 598710 <= a18) && !(2 == input)) && a16 == 10)) || (((a16 == 8 && a15 == 4) && a18 <= 134) && a12 == 8)) || ((((a15 == 4 && a16 == 8) && a18 <= 134) && a12 == 9) && 0 < a18 + 156)) || (((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 8)) || (((a15 == 3 && a18 <= 134) && a12 == 5) && 0 < a18 + 156)) || (a15 == 4 && (!(a16 == 9) && a12 == 5) && a16 <= 11 && a18 + 79 <= 0)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || (((a15 == 4 && a16 == 8) && a12 == 7) && a18 <= 134)) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 4) && a16 == 8) && a12 == 9)) || (((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && a12 == 5)) || ((11 <= a16 && a15 == 3) && a12 == 9)) || (a16 == 8 && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (((a15 == 3 && a18 <= 134) && !(a16 == 9)) && a12 == 6)) || ((((a15 == 4 && a16 == 9) && a18 <= 134) && a12 == 8) && 0 < a18 + 156)) || ((((((((((\exists v_prenex_1 : int :: (v_prenex_1 % 299922 <= a18 + 600001 && v_prenex_1 < 0) && !(0 == v_prenex_1 % 299922)) && a16 == 9) && (a16 <= 11 && !(a16 == 10)) && a18 + 79 <= 0) && !(6 == input)) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && !(5 == input)) && !(3 == input)) && !(4 == input)) && a12 == 9) && a15 == 4)) || (((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) || ((a18 + 87 <= 0 && a15 == 3) && !(a12 == 7))) && a12 == 7)) || ((a15 == 4 && 0 < a18 + 156) && ((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0)) || (!(a16 == 9) && (a16 <= 11 && a15 == 3) && a12 == 6)) || (a15 == 4 && (((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0) && a18 + 391209 <= 0)) || ((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && !(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (a12 == 8 && ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) || ((a18 + 87 <= 0 && a15 == 3) && !(a12 == 7))))) || (((((a15 == 4 && a16 == 9) && (a16 <= 11 && !(a16 == 10)) && a18 + 79 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a12 == 9) && 0 < a18 + 156)) || (((!(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a12 == 9) && 0 < a18 + 156)) || (a15 == 4 && (a16 <= 11 && !(a16 == 9)) && a12 == 6)) || ((a15 == 4 && a18 <= 134 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && 0 < a18 + 156)) || (((11 <= a16 && a15 == 3) && !(a12 == 7)) && a18 + 79 <= 0)) || ((a15 == 4 && a12 == 5) && a16 == 8)) || ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a12 == 7) && 134 < a18)) || ((((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a16 <= 11) && a15 == 3) && !(a16 == 9)) && !(a12 == 7)) && !(9 == a12))) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && !(a16 == 9)) && a12 == 8)) || (a12 == 8 && (((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a18 <= 134)) || ((((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 7) && 0 < a18 + 156)) || ((a15 == 4 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && a18 + 391209 <= 0)) || (((a16 <= 11 && a15 == 3) && a12 == 5) && 134 < a18) - InvariantResult [Line: 1494]: Loop Invariant [2018-12-30 23:39:09,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,061 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,065 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,067 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,068 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((a15 == 4 && (!(a16 == 9) && a12 == 5) && a16 <= 11 && a18 + 79 <= 0) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((11 <= a16 && a15 == 3) && !(a12 == 7)) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && !(a16 == 9)) && a12 == 6)) || (!(a16 == 9) && (a16 <= 11 && a15 == 3) && a12 == 6)) || ((((a16 == 8 && a15 == 4) && a18 <= 134) && a12 == 9) && 0 < a18 + 156)) || (((a16 == 8 && a15 == 4) && a12 == 7) && a18 <= 134)) || ((((a15 == 4 && a12 == 5) && 598710 <= a18) && !(2 == input)) && a16 == 10)) || (((a15 == 4 && (!(3 == input) || a18 <= 134)) && a12 == 5) && a16 == 8)) || ((a15 == 4 && ((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0) && 0 < a18 + 156)) || ((11 <= a16 && a15 == 3) && a12 == 9)) || (((a16 == 8 && a15 == 4) && a18 <= 134) && a12 == 8)) || (((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a18 <= 134) && a12 == 8)) || (((((a15 == 4 && a16 == 9) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a18 + 79 <= 0) && a12 == 9) && 0 < a18 + 156)) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a16 == 8) && a15 == 4) && a12 == 9)) || ((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && !(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || ((a18 + 87 <= 0 && a15 == 3) && a12 == 8)) || (((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 8)) || (((a15 == 3 && a18 <= 134) && a12 == 5) && 0 < a18 + 156)) || ((a15 == 4 && a18 <= 134 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && 0 < a18 + 156)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a12 == 7) && 134 < a18)) || ((((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a16 <= 11) && a15 == 3) && !(a16 == 9)) && !(a12 == 7)) && !(9 == a12))) || (((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && a12 == 5)) || (a16 == 8 && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (((a16 <= 11 && a15 == 3) && a12 == 5) && 0 < a18 + 156)) || ((a15 == 4 && ((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0) && a18 + 391209 <= 0)) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && !(a16 == 9)) && a12 == 8)) || ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) && a12 == 7)) || (((a15 == 3 && a18 <= 134) && !(a16 == 9)) && a12 == 6)) || ((((a15 == 4 && a16 == 9) && a18 <= 134) && a12 == 8) && 0 < a18 + 156)) || ((((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 7) && 0 < a18 + 156)) || ((a12 == 9 && 0 < a18 + 156) && !(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || ((a15 == 4 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && a18 + 391209 <= 0) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2018-12-30 23:39:09,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,078 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,081 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,081 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,081 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,082 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,082 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,082 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,083 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,087 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,093 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,093 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,094 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,095 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,096 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:39:09,097 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a15 == 4 && a16 == 9) && a12 == 7) || ((((a15 == 4 && a12 == 5) && 598710 <= a18) && !(2 == input)) && a16 == 10)) || (((a16 == 8 && a15 == 4) && a18 <= 134) && a12 == 8)) || ((((a15 == 4 && a16 == 8) && a18 <= 134) && a12 == 9) && 0 < a18 + 156)) || (((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 8)) || (((a15 == 3 && a18 <= 134) && a12 == 5) && 0 < a18 + 156)) || (a15 == 4 && (!(a16 == 9) && a12 == 5) && a16 <= 11 && a18 + 79 <= 0)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || (((a15 == 4 && a16 == 8) && a12 == 7) && a18 <= 134)) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 4) && a16 == 8) && a12 == 9)) || (((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && a12 == 5)) || ((11 <= a16 && a15 == 3) && a12 == 9)) || (a16 == 8 && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (((a15 == 3 && a18 <= 134) && !(a16 == 9)) && a12 == 6)) || ((((a15 == 4 && a16 == 9) && a18 <= 134) && a12 == 8) && 0 < a18 + 156)) || ((((((((((\exists v_prenex_1 : int :: (v_prenex_1 % 299922 <= a18 + 600001 && v_prenex_1 < 0) && !(0 == v_prenex_1 % 299922)) && a16 == 9) && (a16 <= 11 && !(a16 == 10)) && a18 + 79 <= 0) && !(6 == input)) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && !(5 == input)) && !(3 == input)) && !(4 == input)) && a12 == 9) && a15 == 4)) || (((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) || ((a18 + 87 <= 0 && a15 == 3) && !(a12 == 7))) && a12 == 7)) || ((a15 == 4 && 0 < a18 + 156) && ((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0)) || (!(a16 == 9) && (a16 <= 11 && a15 == 3) && a12 == 6)) || (a15 == 4 && (((a16 <= 11 && !(a16 == 10)) && a12 == 5) && a18 + 79 <= 0) && a18 + 391209 <= 0)) || ((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && !(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7))) || (a12 == 8 && ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a18 + 79 <= 0) || ((a18 + 87 <= 0 && a15 == 3) && !(a12 == 7))))) || (((((a15 == 4 && a16 == 9) && (a16 <= 11 && !(a16 == 10)) && a18 + 79 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a12 == 9) && 0 < a18 + 156)) || (((!(8 == a12) && ((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a12 == 9) && 0 < a18 + 156)) || (a15 == 4 && (a16 <= 11 && !(a16 == 9)) && a12 == 6)) || ((a15 == 4 && a18 <= 134 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && 0 < a18 + 156)) || (((11 <= a16 && a15 == 3) && !(a12 == 7)) && a18 + 79 <= 0)) || ((a15 == 4 && a12 == 5) && a16 == 8)) || ((((a16 <= 11 && !(a16 == 10)) && a15 == 3) && a12 == 7) && 134 < a18)) || ((((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a16 <= 11) && a15 == 3) && !(a16 == 9)) && !(a12 == 7)) && !(9 == a12))) || ((((\exists v_prenex_1 : int :: (v_prenex_1 < 0 && !(0 == v_prenex_1 % 299922)) && v_prenex_1 % 299922 + 150 <= a18) && a15 == 3) && !(a16 == 9)) && a12 == 8)) || (a12 == 8 && (((a16 <= 11 && !(a16 == 10)) && a15 == 3) && !(a12 == 7)) && a18 <= 134)) || ((((11 <= a16 && a15 == 3) && a18 <= 134) && a12 == 7) && 0 < a18 + 156)) || ((a15 == 4 && (a16 <= 11 && !(a16 == 10)) && a12 == 6) && a18 + 391209 <= 0)) || (((a16 <= 11 && a15 == 3) && a12 == 5) && 134 < a18) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. SAFE Result, 249.4s OverallTime, 18 OverallIterations, 14 TraceHistogramMax, 106.7s AutomataDifference, 0.0s DeadEndRemovalTime, 41.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2807 SDtfs, 21572 SDslu, 825 SDs, 0 SdLazy, 79441 SolverSat, 4497 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 84.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16992 GetRequests, 16835 SyntacticMatches, 26 SemanticMatches, 131 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23449occurred in iteration=16, 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: 2.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 26067 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 254 NumberOfFragments, 2280 HoareAnnotationTreeSize, 4 FomulaSimplifications, 31872 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 157655 FormulaSimplificationTreeSizeReductionInter, 38.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 50.7s InterpolantComputationTime, 38866 NumberOfCodeBlocks, 38866 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 38840 ConstructedInterpolants, 434 QuantifiedInterpolants, 324144269 SizeOfPredicates, 11 NumberOfNonLiveVariables, 19230 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 138292/146364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...