./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15c406f4c881927013bc1c3740a0ccf2226e847a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:27:22,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:27:22,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:27:22,411 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:27:22,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:27:22,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:27:22,414 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:27:22,416 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:27:22,418 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:27:22,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:27:22,420 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:27:22,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:27:22,422 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:27:22,423 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:27:22,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:27:22,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:27:22,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:27:22,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:27:22,431 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:27:22,433 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:27:22,434 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:27:22,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:27:22,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:27:22,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:27:22,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:27:22,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:27:22,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:27:22,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:27:22,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:27:22,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:27:22,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:27:22,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:27:22,446 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:27:22,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:27:22,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:27:22,449 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:27:22,449 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:27:22,465 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:27:22,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:27:22,467 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:27:22,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:27:22,468 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:27:22,468 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:27:22,468 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:27:22,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:27:22,468 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:27:22,469 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:27:22,469 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:27:22,469 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:27:22,469 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:27:22,469 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:27:22,470 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:27:22,471 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:27:22,471 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:27:22,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:27:22,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:27:22,472 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:27:22,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:27:22,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:27:22,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:27:22,473 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:27:22,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:27:22,473 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:27:22,474 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:27:22,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:27:22,475 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 -> 15c406f4c881927013bc1c3740a0ccf2226e847a [2019-01-12 04:27:22,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:27:22,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:27:22,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:27:22,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:27:22,532 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:27:22,533 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c [2019-01-12 04:27:22,587 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788df8060/c9989dc3fdc14438ab30c1f0626a0385/FLAGb7bc3cff9 [2019-01-12 04:27:23,156 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:27:23,157 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label46_true-unreach-call_false-termination.c [2019-01-12 04:27:23,175 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788df8060/c9989dc3fdc14438ab30c1f0626a0385/FLAGb7bc3cff9 [2019-01-12 04:27:23,396 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788df8060/c9989dc3fdc14438ab30c1f0626a0385 [2019-01-12 04:27:23,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:27:23,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:27:23,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:27:23,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:27:23,408 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:27:23,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:27:23" (1/1) ... [2019-01-12 04:27:23,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630dbd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:23, skipping insertion in model container [2019-01-12 04:27:23,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:27:23" (1/1) ... [2019-01-12 04:27:23,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:27:23,489 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:27:23,941 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:27:23,952 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:27:24,195 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:27:24,221 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:27:24,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24 WrapperNode [2019-01-12 04:27:24,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:27:24,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:27:24,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:27:24,226 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:27:24,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... [2019-01-12 04:27:24,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... [2019-01-12 04:27:24,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:27:24,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:27:24,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:27:24,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:27:24,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... [2019-01-12 04:27:24,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... [2019-01-12 04:27:24,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... [2019-01-12 04:27:24,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... [2019-01-12 04:27:24,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... [2019-01-12 04:27:24,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... [2019-01-12 04:27:24,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... [2019-01-12 04:27:24,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:27:24,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:27:24,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:27:24,584 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:27:24,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:27:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:27:24,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:27:27,979 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:27:27,979 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 04:27:27,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:27:27 BoogieIcfgContainer [2019-01-12 04:27:27,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:27:27,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:27:27,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:27:27,986 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:27:27,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:27:23" (1/3) ... [2019-01-12 04:27:27,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c57d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:27:27, skipping insertion in model container [2019-01-12 04:27:27,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:24" (2/3) ... [2019-01-12 04:27:27,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c57d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:27:27, skipping insertion in model container [2019-01-12 04:27:27,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:27:27" (3/3) ... [2019-01-12 04:27:27,991 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label46_true-unreach-call_false-termination.c [2019-01-12 04:27:28,002 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:27:28,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:27:28,031 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:27:28,065 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:27:28,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:27:28,066 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:27:28,066 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:27:28,066 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:27:28,066 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:27:28,066 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:27:28,067 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:27:28,067 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:27:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-01-12 04:27:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 04:27:28,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:28,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:27:28,104 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:28,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2019-01-12 04:27:28,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:28,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:28,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:28,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:28,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:28,497 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 04:27:28,643 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 04:27:28,857 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2019-01-12 04:27:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:27:28,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:27:28,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:27:28,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:27:28,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:27:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:27:28,909 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2019-01-12 04:27:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:32,094 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2019-01-12 04:27:32,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:27:32,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-01-12 04:27:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:32,118 INFO L225 Difference]: With dead ends: 852 [2019-01-12 04:27:32,119 INFO L226 Difference]: Without dead ends: 538 [2019-01-12 04:27:32,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:27:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-12 04:27:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-01-12 04:27:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-01-12 04:27:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2019-01-12 04:27:32,273 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 39 [2019-01-12 04:27:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:32,275 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2019-01-12 04:27:32,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:27:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2019-01-12 04:27:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-12 04:27:32,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:32,289 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:27:32,290 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:32,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1976295897, now seen corresponding path program 1 times [2019-01-12 04:27:32,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:32,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:32,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:32,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-01-12 04:27:32,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:27:32,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:27:32,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:27:32,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:27:32,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:32,569 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2019-01-12 04:27:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:34,492 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2019-01-12 04:27:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:27:34,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-01-12 04:27:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:34,500 INFO L225 Difference]: With dead ends: 1252 [2019-01-12 04:27:34,500 INFO L226 Difference]: Without dead ends: 894 [2019-01-12 04:27:34,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-01-12 04:27:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2019-01-12 04:27:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-01-12 04:27:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2019-01-12 04:27:34,538 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 187 [2019-01-12 04:27:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:34,539 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2019-01-12 04:27:34,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:27:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2019-01-12 04:27:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-12 04:27:34,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:34,546 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:27:34,546 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:34,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:34,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1989656586, now seen corresponding path program 1 times [2019-01-12 04:27:34,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:34,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:34,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:34,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:34,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 140 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 04:27:34,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:27:34,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:27:34,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:35,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:27:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-12 04:27:35,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:27:35,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 04:27:35,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:27:35,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:27:35,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:27:35,175 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 6 states. [2019-01-12 04:27:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:40,357 INFO L93 Difference]: Finished difference Result 3446 states and 4804 transitions. [2019-01-12 04:27:40,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:27:40,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-01-12 04:27:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:40,374 INFO L225 Difference]: With dead ends: 3446 [2019-01-12 04:27:40,374 INFO L226 Difference]: Without dead ends: 2674 [2019-01-12 04:27:40,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:27:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-01-12 04:27:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1962. [2019-01-12 04:27:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-01-12 04:27:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2132 transitions. [2019-01-12 04:27:40,442 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2132 transitions. Word has length 210 [2019-01-12 04:27:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:40,444 INFO L480 AbstractCegarLoop]: Abstraction has 1962 states and 2132 transitions. [2019-01-12 04:27:40,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:27:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2132 transitions. [2019-01-12 04:27:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-01-12 04:27:40,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:40,475 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 04:27:40,476 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash -35270676, now seen corresponding path program 1 times [2019-01-12 04:27:40,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:40,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:40,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:40,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:40,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-01-12 04:27:41,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:27:41,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:27:41,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:27:41,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:27:41,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:41,309 INFO L87 Difference]: Start difference. First operand 1962 states and 2132 transitions. Second operand 4 states. [2019-01-12 04:27:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:43,116 INFO L93 Difference]: Finished difference Result 5346 states and 5936 transitions. [2019-01-12 04:27:43,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:27:43,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 507 [2019-01-12 04:27:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:43,140 INFO L225 Difference]: With dead ends: 5346 [2019-01-12 04:27:43,140 INFO L226 Difference]: Without dead ends: 3564 [2019-01-12 04:27:43,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-01-12 04:27:43,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2852. [2019-01-12 04:27:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-01-12 04:27:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3124 transitions. [2019-01-12 04:27:43,207 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3124 transitions. Word has length 507 [2019-01-12 04:27:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:43,208 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3124 transitions. [2019-01-12 04:27:43,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:27:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3124 transitions. [2019-01-12 04:27:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-01-12 04:27:43,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:43,222 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 04:27:43,223 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:43,223 INFO L82 PathProgramCache]: Analyzing trace with hash 482320211, now seen corresponding path program 1 times [2019-01-12 04:27:43,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:43,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:43,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-01-12 04:27:43,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:27:43,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:27:43,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:27:43,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:27:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:43,712 INFO L87 Difference]: Start difference. First operand 2852 states and 3124 transitions. Second operand 4 states. [2019-01-12 04:27:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:44,973 INFO L93 Difference]: Finished difference Result 6414 states and 7097 transitions. [2019-01-12 04:27:44,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:27:44,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-01-12 04:27:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:44,992 INFO L225 Difference]: With dead ends: 6414 [2019-01-12 04:27:44,992 INFO L226 Difference]: Without dead ends: 3742 [2019-01-12 04:27:44,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-01-12 04:27:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2019-01-12 04:27:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-01-12 04:27:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3876 transitions. [2019-01-12 04:27:45,073 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3876 transitions. Word has length 526 [2019-01-12 04:27:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:45,074 INFO L480 AbstractCegarLoop]: Abstraction has 3564 states and 3876 transitions. [2019-01-12 04:27:45,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:27:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3876 transitions. [2019-01-12 04:27:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-01-12 04:27:45,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:45,089 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:27:45,089 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2009542813, now seen corresponding path program 1 times [2019-01-12 04:27:45,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:45,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:45,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:46,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 770 proven. 130 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-01-12 04:27:46,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:27:46,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:27:46,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:46,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:27:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 746 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-01-12 04:27:46,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:27:46,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-12 04:27:46,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 04:27:46,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 04:27:46,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:27:46,779 INFO L87 Difference]: Start difference. First operand 3564 states and 3876 transitions. Second operand 14 states. [2019-01-12 04:27:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:50,114 INFO L93 Difference]: Finished difference Result 7185 states and 7818 transitions. [2019-01-12 04:27:50,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 04:27:50,115 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 528 [2019-01-12 04:27:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:50,132 INFO L225 Difference]: With dead ends: 7185 [2019-01-12 04:27:50,132 INFO L226 Difference]: Without dead ends: 3570 [2019-01-12 04:27:50,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 524 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-01-12 04:27:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2019-01-12 04:27:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 2852. [2019-01-12 04:27:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-01-12 04:27:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3044 transitions. [2019-01-12 04:27:50,193 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3044 transitions. Word has length 528 [2019-01-12 04:27:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:50,194 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3044 transitions. [2019-01-12 04:27:50,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 04:27:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3044 transitions. [2019-01-12 04:27:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2019-01-12 04:27:50,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:50,219 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, 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, 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, 3, 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] [2019-01-12 04:27:50,219 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:50,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1584602280, now seen corresponding path program 1 times [2019-01-12 04:27:50,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:50,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:50,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:50,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:50,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 1172 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-01-12 04:27:51,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:27:51,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:27:51,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:27:51,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:27:51,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:27:51,053 INFO L87 Difference]: Start difference. First operand 2852 states and 3044 transitions. Second operand 3 states. [2019-01-12 04:27:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:52,180 INFO L93 Difference]: Finished difference Result 6770 states and 7217 transitions. [2019-01-12 04:27:52,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:27:52,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 714 [2019-01-12 04:27:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:52,197 INFO L225 Difference]: With dead ends: 6770 [2019-01-12 04:27:52,197 INFO L226 Difference]: Without dead ends: 4098 [2019-01-12 04:27:52,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:27:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-01-12 04:27:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3386. [2019-01-12 04:27:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-01-12 04:27:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3600 transitions. [2019-01-12 04:27:52,261 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3600 transitions. Word has length 714 [2019-01-12 04:27:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:52,261 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3600 transitions. [2019-01-12 04:27:52,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:27:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3600 transitions. [2019-01-12 04:27:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2019-01-12 04:27:52,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:52,270 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 3, 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] [2019-01-12 04:27:52,271 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:52,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1269972873, now seen corresponding path program 1 times [2019-01-12 04:27:52,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:52,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:52,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2103 backedges. 1427 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-01-12 04:27:52,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:27:52,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:27:52,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:27:52,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:27:52,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:27:52,832 INFO L87 Difference]: Start difference. First operand 3386 states and 3600 transitions. Second operand 3 states. [2019-01-12 04:27:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:53,460 INFO L93 Difference]: Finished difference Result 7660 states and 8139 transitions. [2019-01-12 04:27:53,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:27:53,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 786 [2019-01-12 04:27:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:53,477 INFO L225 Difference]: With dead ends: 7660 [2019-01-12 04:27:53,478 INFO L226 Difference]: Without dead ends: 4454 [2019-01-12 04:27:53,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:27:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-01-12 04:27:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2019-01-12 04:27:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-01-12 04:27:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4699 transitions. [2019-01-12 04:27:53,555 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4699 transitions. Word has length 786 [2019-01-12 04:27:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:53,556 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4699 transitions. [2019-01-12 04:27:53,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:27:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4699 transitions. [2019-01-12 04:27:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2019-01-12 04:27:53,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:53,567 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:27:53,567 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash -928636369, now seen corresponding path program 1 times [2019-01-12 04:27:53,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:53,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:53,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:53,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1135 proven. 4 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2019-01-12 04:27:54,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:27:54,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:27:54,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:54,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:27:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1116 proven. 23 refuted. 0 times theorem prover too weak. 1073 trivial. 0 not checked. [2019-01-12 04:27:55,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:27:55,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-01-12 04:27:55,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:27:55,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:27:55,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:27:55,793 INFO L87 Difference]: Start difference. First operand 4454 states and 4699 transitions. Second operand 8 states. [2019-01-12 04:27:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:58,001 INFO L93 Difference]: Finished difference Result 10052 states and 10571 transitions. [2019-01-12 04:27:58,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:27:58,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 870 [2019-01-12 04:27:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:58,027 INFO L225 Difference]: With dead ends: 10052 [2019-01-12 04:27:58,027 INFO L226 Difference]: Without dead ends: 5778 [2019-01-12 04:27:58,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 868 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:27:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2019-01-12 04:27:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 4454. [2019-01-12 04:27:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-01-12 04:27:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4698 transitions. [2019-01-12 04:27:58,128 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4698 transitions. Word has length 870 [2019-01-12 04:27:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:58,128 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4698 transitions. [2019-01-12 04:27:58,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:27:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4698 transitions. [2019-01-12 04:27:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 960 [2019-01-12 04:27:58,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:58,143 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, 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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:27:58,143 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:58,145 INFO L82 PathProgramCache]: Analyzing trace with hash -754416928, now seen corresponding path program 1 times [2019-01-12 04:27:58,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:58,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:58,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:58,881 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-12 04:28:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1955 proven. 199 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-01-12 04:28:00,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:00,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:28:00,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:00,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2884 backedges. 1862 proven. 93 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2019-01-12 04:28:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:28:01,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-01-12 04:28:01,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:28:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:28:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:01,981 INFO L87 Difference]: Start difference. First operand 4454 states and 4698 transitions. Second operand 8 states. [2019-01-12 04:28:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:04,097 INFO L93 Difference]: Finished difference Result 10586 states and 11131 transitions. [2019-01-12 04:28:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:28:04,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 959 [2019-01-12 04:28:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:04,113 INFO L225 Difference]: With dead ends: 10586 [2019-01-12 04:28:04,113 INFO L226 Difference]: Without dead ends: 6312 [2019-01-12 04:28:04,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:28:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6312 states. [2019-01-12 04:28:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6312 to 4810. [2019-01-12 04:28:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-01-12 04:28:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5048 transitions. [2019-01-12 04:28:04,206 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5048 transitions. Word has length 959 [2019-01-12 04:28:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:04,207 INFO L480 AbstractCegarLoop]: Abstraction has 4810 states and 5048 transitions. [2019-01-12 04:28:04,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:28:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5048 transitions. [2019-01-12 04:28:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2019-01-12 04:28:04,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:04,221 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:04,222 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:04,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1310024199, now seen corresponding path program 1 times [2019-01-12 04:28:04,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:04,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:04,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:04,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:04,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 2189 proven. 0 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2019-01-12 04:28:05,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:05,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:28:05,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:28:05,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:28:05,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:28:05,146 INFO L87 Difference]: Start difference. First operand 4810 states and 5048 transitions. Second operand 5 states. [2019-01-12 04:28:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:06,784 INFO L93 Difference]: Finished difference Result 10864 states and 11381 transitions. [2019-01-12 04:28:06,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:28:06,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1036 [2019-01-12 04:28:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:06,800 INFO L225 Difference]: With dead ends: 10864 [2019-01-12 04:28:06,800 INFO L226 Difference]: Without dead ends: 6234 [2019-01-12 04:28:06,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:28:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2019-01-12 04:28:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5166. [2019-01-12 04:28:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-01-12 04:28:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5410 transitions. [2019-01-12 04:28:06,891 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5410 transitions. Word has length 1036 [2019-01-12 04:28:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:06,892 INFO L480 AbstractCegarLoop]: Abstraction has 5166 states and 5410 transitions. [2019-01-12 04:28:06,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:28:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5410 transitions. [2019-01-12 04:28:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1498 [2019-01-12 04:28:06,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:06,917 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:06,917 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash 674872807, now seen corresponding path program 1 times [2019-01-12 04:28:06,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7083 backedges. 4611 proven. 363 refuted. 0 times theorem prover too weak. 2109 trivial. 0 not checked. [2019-01-12 04:28:10,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:10,463 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 [2019-01-12 04:28:10,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:10,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7083 backedges. 4482 proven. 252 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2019-01-12 04:28:12,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:28:12,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2019-01-12 04:28:12,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 04:28:12,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 04:28:12,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:28:12,949 INFO L87 Difference]: Start difference. First operand 5166 states and 5410 transitions. Second operand 12 states. [2019-01-12 04:28:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:15,858 INFO L93 Difference]: Finished difference Result 10580 states and 11075 transitions. [2019-01-12 04:28:15,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 04:28:15,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1497 [2019-01-12 04:28:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:15,869 INFO L225 Difference]: With dead ends: 10580 [2019-01-12 04:28:15,869 INFO L226 Difference]: Without dead ends: 5594 [2019-01-12 04:28:15,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1513 GetRequests, 1496 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-01-12 04:28:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2019-01-12 04:28:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 5344. [2019-01-12 04:28:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-01-12 04:28:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5533 transitions. [2019-01-12 04:28:15,973 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5533 transitions. Word has length 1497 [2019-01-12 04:28:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:15,974 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5533 transitions. [2019-01-12 04:28:15,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 04:28:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5533 transitions. [2019-01-12 04:28:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1730 [2019-01-12 04:28:16,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:16,003 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 14, 14, 14, 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, 11, 11, 11, 11, 10, 9, 9, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:16,004 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:16,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:16,004 INFO L82 PathProgramCache]: Analyzing trace with hash 19375012, now seen corresponding path program 1 times [2019-01-12 04:28:16,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:16,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:16,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:16,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:16,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:17,507 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:28:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9775 backedges. 6624 proven. 30 refuted. 0 times theorem prover too weak. 3121 trivial. 0 not checked. [2019-01-12 04:28:19,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:19,229 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 [2019-01-12 04:28:19,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:19,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9775 backedges. 2962 proven. 0 refuted. 0 times theorem prover too weak. 6813 trivial. 0 not checked. [2019-01-12 04:28:22,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:22,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 04:28:22,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:28:22,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:28:22,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:22,130 INFO L87 Difference]: Start difference. First operand 5344 states and 5533 transitions. Second operand 7 states. [2019-01-12 04:28:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:24,835 INFO L93 Difference]: Finished difference Result 11398 states and 11792 transitions. [2019-01-12 04:28:24,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:28:24,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1729 [2019-01-12 04:28:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:24,847 INFO L225 Difference]: With dead ends: 11398 [2019-01-12 04:28:24,847 INFO L226 Difference]: Without dead ends: 6234 [2019-01-12 04:28:24,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1746 GetRequests, 1733 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:28:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2019-01-12 04:28:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5344. [2019-01-12 04:28:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-01-12 04:28:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5527 transitions. [2019-01-12 04:28:24,939 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5527 transitions. Word has length 1729 [2019-01-12 04:28:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:24,940 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5527 transitions. [2019-01-12 04:28:24,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:28:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5527 transitions. [2019-01-12 04:28:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1747 [2019-01-12 04:28:24,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:24,971 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 14, 14, 14, 13, 13, 13, 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, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:24,972 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1276225934, now seen corresponding path program 1 times [2019-01-12 04:28:24,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:24,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:24,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:24,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:24,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9575 backedges. 3849 proven. 0 refuted. 0 times theorem prover too weak. 5726 trivial. 0 not checked. [2019-01-12 04:28:27,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:27,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:27,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:27,436 INFO L87 Difference]: Start difference. First operand 5344 states and 5527 transitions. Second operand 4 states. [2019-01-12 04:28:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:28,592 INFO L93 Difference]: Finished difference Result 11932 states and 12320 transitions. [2019-01-12 04:28:28,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:28,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1746 [2019-01-12 04:28:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:28,602 INFO L225 Difference]: With dead ends: 11932 [2019-01-12 04:28:28,602 INFO L226 Difference]: Without dead ends: 4276 [2019-01-12 04:28:28,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-01-12 04:28:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2019-01-12 04:28:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-01-12 04:28:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4182 transitions. [2019-01-12 04:28:28,667 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4182 transitions. Word has length 1746 [2019-01-12 04:28:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:28,668 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4182 transitions. [2019-01-12 04:28:28,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4182 transitions. [2019-01-12 04:28:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1818 [2019-01-12 04:28:28,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:28,703 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 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, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:28,703 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:28,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1727618608, now seen corresponding path program 1 times [2019-01-12 04:28:28,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:28,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:28,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:30,081 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-01-12 04:28:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10935 backedges. 5645 proven. 639 refuted. 0 times theorem prover too weak. 4651 trivial. 0 not checked. [2019-01-12 04:28:31,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:31,390 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 [2019-01-12 04:28:31,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:31,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:34,477 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 154 DAG size of output: 32 [2019-01-12 04:28:36,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10935 backedges. 3871 proven. 213 refuted. 0 times theorem prover too weak. 6851 trivial. 0 not checked. [2019-01-12 04:28:36,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:28:36,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-01-12 04:28:36,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 04:28:36,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 04:28:36,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:28:36,246 INFO L87 Difference]: Start difference. First operand 4098 states and 4182 transitions. Second operand 10 states. [2019-01-12 04:28:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:44,316 INFO L93 Difference]: Finished difference Result 10152 states and 10409 transitions. [2019-01-12 04:28:44,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:28:44,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1817 [2019-01-12 04:28:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:44,326 INFO L225 Difference]: With dead ends: 10152 [2019-01-12 04:28:44,327 INFO L226 Difference]: Without dead ends: 4988 [2019-01-12 04:28:44,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1835 GetRequests, 1820 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-01-12 04:28:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-01-12 04:28:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2019-01-12 04:28:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-01-12 04:28:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4531 transitions. [2019-01-12 04:28:44,413 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4531 transitions. Word has length 1817 [2019-01-12 04:28:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:44,416 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4531 transitions. [2019-01-12 04:28:44,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 04:28:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4531 transitions. [2019-01-12 04:28:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1944 [2019-01-12 04:28:44,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:44,453 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 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, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 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] [2019-01-12 04:28:44,453 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1949581878, now seen corresponding path program 1 times [2019-01-12 04:28:44,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:44,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:44,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:45,769 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 04:28:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12591 backedges. 7356 proven. 1392 refuted. 0 times theorem prover too weak. 3843 trivial. 0 not checked. [2019-01-12 04:28:49,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:49,074 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 [2019-01-12 04:28:49,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:49,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:49,802 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-12 04:28:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12591 backedges. 8748 proven. 0 refuted. 0 times theorem prover too weak. 3843 trivial. 0 not checked. [2019-01-12 04:28:53,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:53,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-01-12 04:28:53,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:28:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:28:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:53,184 INFO L87 Difference]: Start difference. First operand 4454 states and 4531 transitions. Second operand 8 states. [2019-01-12 04:28:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:56,140 INFO L93 Difference]: Finished difference Result 6806 states and 6946 transitions. [2019-01-12 04:28:56,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:28:56,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1943 [2019-01-12 04:28:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:56,145 INFO L225 Difference]: With dead ends: 6806 [2019-01-12 04:28:56,145 INFO L226 Difference]: Without dead ends: 4490 [2019-01-12 04:28:56,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1951 GetRequests, 1942 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:28:56,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-01-12 04:28:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3920. [2019-01-12 04:28:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-01-12 04:28:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3978 transitions. [2019-01-12 04:28:56,210 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3978 transitions. Word has length 1943 [2019-01-12 04:28:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:56,211 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3978 transitions. [2019-01-12 04:28:56,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:28:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3978 transitions. [2019-01-12 04:28:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2019 [2019-01-12 04:28:56,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:56,258 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 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, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 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] [2019-01-12 04:28:56,258 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:56,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1233211586, now seen corresponding path program 2 times [2019-01-12 04:28:56,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:56,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:56,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:56,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:56,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 9262 proven. 695 refuted. 0 times theorem prover too weak. 3867 trivial. 0 not checked. [2019-01-12 04:29:00,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:00,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:29:00,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 04:29:01,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 04:29:01,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 04:29:01,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13824 backedges. 9347 proven. 184 refuted. 0 times theorem prover too weak. 4293 trivial. 0 not checked. [2019-01-12 04:29:05,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:29:05,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-01-12 04:29:05,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:29:05,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:29:05,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:29:05,022 INFO L87 Difference]: Start difference. First operand 3920 states and 3978 transitions. Second operand 9 states. [2019-01-12 04:29:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:06,979 INFO L93 Difference]: Finished difference Result 5940 states and 6043 transitions. [2019-01-12 04:29:06,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:29:06,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2018 [2019-01-12 04:29:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:06,983 INFO L225 Difference]: With dead ends: 5940 [2019-01-12 04:29:06,984 INFO L226 Difference]: Without dead ends: 4158 [2019-01-12 04:29:06,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2027 GetRequests, 2017 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:29:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2019-01-12 04:29:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 3920. [2019-01-12 04:29:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-01-12 04:29:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3959 transitions. [2019-01-12 04:29:07,032 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3959 transitions. Word has length 2018 [2019-01-12 04:29:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:07,034 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3959 transitions. [2019-01-12 04:29:07,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:29:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3959 transitions. [2019-01-12 04:29:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2120 [2019-01-12 04:29:07,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:07,064 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 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, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 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] [2019-01-12 04:29:07,065 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:07,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2140269625, now seen corresponding path program 1 times [2019-01-12 04:29:07,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:07,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:07,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:07,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 04:29:07,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:07,998 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 3 [2019-01-12 04:29:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14529 backedges. 4566 proven. 213 refuted. 0 times theorem prover too weak. 9750 trivial. 0 not checked. [2019-01-12 04:29:09,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:09,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:29:09,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:10,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:12,861 WARN L181 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 533 DAG size of output: 36 [2019-01-12 04:29:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 14529 backedges. 4566 proven. 213 refuted. 0 times theorem prover too weak. 9750 trivial. 0 not checked. [2019-01-12 04:29:15,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:29:15,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 04:29:15,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:29:15,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:29:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:29:15,195 INFO L87 Difference]: Start difference. First operand 3920 states and 3959 transitions. Second operand 6 states. [2019-01-12 04:29:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:20,022 INFO L93 Difference]: Finished difference Result 7302 states and 7378 transitions. [2019-01-12 04:29:20,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:29:20,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2119 [2019-01-12 04:29:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:20,024 INFO L225 Difference]: With dead ends: 7302 [2019-01-12 04:29:20,025 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:29:20,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2126 GetRequests, 2119 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:29:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:29:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:29:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:29:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:29:20,030 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2119 [2019-01-12 04:29:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:20,030 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:29:20,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:29:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:29:20,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:29:20,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:29:20,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:20,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,034 WARN L181 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 571 DAG size of output: 469 [2019-01-12 04:29:21,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:21,941 WARN L181 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 571 DAG size of output: 469 [2019-01-12 04:29:28,974 WARN L181 SmtUtils]: Spent 7.03 s on a formula simplification. DAG size of input: 437 DAG size of output: 177 [2019-01-12 04:29:35,711 WARN L181 SmtUtils]: Spent 6.73 s on a formula simplification. DAG size of input: 437 DAG size of output: 177 [2019-01-12 04:29:35,716 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-01-12 04:29:35,716 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-01-12 04:29:35,716 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-01-12 04:29:35,717 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,718 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-01-12 04:29:35,719 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-01-12 04:29:35,720 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-01-12 04:29:35,721 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-01-12 04:29:35,722 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-01-12 04:29:35,723 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:29:35,724 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-01-12 04:29:35,725 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:29:35,726 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-01-12 04:29:35,727 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-01-12 04:29:35,728 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,729 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-01-12 04:29:35,730 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:29:35,730 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:29:35,730 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-01-12 04:29:35,730 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-01-12 04:29:35,730 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-01-12 04:29:35,730 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,730 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,731 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse14 (= ~a21~0 8))) (let ((.cse34 (+ ~a12~0 43)) (.cse25 (= ~a21~0 10)) (.cse0 (= ~a15~0 7)) (.cse27 (not .cse14)) (.cse9 (<= ~a15~0 8))) (let ((.cse22 (= ~a15~0 8)) (.cse40 (or (and (not .cse0) .cse9) (and .cse27 .cse9))) (.cse6 (= ~a24~0 1)) (.cse29 (not .cse25)) (.cse28 (<= .cse34 0)) (.cse43 (< 11 ~a12~0)) (.cse13 (= ~a15~0 9))) (let ((.cse33 (and .cse25 .cse9)) (.cse31 (or .cse28 .cse43 .cse13)) (.cse18 (and .cse40 .cse6 .cse29)) (.cse30 (= ~a21~0 7)) (.cse39 (or .cse43 (and .cse22 .cse6))) (.cse7 (= ~a15~0 5))) (let ((.cse10 (<= ~a21~0 6)) (.cse17 (not .cse7)) (.cse1 (and .cse39 .cse6 .cse14 .cse9)) (.cse8 (exists ((v_~a12~0_436 Int)) (let ((.cse41 (div (+ v_~a12~0_436 (- 600066)) 5))) (let ((.cse42 (+ (* 34 .cse41) 34))) (and (not (= (mod (+ (* 4 .cse41) 4) 10) 0)) (< .cse42 0) (<= v_~a12~0_436 586307) (not (= 0 (mod (+ v_~a12~0_436 4) 5))) (<= ~a12~0 (+ (div .cse42 10) 1)) (< v_~a12~0_436 600066)))))) (.cse21 (and .cse40 .cse6 .cse30)) (.cse3 (not .cse22)) (.cse19 (= ~a21~0 9)) (.cse26 (<= ~a12~0 599999)) (.cse24 (< 80 ~a12~0)) (.cse20 (and .cse31 (and (and (<= ~a12~0 80) .cse18) .cse39))) (.cse32 (exists ((v_prenex_26 Int)) (let ((.cse38 (div (+ v_prenex_26 (- 600066)) 5))) (let ((.cse37 (* 34 .cse38))) (let ((.cse36 (+ .cse37 34)) (.cse35 (* 4 .cse38))) (and (not (= 0 (mod .cse35 10))) (<= ~a12~0 (+ (div .cse36 10) 1)) (< .cse37 0) (< .cse36 0) (not (= 0 (mod (+ .cse35 4) 10))) (< v_prenex_26 600066) (<= v_prenex_26 599999) (not (= 0 (mod (+ v_prenex_26 4) 5))))))))) (.cse2 (and .cse33 .cse6)) (.cse23 (<= 19 ~a12~0)) (.cse15 (<= ~a12~0 11)) (.cse4 (< 0 .cse34)) (.cse5 (= ~a21~0 6)) (.cse11 (<= 95381 ~a12~0)) (.cse12 (<= ~a12~0 586307)) (.cse16 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1) (and (and .cse2 .cse3) .cse4) (and .cse5 .cse6 .cse7) (and .cse8 .cse3 .cse9 .cse10) (and .cse5 .cse11 .cse6 .cse12 .cse13) (and .cse0 .cse2) (and .cse6 .cse14 .cse13 .cse15 .cse4) (and .cse6 .cse9 .cse16 .cse10) (and .cse17 .cse3 .cse18) (and (and (not (= ULTIMATE.start_calculate_output_~input 5)) (and .cse18 .cse15) .cse19) .cse17 .cse4) (and .cse3 .cse20) (and (and (and .cse21 .cse15) .cse22) .cse4) (and (and .cse6 .cse14) .cse12 .cse13 .cse23) (and (and (<= ~a12~0 73282) .cse17 .cse1) .cse24) (and (and .cse25 .cse6 .cse13) .cse26 .cse24) (and .cse3 (and (and .cse27 (and .cse28 .cse9) .cse29) .cse6)) (and (not (= ULTIMATE.start_calculate_output_~input 2)) .cse25 .cse6 .cse13 .cse15 .cse4) (and .cse8 .cse6 .cse25 .cse13) (and (and (or .cse30 .cse14) .cse6 .cse13) .cse26 .cse24) (and (and .cse21 .cse31) .cse3) (and (and .cse6 .cse13 .cse19) .cse26 .cse24) (and .cse20 .cse23) (and .cse22 .cse32 .cse25 .cse6) (and .cse0 .cse32 .cse6) (or (and .cse2 .cse23) (and (and .cse6 (and .cse33 .cse15)) .cse4)) (and .cse5 (and .cse6 .cse9) .cse11 .cse12) (and .cse13 (and .cse6 (<= (+ ~a12~0 526767) 0) .cse14)) (and .cse22 .cse16 .cse6 .cse30))))))) [2019-01-12 04:29:35,731 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-01-12 04:29:35,731 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-01-12 04:29:35,731 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:29:35,731 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:29:35,731 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-01-12 04:29:35,731 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-01-12 04:29:35,732 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,733 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 04:29:35,734 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,734 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-01-12 04:29:35,734 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse14 (= ~a21~0 8))) (let ((.cse34 (+ ~a12~0 43)) (.cse25 (= ~a21~0 10)) (.cse0 (= ~a15~0 7)) (.cse27 (not .cse14)) (.cse9 (<= ~a15~0 8))) (let ((.cse22 (= ~a15~0 8)) (.cse40 (or (and (not .cse0) .cse9) (and .cse27 .cse9))) (.cse6 (= ~a24~0 1)) (.cse29 (not .cse25)) (.cse28 (<= .cse34 0)) (.cse43 (< 11 ~a12~0)) (.cse13 (= ~a15~0 9))) (let ((.cse33 (and .cse25 .cse9)) (.cse31 (or .cse28 .cse43 .cse13)) (.cse18 (and .cse40 .cse6 .cse29)) (.cse30 (= ~a21~0 7)) (.cse39 (or .cse43 (and .cse22 .cse6))) (.cse7 (= ~a15~0 5))) (let ((.cse10 (<= ~a21~0 6)) (.cse17 (not .cse7)) (.cse1 (and .cse39 .cse6 .cse14 .cse9)) (.cse8 (exists ((v_~a12~0_436 Int)) (let ((.cse41 (div (+ v_~a12~0_436 (- 600066)) 5))) (let ((.cse42 (+ (* 34 .cse41) 34))) (and (not (= (mod (+ (* 4 .cse41) 4) 10) 0)) (< .cse42 0) (<= v_~a12~0_436 586307) (not (= 0 (mod (+ v_~a12~0_436 4) 5))) (<= ~a12~0 (+ (div .cse42 10) 1)) (< v_~a12~0_436 600066)))))) (.cse21 (and .cse40 .cse6 .cse30)) (.cse3 (not .cse22)) (.cse19 (= ~a21~0 9)) (.cse26 (<= ~a12~0 599999)) (.cse24 (< 80 ~a12~0)) (.cse20 (and .cse31 (and (and (<= ~a12~0 80) .cse18) .cse39))) (.cse32 (exists ((v_prenex_26 Int)) (let ((.cse38 (div (+ v_prenex_26 (- 600066)) 5))) (let ((.cse37 (* 34 .cse38))) (let ((.cse36 (+ .cse37 34)) (.cse35 (* 4 .cse38))) (and (not (= 0 (mod .cse35 10))) (<= ~a12~0 (+ (div .cse36 10) 1)) (< .cse37 0) (< .cse36 0) (not (= 0 (mod (+ .cse35 4) 10))) (< v_prenex_26 600066) (<= v_prenex_26 599999) (not (= 0 (mod (+ v_prenex_26 4) 5))))))))) (.cse2 (and .cse33 .cse6)) (.cse23 (<= 19 ~a12~0)) (.cse15 (<= ~a12~0 11)) (.cse4 (< 0 .cse34)) (.cse5 (= ~a21~0 6)) (.cse11 (<= 95381 ~a12~0)) (.cse12 (<= ~a12~0 586307)) (.cse16 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1) (and (and .cse2 .cse3) .cse4) (and .cse5 .cse6 .cse7) (and .cse8 .cse3 .cse9 .cse10) (and .cse5 .cse11 .cse6 .cse12 .cse13) (and .cse0 .cse2) (and .cse6 .cse14 .cse13 .cse15 .cse4) (and .cse6 .cse9 .cse16 .cse10) (and .cse17 .cse3 .cse18) (and (and (not (= ULTIMATE.start_calculate_output_~input 5)) (and .cse18 .cse15) .cse19) .cse17 .cse4) (and .cse3 .cse20) (and (and (and .cse21 .cse15) .cse22) .cse4) (and (and .cse6 .cse14) .cse12 .cse13 .cse23) (and (and (<= ~a12~0 73282) .cse17 .cse1) .cse24) (and (and .cse25 .cse6 .cse13) .cse26 .cse24) (and .cse3 (and (and .cse27 (and .cse28 .cse9) .cse29) .cse6)) (and (not (= ULTIMATE.start_calculate_output_~input 2)) .cse25 .cse6 .cse13 .cse15 .cse4) (and .cse8 .cse6 .cse25 .cse13) (and (and (or .cse30 .cse14) .cse6 .cse13) .cse26 .cse24) (and (and .cse21 .cse31) .cse3) (and (and .cse6 .cse13 .cse19) .cse26 .cse24) (and .cse20 .cse23) (and .cse22 .cse32 .cse25 .cse6) (and .cse0 .cse32 .cse6) (or (and .cse2 .cse23) (and (and .cse6 (and .cse33 .cse15)) .cse4)) (and .cse5 (and .cse6 .cse9) .cse11 .cse12) (and .cse13 (and .cse6 (<= (+ ~a12~0 526767) 0) .cse14)) (and .cse22 .cse16 .cse6 .cse30))))))) [2019-01-12 04:29:35,734 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-01-12 04:29:35,734 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-01-12 04:29:35,735 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-01-12 04:29:35,736 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-01-12 04:29:35,737 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-01-12 04:29:35,738 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:29:35,739 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:29:35,739 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:29:35,739 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-01-12 04:29:35,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,752 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,754 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,755 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,758 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,759 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,760 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:35,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:35,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:29:35 BoogieIcfgContainer [2019-01-12 04:29:35,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:29:35,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:29:35,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:29:35,851 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:29:35,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:27:27" (3/4) ... [2019-01-12 04:29:35,859 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:29:35,916 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 04:29:35,917 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:29:35,967 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a15 == 7 && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) || ((((a21 == 10 && a15 <= 8) && a24 == 1) && !(a15 == 8)) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (a15 == 7 && (a21 == 10 && a15 <= 8) && a24 == 1)) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a15 <= 8) && a12 + 49 <= 0) && a21 <= 6)) || ((!(a15 == 5) && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10))) || ((((!(input == 5) && ((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && a12 <= 11) && a21 == 9) && !(a15 == 5)) && 0 < a12 + 43)) || (!(a15 == 8) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1)))) || (((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && a12 <= 11) && a15 == 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 8) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || (((a12 <= 73282 && !(a15 == 5)) && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) && 80 < a12)) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (!(a15 == 8) && ((!(a21 == 8) && a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) && a24 == 1)) || (((((!(input == 2) && a21 == 10) && a24 == 1) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a21 == 7 || a21 == 8) && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9)) && !(a15 == 8))) || ((((a24 == 1 && a15 == 9) && a21 == 9) && a12 <= 599999) && 80 < a12)) || ((((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1))) && 19 <= a12)) || (((a15 == 8 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a21 == 10) && a24 == 1)) || ((a15 == 7 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a24 == 1)) || (((a21 == 10 && a15 <= 8) && a24 == 1) && 19 <= a12) || ((a24 == 1 && (a21 == 10 && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a21 == 6 && a24 == 1 && a15 <= 8) && 95381 <= a12) && a12 <= 586307)) || (a15 == 9 && (a24 == 1 && a12 + 526767 <= 0) && a21 == 8)) || (((a15 == 8 && a12 + 49 <= 0) && a24 == 1) && a21 == 7) [2019-01-12 04:29:35,973 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a15 == 7 && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) || ((((a21 == 10 && a15 <= 8) && a24 == 1) && !(a15 == 8)) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (a15 == 7 && (a21 == 10 && a15 <= 8) && a24 == 1)) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a15 <= 8) && a12 + 49 <= 0) && a21 <= 6)) || ((!(a15 == 5) && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10))) || ((((!(input == 5) && ((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && a12 <= 11) && a21 == 9) && !(a15 == 5)) && 0 < a12 + 43)) || (!(a15 == 8) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1)))) || (((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && a12 <= 11) && a15 == 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 8) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || (((a12 <= 73282 && !(a15 == 5)) && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) && 80 < a12)) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (!(a15 == 8) && ((!(a21 == 8) && a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) && a24 == 1)) || (((((!(input == 2) && a21 == 10) && a24 == 1) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a21 == 7 || a21 == 8) && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9)) && !(a15 == 8))) || ((((a24 == 1 && a15 == 9) && a21 == 9) && a12 <= 599999) && 80 < a12)) || ((((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1))) && 19 <= a12)) || (((a15 == 8 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a21 == 10) && a24 == 1)) || ((a15 == 7 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a24 == 1)) || (((a21 == 10 && a15 <= 8) && a24 == 1) && 19 <= a12) || ((a24 == 1 && (a21 == 10 && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a21 == 6 && a24 == 1 && a15 <= 8) && 95381 <= a12) && a12 <= 586307)) || (a15 == 9 && (a24 == 1 && a12 + 526767 <= 0) && a21 == 8)) || (((a15 == 8 && a12 + 49 <= 0) && a24 == 1) && a21 == 7) [2019-01-12 04:29:36,129 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:29:36,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:29:36,138 INFO L168 Benchmark]: Toolchain (without parser) took 132735.28 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 937.9 MB in the beginning and 1.8 GB in the end (delta: -866.2 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-01-12 04:29:36,139 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:29:36,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.47 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 905.7 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:29:36,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 229.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 905.7 MB in the beginning and 1.1 GB in the end (delta: -222.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:29:36,140 INFO L168 Benchmark]: Boogie Preprocessor took 128.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:29:36,140 INFO L168 Benchmark]: RCFGBuilder took 3397.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 124.8 MB). Peak memory consumption was 124.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:29:36,140 INFO L168 Benchmark]: TraceAbstraction took 127865.31 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 996.6 MB in the beginning and 1.8 GB in the end (delta: -807.6 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-01-12 04:29:36,144 INFO L168 Benchmark]: Witness Printer took 286.01 ms. Allocated memory is still 5.1 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:29:36,148 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 819.47 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 905.7 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 229.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 905.7 MB in the beginning and 1.1 GB in the end (delta: -222.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3397.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 124.8 MB). Peak memory consumption was 124.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 127865.31 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 996.6 MB in the beginning and 1.8 GB in the end (delta: -807.6 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 286.01 ms. Allocated memory is still 5.1 GB. Free memory is still 1.8 GB. There was no memory consumed. 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_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: 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: 880]: Loop Invariant [2019-01-12 04:29:36,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a15 == 7 && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) || ((((a21 == 10 && a15 <= 8) && a24 == 1) && !(a15 == 8)) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (a15 == 7 && (a21 == 10 && a15 <= 8) && a24 == 1)) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a15 <= 8) && a12 + 49 <= 0) && a21 <= 6)) || ((!(a15 == 5) && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10))) || ((((!(input == 5) && ((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && a12 <= 11) && a21 == 9) && !(a15 == 5)) && 0 < a12 + 43)) || (!(a15 == 8) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1)))) || (((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && a12 <= 11) && a15 == 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 8) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || (((a12 <= 73282 && !(a15 == 5)) && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) && 80 < a12)) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (!(a15 == 8) && ((!(a21 == 8) && a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) && a24 == 1)) || (((((!(input == 2) && a21 == 10) && a24 == 1) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a21 == 7 || a21 == 8) && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9)) && !(a15 == 8))) || ((((a24 == 1 && a15 == 9) && a21 == 9) && a12 <= 599999) && 80 < a12)) || ((((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1))) && 19 <= a12)) || (((a15 == 8 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a21 == 10) && a24 == 1)) || ((a15 == 7 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a24 == 1)) || (((a21 == 10 && a15 <= 8) && a24 == 1) && 19 <= a12) || ((a24 == 1 && (a21 == 10 && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a21 == 6 && a24 == 1 && a15 <= 8) && 95381 <= a12) && a12 <= 586307)) || (a15 == 9 && (a24 == 1 && a12 + 526767 <= 0) && a21 == 8)) || (((a15 == 8 && a12 + 49 <= 0) && a24 == 1) && a21 == 7) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 04:29:36,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,183 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_436,QUANTIFIED] [2019-01-12 04:29:36,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2019-01-12 04:29:36,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a15 == 7 && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) || ((((a21 == 10 && a15 <= 8) && a24 == 1) && !(a15 == 8)) && 0 < a12 + 43)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && !(a15 == 8)) && a15 <= 8) && a21 <= 6)) || ((((a21 == 6 && 95381 <= a12) && a24 == 1) && a12 <= 586307) && a15 == 9)) || (a15 == 7 && (a21 == 10 && a15 <= 8) && a24 == 1)) || ((((a24 == 1 && a21 == 8) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || (((a24 == 1 && a15 <= 8) && a12 + 49 <= 0) && a21 <= 6)) || ((!(a15 == 5) && !(a15 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10))) || ((((!(input == 5) && ((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && a12 <= 11) && a21 == 9) && !(a15 == 5)) && 0 < a12 + 43)) || (!(a15 == 8) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1)))) || (((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && a12 <= 11) && a15 == 8) && 0 < a12 + 43)) || ((((a24 == 1 && a21 == 8) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || (((a12 <= 73282 && !(a15 == 5)) && (((11 < a12 || (a15 == 8 && a24 == 1)) && a24 == 1) && a21 == 8) && a15 <= 8) && 80 < a12)) || ((((a21 == 10 && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || (!(a15 == 8) && ((!(a21 == 8) && a12 + 43 <= 0 && a15 <= 8) && !(a21 == 10)) && a24 == 1)) || (((((!(input == 2) && a21 == 10) && a24 == 1) && a15 == 9) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_~a12~0_436 : int :: ((((!((4 * ((v_~a12~0_436 + -600066) / 5) + 4) % 10 == 0) && 34 * ((v_~a12~0_436 + -600066) / 5) + 34 < 0) && v_~a12~0_436 <= 586307) && !(0 == (v_~a12~0_436 + 4) % 5)) && a12 <= (34 * ((v_~a12~0_436 + -600066) / 5) + 34) / 10 + 1) && v_~a12~0_436 < 600066) && a24 == 1) && a21 == 10) && a15 == 9)) || (((((a21 == 7 || a21 == 8) && a24 == 1) && a15 == 9) && a12 <= 599999) && 80 < a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && a21 == 7) && ((a12 + 43 <= 0 || 11 < a12) || a15 == 9)) && !(a15 == 8))) || ((((a24 == 1 && a15 == 9) && a21 == 9) && a12 <= 599999) && 80 < a12)) || ((((a12 + 43 <= 0 || 11 < a12) || a15 == 9) && (a12 <= 80 && (((!(a15 == 7) && a15 <= 8) || (!(a21 == 8) && a15 <= 8)) && a24 == 1) && !(a21 == 10)) && (11 < a12 || (a15 == 8 && a24 == 1))) && 19 <= a12)) || (((a15 == 8 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a21 == 10) && a24 == 1)) || ((a15 == 7 && (\exists v_prenex_26 : int :: ((((((!(0 == 4 * ((v_prenex_26 + -600066) / 5) % 10) && a12 <= (34 * ((v_prenex_26 + -600066) / 5) + 34) / 10 + 1) && 34 * ((v_prenex_26 + -600066) / 5) < 0) && 34 * ((v_prenex_26 + -600066) / 5) + 34 < 0) && !(0 == (4 * ((v_prenex_26 + -600066) / 5) + 4) % 10)) && v_prenex_26 < 600066) && v_prenex_26 <= 599999) && !(0 == (v_prenex_26 + 4) % 5))) && a24 == 1)) || (((a21 == 10 && a15 <= 8) && a24 == 1) && 19 <= a12) || ((a24 == 1 && (a21 == 10 && a15 <= 8) && a12 <= 11) && 0 < a12 + 43)) || (((a21 == 6 && a24 == 1 && a15 <= 8) && 95381 <= a12) && a12 <= 586307)) || (a15 == 9 && (a24 == 1 && a12 + 526767 <= 0) && a21 == 8)) || (((a15 == 8 && a12 + 49 <= 0) && a24 == 1) && a21 == 7) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. SAFE Result, 127.6s OverallTime, 18 OverallIterations, 18 TraceHistogramMax, 49.3s AutomataDifference, 0.0s DeadEndRemovalTime, 15.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 787 SDtfs, 8488 SDslu, 519 SDs, 0 SdLazy, 32220 SolverSat, 2588 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13840 GetRequests, 13702 SyntacticMatches, 15 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5344occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 9586 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 104 NumberOfFragments, 1887 HoareAnnotationTreeSize, 3 FomulaSimplifications, 738992 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 909482 FormulaSimplificationTreeSizeReductionInter, 13.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 36.4s InterpolantComputationTime, 32921 NumberOfCodeBlocks, 32921 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 32893 ConstructedInterpolants, 74 QuantifiedInterpolants, 179986013 SizeOfPredicates, 23 NumberOfNonLiveVariables, 16648 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 163922/168569 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...