./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label40_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem11_label40_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4fc65ef25b30818fd1841f3cfc924fa7d058e0c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:40:49,302 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:40:49,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:40:49,335 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:40:49,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:40:49,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:40:49,341 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:40:49,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:40:49,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:40:49,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:40:49,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:40:49,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:40:49,357 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:40:49,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:40:49,369 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:40:49,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:40:49,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:40:49,376 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:40:49,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:40:49,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:40:49,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:40:49,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:40:49,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:40:49,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:40:49,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:40:49,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:40:49,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:40:49,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:40:49,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:40:49,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:40:49,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:40:49,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:40:49,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:40:49,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:40:49,410 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:40:49,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:40:49,411 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:40:49,440 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:40:49,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:40:49,441 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:40:49,441 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:40:49,442 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:40:49,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:40:49,443 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:40:49,444 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:40:49,444 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:40:49,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:40:49,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:40:49,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:40:49,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:40:49,446 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:40:49,446 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:40:49,446 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:40:49,447 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:40:49,447 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:40:49,447 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:40:49,447 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:40:49,447 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:40:49,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:40:49,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:40:49,450 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:40:49,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:40:49,451 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:40:49,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:40:49,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:40:49,451 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 -> d4fc65ef25b30818fd1841f3cfc924fa7d058e0c [2019-01-12 03:40:49,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:40:49,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:40:49,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:40:49,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:40:49,522 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:40:49,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label40_true-unreach-call.c [2019-01-12 03:40:49,580 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e49d54bb/c2d762e5902f4e66b72c83fb5108e690/FLAG9614e635b [2019-01-12 03:40:50,127 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:40:50,127 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label40_true-unreach-call.c [2019-01-12 03:40:50,153 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e49d54bb/c2d762e5902f4e66b72c83fb5108e690/FLAG9614e635b [2019-01-12 03:40:50,375 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e49d54bb/c2d762e5902f4e66b72c83fb5108e690 [2019-01-12 03:40:50,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:40:50,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:40:50,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:40:50,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:40:50,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:40:50,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:40:50" (1/1) ... [2019-01-12 03:40:50,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6889cd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:50, skipping insertion in model container [2019-01-12 03:40:50,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:40:50" (1/1) ... [2019-01-12 03:40:50,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:40:50,479 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:40:51,003 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:40:51,018 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:40:51,300 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:40:51,329 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:40:51,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51 WrapperNode [2019-01-12 03:40:51,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:40:51,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:40:51,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:40:51,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:40:51,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (1/1) ... [2019-01-12 03:40:51,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (1/1) ... [2019-01-12 03:40:51,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:40:51,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:40:51,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:40:51,674 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:40:51,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (1/1) ... [2019-01-12 03:40:51,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (1/1) ... [2019-01-12 03:40:51,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (1/1) ... [2019-01-12 03:40:51,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (1/1) ... [2019-01-12 03:40:51,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (1/1) ... [2019-01-12 03:40:51,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (1/1) ... [2019-01-12 03:40:51,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (1/1) ... [2019-01-12 03:40:51,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:40:51,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:40:51,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:40:51,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:40:51,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (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 03:40:51,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:40:51,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:40:55,721 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:40:55,722 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:40:55,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:40:55 BoogieIcfgContainer [2019-01-12 03:40:55,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:40:55,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:40:55,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:40:55,728 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:40:55,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:40:50" (1/3) ... [2019-01-12 03:40:55,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8c26e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:40:55, skipping insertion in model container [2019-01-12 03:40:55,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:51" (2/3) ... [2019-01-12 03:40:55,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8c26e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:40:55, skipping insertion in model container [2019-01-12 03:40:55,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:40:55" (3/3) ... [2019-01-12 03:40:55,732 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label40_true-unreach-call.c [2019-01-12 03:40:55,740 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:40:55,748 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:40:55,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:40:55,799 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:40:55,800 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:40:55,800 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:40:55,800 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:40:55,800 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:40:55,801 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:40:55,801 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:40:55,801 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:40:55,801 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:40:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-01-12 03:40:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 03:40:55,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:55,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:40:55,839 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:55,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2019-01-12 03:40:55,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:55,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:55,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:55,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:56,275 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 03:40:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:56,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:40:56,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:56,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:56,301 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-01-12 03:40:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:59,738 INFO L93 Difference]: Finished difference Result 951 states and 1718 transitions. [2019-01-12 03:40:59,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:59,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-12 03:40:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:59,761 INFO L225 Difference]: With dead ends: 951 [2019-01-12 03:40:59,761 INFO L226 Difference]: Without dead ends: 600 [2019-01-12 03:40:59,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-01-12 03:40:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 410. [2019-01-12 03:40:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-01-12 03:40:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2019-01-12 03:40:59,840 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 44 [2019-01-12 03:40:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:59,841 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2019-01-12 03:40:59,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2019-01-12 03:40:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 03:40:59,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:59,846 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:59,847 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:59,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1200539258, now seen corresponding path program 1 times [2019-01-12 03:40:59,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:59,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:59,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:59,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:59,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:00,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:00,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:41:00,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:00,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:00,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:00,184 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand 4 states. [2019-01-12 03:41:02,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:02,749 INFO L93 Difference]: Finished difference Result 1572 states and 2289 transitions. [2019-01-12 03:41:02,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:02,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-01-12 03:41:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:02,757 INFO L225 Difference]: With dead ends: 1572 [2019-01-12 03:41:02,757 INFO L226 Difference]: Without dead ends: 1164 [2019-01-12 03:41:02,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-01-12 03:41:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1150. [2019-01-12 03:41:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-01-12 03:41:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1569 transitions. [2019-01-12 03:41:02,818 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1569 transitions. Word has length 112 [2019-01-12 03:41:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:02,818 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1569 transitions. [2019-01-12 03:41:02,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1569 transitions. [2019-01-12 03:41:02,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 03:41:02,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:02,824 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:41:02,824 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:02,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:02,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1996860134, now seen corresponding path program 1 times [2019-01-12 03:41:02,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:02,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:02,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:02,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:02,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:03,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:03,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:41:03,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:03,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:03,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:03,037 INFO L87 Difference]: Start difference. First operand 1150 states and 1569 transitions. Second operand 4 states. [2019-01-12 03:41:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:06,677 INFO L93 Difference]: Finished difference Result 3968 states and 5436 transitions. [2019-01-12 03:41:06,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:06,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-01-12 03:41:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:06,693 INFO L225 Difference]: With dead ends: 3968 [2019-01-12 03:41:06,693 INFO L226 Difference]: Without dead ends: 2820 [2019-01-12 03:41:06,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2019-01-12 03:41:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2255. [2019-01-12 03:41:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-01-12 03:41:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2826 transitions. [2019-01-12 03:41:06,745 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2826 transitions. Word has length 120 [2019-01-12 03:41:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:06,746 INFO L480 AbstractCegarLoop]: Abstraction has 2255 states and 2826 transitions. [2019-01-12 03:41:06,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2826 transitions. [2019-01-12 03:41:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-12 03:41:06,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:06,753 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:41:06,754 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:06,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:06,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1199532265, now seen corresponding path program 1 times [2019-01-12 03:41:06,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:06,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:06,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:06,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:06,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:07,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:07,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:41:07,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:07,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:07,056 INFO L87 Difference]: Start difference. First operand 2255 states and 2826 transitions. Second operand 4 states. [2019-01-12 03:41:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:08,636 INFO L93 Difference]: Finished difference Result 5077 states and 6434 transitions. [2019-01-12 03:41:08,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:08,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-01-12 03:41:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:08,650 INFO L225 Difference]: With dead ends: 5077 [2019-01-12 03:41:08,650 INFO L226 Difference]: Without dead ends: 3008 [2019-01-12 03:41:08,653 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 03:41:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-01-12 03:41:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2808. [2019-01-12 03:41:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-01-12 03:41:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 3477 transitions. [2019-01-12 03:41:08,708 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 3477 transitions. Word has length 171 [2019-01-12 03:41:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:08,709 INFO L480 AbstractCegarLoop]: Abstraction has 2808 states and 3477 transitions. [2019-01-12 03:41:08,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 3477 transitions. [2019-01-12 03:41:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-12 03:41:08,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:08,719 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:08,719 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash -25691425, now seen corresponding path program 1 times [2019-01-12 03:41:08,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:08,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:08,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:09,345 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-12 03:41:09,625 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-12 03:41:10,005 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-12 03:41:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 83 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:10,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:41:10,156 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 03:41:10,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:10,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:41:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-01-12 03:41:10,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:41:10,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-01-12 03:41:10,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 03:41:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 03:41:10,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:41:10,674 INFO L87 Difference]: Start difference. First operand 2808 states and 3477 transitions. Second operand 9 states. [2019-01-12 03:41:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:21,930 INFO L93 Difference]: Finished difference Result 12653 states and 15778 transitions. [2019-01-12 03:41:21,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 03:41:21,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 246 [2019-01-12 03:41:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:21,972 INFO L225 Difference]: With dead ends: 12653 [2019-01-12 03:41:21,973 INFO L226 Difference]: Without dead ends: 10031 [2019-01-12 03:41:21,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-01-12 03:41:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10031 states. [2019-01-12 03:41:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10031 to 8170. [2019-01-12 03:41:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8170 states. [2019-01-12 03:41:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8170 states to 8170 states and 9692 transitions. [2019-01-12 03:41:22,170 INFO L78 Accepts]: Start accepts. Automaton has 8170 states and 9692 transitions. Word has length 246 [2019-01-12 03:41:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:22,170 INFO L480 AbstractCegarLoop]: Abstraction has 8170 states and 9692 transitions. [2019-01-12 03:41:22,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 03:41:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 8170 states and 9692 transitions. [2019-01-12 03:41:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-01-12 03:41:22,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:22,187 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:41:22,187 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1942644120, now seen corresponding path program 1 times [2019-01-12 03:41:22,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:22,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:22,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:22,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:22,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 03:41:22,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:22,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:41:22,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:41:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:41:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:41:22,527 INFO L87 Difference]: Start difference. First operand 8170 states and 9692 transitions. Second operand 3 states. [2019-01-12 03:41:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:23,626 INFO L93 Difference]: Finished difference Result 18174 states and 21759 transitions. [2019-01-12 03:41:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:41:23,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-01-12 03:41:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:23,664 INFO L225 Difference]: With dead ends: 18174 [2019-01-12 03:41:23,664 INFO L226 Difference]: Without dead ends: 9822 [2019-01-12 03:41:23,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:41:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9822 states. [2019-01-12 03:41:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9822 to 7429. [2019-01-12 03:41:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2019-01-12 03:41:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 8644 transitions. [2019-01-12 03:41:23,835 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 8644 transitions. Word has length 308 [2019-01-12 03:41:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:23,835 INFO L480 AbstractCegarLoop]: Abstraction has 7429 states and 8644 transitions. [2019-01-12 03:41:23,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:41:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 8644 transitions. [2019-01-12 03:41:23,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-01-12 03:41:23,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:23,846 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:41:23,846 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:23,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:23,846 INFO L82 PathProgramCache]: Analyzing trace with hash 14139960, now seen corresponding path program 1 times [2019-01-12 03:41:23,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:23,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:23,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:23,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:23,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:24,230 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 03:41:24,615 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2019-01-12 03:41:25,059 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-12 03:41:25,405 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-01-12 03:41:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 38 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:25,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:41:25,617 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 03:41:25,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:25,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:41:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-12 03:41:25,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:41:25,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-01-12 03:41:25,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:41:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:41:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:41:25,884 INFO L87 Difference]: Start difference. First operand 7429 states and 8644 transitions. Second operand 8 states. [2019-01-12 03:41:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:32,301 INFO L93 Difference]: Finished difference Result 22042 states and 25990 transitions. [2019-01-12 03:41:32,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 03:41:32,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 324 [2019-01-12 03:41:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:32,332 INFO L225 Difference]: With dead ends: 22042 [2019-01-12 03:41:32,333 INFO L226 Difference]: Without dead ends: 14799 [2019-01-12 03:41:32,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 03:41:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14799 states. [2019-01-12 03:41:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14799 to 9818. [2019-01-12 03:41:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9818 states. [2019-01-12 03:41:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9818 states to 9818 states and 11437 transitions. [2019-01-12 03:41:32,514 INFO L78 Accepts]: Start accepts. Automaton has 9818 states and 11437 transitions. Word has length 324 [2019-01-12 03:41:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:32,514 INFO L480 AbstractCegarLoop]: Abstraction has 9818 states and 11437 transitions. [2019-01-12 03:41:32,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:41:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 9818 states and 11437 transitions. [2019-01-12 03:41:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-12 03:41:32,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:32,525 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 03:41:32,525 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:32,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:32,526 INFO L82 PathProgramCache]: Analyzing trace with hash 160008569, now seen corresponding path program 1 times [2019-01-12 03:41:32,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:32,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:32,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:32,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:32,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-12 03:41:32,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:32,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:41:32,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:32,858 INFO L87 Difference]: Start difference. First operand 9818 states and 11437 transitions. Second operand 4 states. [2019-01-12 03:41:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:34,574 INFO L93 Difference]: Finished difference Result 21124 states and 24624 transitions. [2019-01-12 03:41:34,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:34,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-01-12 03:41:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:34,598 INFO L225 Difference]: With dead ends: 21124 [2019-01-12 03:41:34,598 INFO L226 Difference]: Without dead ends: 12230 [2019-01-12 03:41:34,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12230 states. [2019-01-12 03:41:34,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12230 to 10554. [2019-01-12 03:41:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10554 states. [2019-01-12 03:41:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 12181 transitions. [2019-01-12 03:41:34,777 INFO L78 Accepts]: Start accepts. Automaton has 10554 states and 12181 transitions. Word has length 326 [2019-01-12 03:41:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:34,778 INFO L480 AbstractCegarLoop]: Abstraction has 10554 states and 12181 transitions. [2019-01-12 03:41:34,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 10554 states and 12181 transitions. [2019-01-12 03:41:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-12 03:41:34,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:34,791 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:34,792 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:34,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:34,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1715676696, now seen corresponding path program 1 times [2019-01-12 03:41:34,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:34,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:34,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:34,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:34,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 03:41:35,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:35,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:41:35,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:35,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:35,245 INFO L87 Difference]: Start difference. First operand 10554 states and 12181 transitions. Second operand 4 states. [2019-01-12 03:41:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:36,654 INFO L93 Difference]: Finished difference Result 20576 states and 23875 transitions. [2019-01-12 03:41:36,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:41:36,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-01-12 03:41:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:36,677 INFO L225 Difference]: With dead ends: 20576 [2019-01-12 03:41:36,677 INFO L226 Difference]: Without dead ends: 11868 [2019-01-12 03:41:36,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-01-12 03:41:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 11112. [2019-01-12 03:41:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11112 states. [2019-01-12 03:41:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11112 states to 11112 states and 12759 transitions. [2019-01-12 03:41:36,855 INFO L78 Accepts]: Start accepts. Automaton has 11112 states and 12759 transitions. Word has length 330 [2019-01-12 03:41:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:36,856 INFO L480 AbstractCegarLoop]: Abstraction has 11112 states and 12759 transitions. [2019-01-12 03:41:36,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 11112 states and 12759 transitions. [2019-01-12 03:41:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-01-12 03:41:36,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:36,876 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:41:36,876 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:36,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash 283838804, now seen corresponding path program 1 times [2019-01-12 03:41:36,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:36,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:36,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 125 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:41:37,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:41:37,329 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 03:41:37,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:37,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:41:38,396 WARN L181 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 483 DAG size of output: 27 [2019-01-12 03:41:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 125 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:41:38,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:41:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2019-01-12 03:41:38,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:41:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:41:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:41:38,964 INFO L87 Difference]: Start difference. First operand 11112 states and 12759 transitions. Second operand 7 states. [2019-01-12 03:41:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:42,234 INFO L93 Difference]: Finished difference Result 23519 states and 27103 transitions. [2019-01-12 03:41:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:41:42,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 353 [2019-01-12 03:41:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:42,258 INFO L225 Difference]: With dead ends: 23519 [2019-01-12 03:41:42,258 INFO L226 Difference]: Without dead ends: 13516 [2019-01-12 03:41:42,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:41:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13516 states. [2019-01-12 03:41:42,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13516 to 11298. [2019-01-12 03:41:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-01-12 03:41:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 12762 transitions. [2019-01-12 03:41:42,501 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 12762 transitions. Word has length 353 [2019-01-12 03:41:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:42,502 INFO L480 AbstractCegarLoop]: Abstraction has 11298 states and 12762 transitions. [2019-01-12 03:41:42,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:41:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 12762 transitions. [2019-01-12 03:41:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-01-12 03:41:42,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:42,516 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 03:41:42,518 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2116616153, now seen corresponding path program 1 times [2019-01-12 03:41:42,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:42,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:42,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:42,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:42,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-01-12 03:41:42,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:42,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:41:42,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:41:42,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:41:42,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:41:42,856 INFO L87 Difference]: Start difference. First operand 11298 states and 12762 transitions. Second operand 4 states. [2019-01-12 03:41:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:43,806 INFO L93 Difference]: Finished difference Result 20563 states and 23294 transitions. [2019-01-12 03:41:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:41:43,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 363 [2019-01-12 03:41:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:43,819 INFO L225 Difference]: With dead ends: 20563 [2019-01-12 03:41:43,821 INFO L226 Difference]: Without dead ends: 11111 [2019-01-12 03:41:43,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 03:41:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11111 states. [2019-01-12 03:41:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11111 to 11108. [2019-01-12 03:41:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11108 states. [2019-01-12 03:41:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11108 states to 11108 states and 12383 transitions. [2019-01-12 03:41:43,992 INFO L78 Accepts]: Start accepts. Automaton has 11108 states and 12383 transitions. Word has length 363 [2019-01-12 03:41:43,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:43,994 INFO L480 AbstractCegarLoop]: Abstraction has 11108 states and 12383 transitions. [2019-01-12 03:41:43,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:41:43,994 INFO L276 IsEmpty]: Start isEmpty. Operand 11108 states and 12383 transitions. [2019-01-12 03:41:44,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-12 03:41:44,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:44,010 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:44,010 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1717603792, now seen corresponding path program 1 times [2019-01-12 03:41:44,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:44,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:44,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:44,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:44,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:44,608 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-12 03:41:44,933 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-12 03:41:45,299 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-01-12 03:41:45,703 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2019-01-12 03:41:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 305 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 03:41:46,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:41:46,087 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 03:41:46,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:46,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:41:46,784 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2019-01-12 03:41:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 241 proven. 68 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 03:41:47,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:41:47,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-01-12 03:41:47,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:41:47,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:41:47,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:41:47,272 INFO L87 Difference]: Start difference. First operand 11108 states and 12383 transitions. Second operand 10 states. [2019-01-12 03:41:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:56,066 INFO L93 Difference]: Finished difference Result 25962 states and 28789 transitions. [2019-01-12 03:41:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 03:41:56,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 370 [2019-01-12 03:41:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:56,085 INFO L225 Difference]: With dead ends: 25962 [2019-01-12 03:41:56,086 INFO L226 Difference]: Without dead ends: 15040 [2019-01-12 03:41:56,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-12 03:41:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15040 states. [2019-01-12 03:41:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15040 to 11105. [2019-01-12 03:41:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11105 states. [2019-01-12 03:41:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11105 states to 11105 states and 12328 transitions. [2019-01-12 03:41:56,276 INFO L78 Accepts]: Start accepts. Automaton has 11105 states and 12328 transitions. Word has length 370 [2019-01-12 03:41:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:56,277 INFO L480 AbstractCegarLoop]: Abstraction has 11105 states and 12328 transitions. [2019-01-12 03:41:56,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:41:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 11105 states and 12328 transitions. [2019-01-12 03:41:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-12 03:41:56,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:56,291 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 03:41:56,293 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:56,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:56,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1792377671, now seen corresponding path program 1 times [2019-01-12 03:41:56,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:56,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:56,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:56,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:56,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 03:41:56,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:56,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:41:56,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:41:56,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:41:56,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:41:56,655 INFO L87 Difference]: Start difference. First operand 11105 states and 12328 transitions. Second operand 5 states. [2019-01-12 03:41:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:58,805 INFO L93 Difference]: Finished difference Result 25708 states and 28517 transitions. [2019-01-12 03:41:58,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:41:58,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 370 [2019-01-12 03:41:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:58,822 INFO L225 Difference]: With dead ends: 25708 [2019-01-12 03:41:58,823 INFO L226 Difference]: Without dead ends: 14789 [2019-01-12 03:41:58,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:41:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14789 states. [2019-01-12 03:41:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14789 to 12759. [2019-01-12 03:41:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12759 states. [2019-01-12 03:41:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12759 states to 12759 states and 13991 transitions. [2019-01-12 03:41:59,006 INFO L78 Accepts]: Start accepts. Automaton has 12759 states and 13991 transitions. Word has length 370 [2019-01-12 03:41:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:59,006 INFO L480 AbstractCegarLoop]: Abstraction has 12759 states and 13991 transitions. [2019-01-12 03:41:59,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:41:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 12759 states and 13991 transitions. [2019-01-12 03:41:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-01-12 03:41:59,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:59,021 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:41:59,022 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1559812086, now seen corresponding path program 1 times [2019-01-12 03:41:59,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:59,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:59,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:59,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-01-12 03:41:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:59,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:41:59,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:41:59,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:41:59,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:41:59,355 INFO L87 Difference]: Start difference. First operand 12759 states and 13991 transitions. Second operand 3 states. [2019-01-12 03:41:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:59,915 INFO L93 Difference]: Finished difference Result 22372 states and 24570 transitions. [2019-01-12 03:41:59,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:41:59,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 416 [2019-01-12 03:41:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:59,925 INFO L225 Difference]: With dead ends: 22372 [2019-01-12 03:41:59,925 INFO L226 Difference]: Without dead ends: 11457 [2019-01-12 03:41:59,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:41:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11457 states. [2019-01-12 03:42:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11457 to 11454. [2019-01-12 03:42:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11454 states. [2019-01-12 03:42:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11454 states to 11454 states and 12498 transitions. [2019-01-12 03:42:00,068 INFO L78 Accepts]: Start accepts. Automaton has 11454 states and 12498 transitions. Word has length 416 [2019-01-12 03:42:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:42:00,068 INFO L480 AbstractCegarLoop]: Abstraction has 11454 states and 12498 transitions. [2019-01-12 03:42:00,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:42:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 11454 states and 12498 transitions. [2019-01-12 03:42:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-01-12 03:42:00,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:42:00,082 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:42:00,082 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:42:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:42:00,082 INFO L82 PathProgramCache]: Analyzing trace with hash -225925453, now seen corresponding path program 1 times [2019-01-12 03:42:00,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:42:00,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:42:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:42:00,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:42:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:42:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:42:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 363 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-01-12 03:42:00,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:42:00,802 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 03:42:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:42:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:42:00,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:42:14,467 WARN L181 SmtUtils]: Spent 12.91 s on a formula simplification. DAG size of input: 565 DAG size of output: 35 [2019-01-12 03:42:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 321 proven. 42 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-01-12 03:42:15,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:42:15,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-12 03:42:15,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:42:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:42:15,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:42:15,080 INFO L87 Difference]: Start difference. First operand 11454 states and 12498 transitions. Second operand 8 states. [2019-01-12 03:43:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:11,016 INFO L93 Difference]: Finished difference Result 27148 states and 29598 transitions. [2019-01-12 03:43:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 03:43:11,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 439 [2019-01-12 03:43:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:11,033 INFO L225 Difference]: With dead ends: 27148 [2019-01-12 03:43:11,034 INFO L226 Difference]: Without dead ends: 15325 [2019-01-12 03:43:11,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:43:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15325 states. [2019-01-12 03:43:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15325 to 11084. [2019-01-12 03:43:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11084 states. [2019-01-12 03:43:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11084 states to 11084 states and 11966 transitions. [2019-01-12 03:43:11,179 INFO L78 Accepts]: Start accepts. Automaton has 11084 states and 11966 transitions. Word has length 439 [2019-01-12 03:43:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:11,179 INFO L480 AbstractCegarLoop]: Abstraction has 11084 states and 11966 transitions. [2019-01-12 03:43:11,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:43:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 11084 states and 11966 transitions. [2019-01-12 03:43:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-01-12 03:43:11,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:11,191 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:11,191 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:11,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash -883041383, now seen corresponding path program 1 times [2019-01-12 03:43:11,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:11,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:11,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:11,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-01-12 03:43:11,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:11,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:43:11,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:43:11,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:43:11,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:43:11,595 INFO L87 Difference]: Start difference. First operand 11084 states and 11966 transitions. Second operand 3 states. [2019-01-12 03:43:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:12,537 INFO L93 Difference]: Finished difference Result 22718 states and 24501 transitions. [2019-01-12 03:43:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:43:12,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-01-12 03:43:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:12,557 INFO L225 Difference]: With dead ends: 22718 [2019-01-12 03:43:12,558 INFO L226 Difference]: Without dead ends: 11822 [2019-01-12 03:43:12,567 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 03:43:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2019-01-12 03:43:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 10532. [2019-01-12 03:43:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10532 states. [2019-01-12 03:43:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10532 states to 10532 states and 11331 transitions. [2019-01-12 03:43:12,701 INFO L78 Accepts]: Start accepts. Automaton has 10532 states and 11331 transitions. Word has length 441 [2019-01-12 03:43:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:12,702 INFO L480 AbstractCegarLoop]: Abstraction has 10532 states and 11331 transitions. [2019-01-12 03:43:12,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:43:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 10532 states and 11331 transitions. [2019-01-12 03:43:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-01-12 03:43:12,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:12,711 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:43:12,711 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash -597325104, now seen corresponding path program 1 times [2019-01-12 03:43:12,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:12,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:12,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:12,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 436 proven. 78 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-01-12 03:43:13,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:13,129 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 03:43:13,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:13,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 436 proven. 78 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-01-12 03:43:13,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:13,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-01-12 03:43:13,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:43:13,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:43:13,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:43:13,418 INFO L87 Difference]: Start difference. First operand 10532 states and 11331 transitions. Second operand 5 states. [2019-01-12 03:43:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:15,391 INFO L93 Difference]: Finished difference Result 22357 states and 24052 transitions. [2019-01-12 03:43:15,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:43:15,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 449 [2019-01-12 03:43:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:15,403 INFO L225 Difference]: With dead ends: 22357 [2019-01-12 03:43:15,403 INFO L226 Difference]: Without dead ends: 12381 [2019-01-12 03:43:15,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:43:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12381 states. [2019-01-12 03:43:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12381 to 10716. [2019-01-12 03:43:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10716 states. [2019-01-12 03:43:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10716 states to 10716 states and 11493 transitions. [2019-01-12 03:43:15,522 INFO L78 Accepts]: Start accepts. Automaton has 10716 states and 11493 transitions. Word has length 449 [2019-01-12 03:43:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:15,522 INFO L480 AbstractCegarLoop]: Abstraction has 10716 states and 11493 transitions. [2019-01-12 03:43:15,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:43:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 10716 states and 11493 transitions. [2019-01-12 03:43:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-01-12 03:43:15,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:15,532 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:43:15,533 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:15,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1006159341, now seen corresponding path program 1 times [2019-01-12 03:43:15,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:15,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:15,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:15,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:15,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-01-12 03:43:16,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:16,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:43:16,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:16,027 INFO L87 Difference]: Start difference. First operand 10716 states and 11493 transitions. Second operand 4 states. [2019-01-12 03:43:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:17,539 INFO L93 Difference]: Finished difference Result 22359 states and 23935 transitions. [2019-01-12 03:43:17,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:17,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2019-01-12 03:43:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:17,551 INFO L225 Difference]: With dead ends: 22359 [2019-01-12 03:43:17,551 INFO L226 Difference]: Without dead ends: 12199 [2019-01-12 03:43:17,557 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 03:43:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12199 states. [2019-01-12 03:43:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12199 to 9790. [2019-01-12 03:43:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9790 states. [2019-01-12 03:43:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9790 states to 9790 states and 10472 transitions. [2019-01-12 03:43:17,670 INFO L78 Accepts]: Start accepts. Automaton has 9790 states and 10472 transitions. Word has length 496 [2019-01-12 03:43:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:17,671 INFO L480 AbstractCegarLoop]: Abstraction has 9790 states and 10472 transitions. [2019-01-12 03:43:17,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 9790 states and 10472 transitions. [2019-01-12 03:43:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-01-12 03:43:17,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:17,677 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:17,677 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1384310801, now seen corresponding path program 1 times [2019-01-12 03:43:17,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:17,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:17,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:17,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:17,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:18,195 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 03:43:18,785 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-12 03:43:19,080 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-01-12 03:43:19,563 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 13 [2019-01-12 03:43:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 499 proven. 230 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 03:43:20,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:20,031 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 03:43:20,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:20,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 499 proven. 230 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 03:43:21,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:21,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-01-12 03:43:21,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 03:43:21,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 03:43:21,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-01-12 03:43:21,153 INFO L87 Difference]: Start difference. First operand 9790 states and 10472 transitions. Second operand 14 states. [2019-01-12 03:43:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:27,415 INFO L93 Difference]: Finished difference Result 20592 states and 21994 transitions. [2019-01-12 03:43:27,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 03:43:27,416 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 501 [2019-01-12 03:43:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:27,426 INFO L225 Difference]: With dead ends: 20592 [2019-01-12 03:43:27,426 INFO L226 Difference]: Without dead ends: 11539 [2019-01-12 03:43:27,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 497 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2019-01-12 03:43:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11539 states. [2019-01-12 03:43:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11539 to 9235. [2019-01-12 03:43:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9235 states. [2019-01-12 03:43:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9235 states to 9235 states and 9881 transitions. [2019-01-12 03:43:27,579 INFO L78 Accepts]: Start accepts. Automaton has 9235 states and 9881 transitions. Word has length 501 [2019-01-12 03:43:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:27,579 INFO L480 AbstractCegarLoop]: Abstraction has 9235 states and 9881 transitions. [2019-01-12 03:43:27,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 03:43:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 9235 states and 9881 transitions. [2019-01-12 03:43:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2019-01-12 03:43:27,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:27,590 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:27,590 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:27,591 INFO L82 PathProgramCache]: Analyzing trace with hash 789546173, now seen corresponding path program 1 times [2019-01-12 03:43:27,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:27,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:27,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:27,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:27,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:28,346 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-12 03:43:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 500 proven. 247 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 03:43:28,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:28,653 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 03:43:28,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:28,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 500 proven. 247 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 03:43:30,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:30,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-01-12 03:43:30,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 03:43:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 03:43:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:43:30,535 INFO L87 Difference]: Start difference. First operand 9235 states and 9881 transitions. Second operand 9 states. [2019-01-12 03:43:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:35,815 INFO L93 Difference]: Finished difference Result 19396 states and 20726 transitions. [2019-01-12 03:43:35,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 03:43:35,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 545 [2019-01-12 03:43:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:35,827 INFO L225 Difference]: With dead ends: 19396 [2019-01-12 03:43:35,827 INFO L226 Difference]: Without dead ends: 10715 [2019-01-12 03:43:35,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-12 03:43:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10715 states. [2019-01-12 03:43:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10715 to 9233. [2019-01-12 03:43:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9233 states. [2019-01-12 03:43:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9233 states to 9233 states and 9838 transitions. [2019-01-12 03:43:35,955 INFO L78 Accepts]: Start accepts. Automaton has 9233 states and 9838 transitions. Word has length 545 [2019-01-12 03:43:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:35,956 INFO L480 AbstractCegarLoop]: Abstraction has 9233 states and 9838 transitions. [2019-01-12 03:43:35,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 03:43:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 9233 states and 9838 transitions. [2019-01-12 03:43:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-01-12 03:43:35,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:35,963 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:35,963 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:35,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash 27802822, now seen corresponding path program 1 times [2019-01-12 03:43:35,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:35,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:35,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:35,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:35,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:36,434 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-12 03:43:36,700 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 7 [2019-01-12 03:43:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-01-12 03:43:37,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:37,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:43:37,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:43:37,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:43:37,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:43:37,100 INFO L87 Difference]: Start difference. First operand 9233 states and 9838 transitions. Second operand 5 states. [2019-01-12 03:43:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:40,029 INFO L93 Difference]: Finished difference Result 17731 states and 18909 transitions. [2019-01-12 03:43:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:43:40,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 561 [2019-01-12 03:43:40,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:40,040 INFO L225 Difference]: With dead ends: 17731 [2019-01-12 03:43:40,041 INFO L226 Difference]: Without dead ends: 9420 [2019-01-12 03:43:40,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:43:40,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9420 states. [2019-01-12 03:43:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9420 to 7943. [2019-01-12 03:43:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7943 states. [2019-01-12 03:43:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 8436 transitions. [2019-01-12 03:43:40,139 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 8436 transitions. Word has length 561 [2019-01-12 03:43:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:40,140 INFO L480 AbstractCegarLoop]: Abstraction has 7943 states and 8436 transitions. [2019-01-12 03:43:40,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:43:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 8436 transitions. [2019-01-12 03:43:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2019-01-12 03:43:40,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:40,149 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:40,149 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:40,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1180727470, now seen corresponding path program 1 times [2019-01-12 03:43:40,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:40,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:40,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:40,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:40,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:41,025 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 7 [2019-01-12 03:43:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 132 proven. 1061 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-01-12 03:43:41,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:41,772 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 03:43:41,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:41,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 428 proven. 765 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-01-12 03:43:43,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:43,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-01-12 03:43:43,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 03:43:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 03:43:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-12 03:43:43,254 INFO L87 Difference]: Start difference. First operand 7943 states and 8436 transitions. Second operand 12 states. [2019-01-12 03:43:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:48,610 INFO L93 Difference]: Finished difference Result 23269 states and 24661 transitions. [2019-01-12 03:43:48,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 03:43:48,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 716 [2019-01-12 03:43:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:48,630 INFO L225 Difference]: With dead ends: 23269 [2019-01-12 03:43:48,631 INFO L226 Difference]: Without dead ends: 15696 [2019-01-12 03:43:48,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 711 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:43:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15696 states. [2019-01-12 03:43:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15696 to 10337. [2019-01-12 03:43:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10337 states. [2019-01-12 03:43:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10337 states to 10337 states and 10963 transitions. [2019-01-12 03:43:48,818 INFO L78 Accepts]: Start accepts. Automaton has 10337 states and 10963 transitions. Word has length 716 [2019-01-12 03:43:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:48,819 INFO L480 AbstractCegarLoop]: Abstraction has 10337 states and 10963 transitions. [2019-01-12 03:43:48,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 03:43:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 10337 states and 10963 transitions. [2019-01-12 03:43:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2019-01-12 03:43:48,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:48,881 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, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 03:43:48,882 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:48,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:48,883 INFO L82 PathProgramCache]: Analyzing trace with hash -424076112, now seen corresponding path program 1 times [2019-01-12 03:43:48,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:48,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:48,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:48,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:48,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 1498 proven. 115 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-01-12 03:43:49,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:49,847 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 03:43:49,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:50,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:50,274 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 14 [2019-01-12 03:43:53,052 WARN L181 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 184 DAG size of output: 25 [2019-01-12 03:43:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 1387 proven. 84 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2019-01-12 03:43:54,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:54,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-12 03:43:54,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:43:54,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:43:54,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:43:54,652 INFO L87 Difference]: Start difference. First operand 10337 states and 10963 transitions. Second operand 8 states. [2019-01-12 03:44:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:03,403 INFO L93 Difference]: Finished difference Result 29889 states and 31675 transitions. [2019-01-12 03:44:03,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 03:44:03,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 810 [2019-01-12 03:44:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:03,427 INFO L225 Difference]: With dead ends: 29889 [2019-01-12 03:44:03,427 INFO L226 Difference]: Without dead ends: 20106 [2019-01-12 03:44:03,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 815 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-12 03:44:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20106 states. [2019-01-12 03:44:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20106 to 12365. [2019-01-12 03:44:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12365 states. [2019-01-12 03:44:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12365 states to 12365 states and 13123 transitions. [2019-01-12 03:44:03,653 INFO L78 Accepts]: Start accepts. Automaton has 12365 states and 13123 transitions. Word has length 810 [2019-01-12 03:44:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:03,654 INFO L480 AbstractCegarLoop]: Abstraction has 12365 states and 13123 transitions. [2019-01-12 03:44:03,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:44:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 12365 states and 13123 transitions. [2019-01-12 03:44:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2019-01-12 03:44:03,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:03,671 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, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-12 03:44:03,671 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:03,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash 974634076, now seen corresponding path program 2 times [2019-01-12 03:44:03,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:03,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:03,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:03,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:04,391 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2019-01-12 03:44:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 1461 proven. 42 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-12 03:44:04,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:44:04,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:44:04,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 03:44:05,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 03:44:05,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 03:44:05,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:44:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2702 backedges. 1461 proven. 42 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-12 03:44:06,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:44:06,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-01-12 03:44:06,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 03:44:06,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 03:44:06,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:44:06,034 INFO L87 Difference]: Start difference. First operand 12365 states and 13123 transitions. Second operand 6 states. [2019-01-12 03:44:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:08,350 INFO L93 Difference]: Finished difference Result 28227 states and 29881 transitions. [2019-01-12 03:44:08,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:44:08,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 976 [2019-01-12 03:44:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:08,352 INFO L225 Difference]: With dead ends: 28227 [2019-01-12 03:44:08,352 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:44:08,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 975 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:44:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:44:08,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:44:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:44:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:44:08,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 976 [2019-01-12 03:44:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:08,362 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:44:08,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 03:44:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:44:08,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:44:08,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:44:08,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:08,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:08,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:08,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:08,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:09,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:09,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:09,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:10,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:11,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:11,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:12,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:12,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:12,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,625 WARN L181 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 986 DAG size of output: 858 [2019-01-12 03:44:13,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,220 WARN L181 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 986 DAG size of output: 858 [2019-01-12 03:44:31,820 WARN L181 SmtUtils]: Spent 15.59 s on a formula simplification. DAG size of input: 834 DAG size of output: 224 [2019-01-12 03:44:45,776 WARN L181 SmtUtils]: Spent 13.95 s on a formula simplification. DAG size of input: 834 DAG size of output: 224 [2019-01-12 03:44:45,780 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 03:44:45,781 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-12 03:44:45,781 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 03:44:45,781 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-01-12 03:44:45,781 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,781 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,781 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,781 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,781 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-01-12 03:44:45,782 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,783 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,783 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,783 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,783 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,783 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-01-12 03:44:45,783 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 03:44:45,783 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 03:44:45,783 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,784 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse3 (= ~a25~0 10)) (.cse32 (= ~a25~0 13))) (let ((.cse11 (< 140 ~a29~0)) (.cse52 (not .cse32)) (.cse41 (= ~a4~0 1)) (.cse51 (not .cse3)) (.cse36 (+ ~a23~0 43))) (let ((.cse37 (<= ~a29~0 140)) (.cse16 (= ~a25~0 12)) (.cse44 (< 0 .cse36)) (.cse48 (and .cse52 .cse41 .cse51)) (.cse4 (= ~a8~0 15)) (.cse27 (and .cse11 .cse41 .cse51)) (.cse21 (<= ~a23~0 138)) (.cse6 (= ~a25~0 11))) (let ((.cse30 (not .cse6)) (.cse20 (<= ~a29~0 274)) (.cse18 (or (and .cse48 .cse4 .cse21) (and .cse4 .cse27 .cse21))) (.cse12 (= ~a25~0 9)) (.cse31 (< 306 ~a23~0)) (.cse9 (= ~a3~0 1)) (.cse45 (and (and .cse44 .cse52 .cse51) .cse11)) (.cse33 (<= ~a29~0 277)) (.cse28 (< 245 ~a29~0)) (.cse40 (<= ~a29~0 130)) (.cse49 (not .cse16)) (.cse2 (= 1 ~a4~0)) (.cse39 (and .cse52 .cse37))) (let ((.cse22 (let ((.cse50 (and .cse44 .cse39 .cse51))) (or (and .cse40 .cse50 .cse2) (and .cse50 .cse49 .cse2)))) (.cse5 (and .cse28 (and .cse6 .cse27))) (.cse13 (and .cse45 .cse49 .cse33 .cse2)) (.cse24 (or (and .cse48 .cse12 .cse31 .cse9) (and .cse41 .cse3))) (.cse25 (<= 260 ~a29~0)) (.cse1 (= 15 ~a8~0)) (.cse10 (<= ~a23~0 599997)) (.cse0 (exists ((v_prenex_39 Int)) (let ((.cse46 (div v_prenex_39 5))) (let ((.cse47 (mod (+ (div (+ .cse46 (- 54476)) 5) 1) 90))) (and (< .cse46 54476) (not (= (mod v_prenex_39 5) 0)) (not (= (mod (+ .cse46 4) 5) 0)) (<= ~a23~0 (+ .cse47 119)) (< v_prenex_39 0) (= 0 .cse47) (<= (+ v_prenex_39 43) 0) (<= (+ v_prenex_39 599992) 0)))))) (.cse23 (<= ~a29~0 599998)) (.cse38 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse44 .cse11)) (.cse19 (<= ~a4~0 0)) (.cse34 (<= (+ ~a23~0 127600) 0)) (.cse7 (<= ~a23~0 312)) (.cse8 (or .cse44 .cse11)) (.cse15 (and (and .cse30 .cse20 .cse18) .cse9)) (.cse26 (and (or (and .cse45 .cse6) (and .cse4 .cse11 (and .cse16 .cse31) .cse9)) .cse33 .cse2)) (.cse43 (<= ~a29~0 245)) (.cse14 (and (or (and .cse44 .cse3) (and .cse12 .cse4 .cse31)) .cse33 .cse2))) (or (and (= 1 ~a3~0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0) (and .cse6 .cse7 .cse4 .cse8 .cse2 .cse9) (and .cse10 (and .cse11 (and (or (and .cse12 .cse4 .cse13) (and .cse14 .cse4)) .cse9))) (and .cse15 .cse16 (exists ((v_prenex_63 Int)) (let ((.cse17 (+ v_prenex_63 69157))) (and (<= 130 v_prenex_63) (<= (+ ~a29~0 299882) (mod .cse17 299861)) (<= 0 .cse17))))) (and .cse12 .cse18) (and (and (and .cse4 .cse19 (and .cse16 .cse11)) .cse20 .cse9) .cse21) (and .cse22 .cse7 .cse12 .cse4) (and .cse4 .cse19 .cse23 .cse0 .cse3 .cse9) (and .cse22 .cse4 .cse21) (and .cse24 .cse4 .cse0 .cse25) (and .cse4 .cse5 .cse9) (and .cse10 (and (and .cse4 .cse26) .cse9)) (and .cse4 .cse19 .cse23 .cse0 .cse6 .cse9) (and .cse4 .cse13 .cse21) (and (or (and .cse12 .cse4 (and .cse27 .cse28)) (and .cse24 .cse4 .cse25)) .cse9) (and .cse1 .cse2 .cse10 (exists ((v_prenex_63 Int)) (let ((.cse29 (+ v_prenex_63 69157))) (and (<= 130 v_prenex_63) (<= ~a29~0 (+ (mod .cse29 299861) 300138)) (<= 0 .cse29)))) .cse30 .cse31 .cse9) (and .cse32 (<= ~a23~0 306) .cse27) (and .cse23 (or (and (and .cse33 (and .cse4 (and .cse19 (and .cse34 .cse16) .cse28))) .cse9) (and .cse12 .cse4 .cse19 (exists ((v_prenex_58 Int)) (let ((.cse35 (mod v_prenex_58 299861))) (and (< 140 v_prenex_58) (<= (+ .cse35 10250) ~a29~0) (= 0 .cse35)))) .cse9 (<= .cse36 0)))) (and .cse4 .cse19 .cse21 (and .cse3 .cse37) .cse9) (and (and .cse32 .cse4 .cse19 .cse38 .cse0 .cse9) .cse23) (and (and .cse16 .cse4 .cse19) .cse38 (<= (+ ~a29~0 22) 0) .cse9) (and (and .cse4 .cse19 .cse39) .cse12 .cse21 .cse9) (and .cse32 .cse40 .cse2 (<= ~a23~0 262)) (and .cse34 .cse41 .cse3) (and .cse16 .cse7 .cse4 .cse41 .cse9 .cse8) (let ((.cse42 (+ ~a23~0 599908))) (and .cse15 (<= .cse42 0) (<= 0 .cse42) .cse43)) (and .cse4 .cse9 (and .cse26 .cse28)) (and (or (and .cse32 .cse4 .cse43 .cse2 .cse9) (and (and .cse4 (and .cse14 .cse28)) .cse9)) .cse11))))))) [2019-01-12 03:44:45,784 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,784 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,784 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,784 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,784 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,785 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 03:44:45,786 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,787 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,788 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-01-12 03:44:45,789 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,790 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,791 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-12 03:44:45,792 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-01-12 03:44:45,792 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-01-12 03:44:45,797 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,797 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,797 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,797 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,797 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,797 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,797 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,797 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,798 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,799 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:44:45,800 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,801 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,802 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,803 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,804 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-12 03:44:45,805 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,806 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,807 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:44:45,808 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,809 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,810 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse3 (= ~a25~0 10)) (.cse32 (= ~a25~0 13))) (let ((.cse11 (< 140 ~a29~0)) (.cse52 (not .cse32)) (.cse41 (= ~a4~0 1)) (.cse51 (not .cse3)) (.cse36 (+ ~a23~0 43))) (let ((.cse37 (<= ~a29~0 140)) (.cse16 (= ~a25~0 12)) (.cse44 (< 0 .cse36)) (.cse48 (and .cse52 .cse41 .cse51)) (.cse4 (= ~a8~0 15)) (.cse27 (and .cse11 .cse41 .cse51)) (.cse21 (<= ~a23~0 138)) (.cse6 (= ~a25~0 11))) (let ((.cse30 (not .cse6)) (.cse20 (<= ~a29~0 274)) (.cse18 (or (and .cse48 .cse4 .cse21) (and .cse4 .cse27 .cse21))) (.cse12 (= ~a25~0 9)) (.cse31 (< 306 ~a23~0)) (.cse9 (= ~a3~0 1)) (.cse45 (and (and .cse44 .cse52 .cse51) .cse11)) (.cse33 (<= ~a29~0 277)) (.cse28 (< 245 ~a29~0)) (.cse40 (<= ~a29~0 130)) (.cse49 (not .cse16)) (.cse2 (= 1 ~a4~0)) (.cse39 (and .cse52 .cse37))) (let ((.cse22 (let ((.cse50 (and .cse44 .cse39 .cse51))) (or (and .cse40 .cse50 .cse2) (and .cse50 .cse49 .cse2)))) (.cse5 (and .cse28 (and .cse6 .cse27))) (.cse13 (and .cse45 .cse49 .cse33 .cse2)) (.cse24 (or (and .cse48 .cse12 .cse31 .cse9) (and .cse41 .cse3))) (.cse25 (<= 260 ~a29~0)) (.cse1 (= 15 ~a8~0)) (.cse10 (<= ~a23~0 599997)) (.cse0 (exists ((v_prenex_39 Int)) (let ((.cse46 (div v_prenex_39 5))) (let ((.cse47 (mod (+ (div (+ .cse46 (- 54476)) 5) 1) 90))) (and (< .cse46 54476) (not (= (mod v_prenex_39 5) 0)) (not (= (mod (+ .cse46 4) 5) 0)) (<= ~a23~0 (+ .cse47 119)) (< v_prenex_39 0) (= 0 .cse47) (<= (+ v_prenex_39 43) 0) (<= (+ v_prenex_39 599992) 0)))))) (.cse23 (<= ~a29~0 599998)) (.cse38 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse44 .cse11)) (.cse19 (<= ~a4~0 0)) (.cse34 (<= (+ ~a23~0 127600) 0)) (.cse7 (<= ~a23~0 312)) (.cse8 (or .cse44 .cse11)) (.cse15 (and (and .cse30 .cse20 .cse18) .cse9)) (.cse26 (and (or (and .cse45 .cse6) (and .cse4 .cse11 (and .cse16 .cse31) .cse9)) .cse33 .cse2)) (.cse43 (<= ~a29~0 245)) (.cse14 (and (or (and .cse44 .cse3) (and .cse12 .cse4 .cse31)) .cse33 .cse2))) (or (and (= 1 ~a3~0) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0) (and .cse6 .cse7 .cse4 .cse8 .cse2 .cse9) (and .cse10 (and .cse11 (and (or (and .cse12 .cse4 .cse13) (and .cse14 .cse4)) .cse9))) (and .cse15 .cse16 (exists ((v_prenex_63 Int)) (let ((.cse17 (+ v_prenex_63 69157))) (and (<= 130 v_prenex_63) (<= (+ ~a29~0 299882) (mod .cse17 299861)) (<= 0 .cse17))))) (and .cse12 .cse18) (and (and (and .cse4 .cse19 (and .cse16 .cse11)) .cse20 .cse9) .cse21) (and .cse22 .cse7 .cse12 .cse4) (and .cse4 .cse19 .cse23 .cse0 .cse3 .cse9) (and .cse22 .cse4 .cse21) (and .cse24 .cse4 .cse0 .cse25) (and .cse4 .cse5 .cse9) (and .cse10 (and (and .cse4 .cse26) .cse9)) (and .cse4 .cse19 .cse23 .cse0 .cse6 .cse9) (and .cse4 .cse13 .cse21) (and (or (and .cse12 .cse4 (and .cse27 .cse28)) (and .cse24 .cse4 .cse25)) .cse9) (and .cse1 .cse2 .cse10 (exists ((v_prenex_63 Int)) (let ((.cse29 (+ v_prenex_63 69157))) (and (<= 130 v_prenex_63) (<= ~a29~0 (+ (mod .cse29 299861) 300138)) (<= 0 .cse29)))) .cse30 .cse31 .cse9) (and .cse32 (<= ~a23~0 306) .cse27) (and .cse23 (or (and (and .cse33 (and .cse4 (and .cse19 (and .cse34 .cse16) .cse28))) .cse9) (and .cse12 .cse4 .cse19 (exists ((v_prenex_58 Int)) (let ((.cse35 (mod v_prenex_58 299861))) (and (< 140 v_prenex_58) (<= (+ .cse35 10250) ~a29~0) (= 0 .cse35)))) .cse9 (<= .cse36 0)))) (and .cse4 .cse19 .cse21 (and .cse3 .cse37) .cse9) (and (and .cse32 .cse4 .cse19 .cse38 .cse0 .cse9) .cse23) (and (and .cse16 .cse4 .cse19) .cse38 (<= (+ ~a29~0 22) 0) .cse9) (and (and .cse4 .cse19 .cse39) .cse12 .cse21 .cse9) (and .cse32 .cse40 .cse2 (<= ~a23~0 262)) (and .cse34 .cse41 .cse3) (and .cse16 .cse7 .cse4 .cse41 .cse9 .cse8) (let ((.cse42 (+ ~a23~0 599908))) (and .cse15 (<= .cse42 0) (<= 0 .cse42) .cse43)) (and .cse4 .cse9 (and .cse26 .cse28)) (and (or (and .cse32 .cse4 .cse43 .cse2 .cse9) (and (and .cse4 (and .cse14 .cse28)) .cse9)) .cse11))))))) [2019-01-12 03:44:45,810 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,811 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:44:45,811 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:44:45,811 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,811 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,811 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-01-12 03:44:45,811 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,811 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,811 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:45,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,845 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,851 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,852 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,853 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,856 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,857 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,858 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,859 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,862 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,863 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,864 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,871 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:45,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:45,874 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:45,875 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,875 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,875 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,876 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,908 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,908 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,911 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,911 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,912 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,912 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,912 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,913 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,913 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,913 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,917 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,917 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,917 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,918 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,918 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,918 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,919 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,919 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,919 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:45,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:45,932 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:45,932 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,932 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,932 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,956 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,987 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:45,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:45,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:45,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:45,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:45,996 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:44:46 BoogieIcfgContainer [2019-01-12 03:44:46,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:44:46,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:44:46,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:44:46,050 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:44:46,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:40:55" (3/4) ... [2019-01-12 03:44:46,062 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:44:46,123 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:44:46,125 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:44:46,168 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((1 == a3 && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && 15 == a8) && 1 == a4) && a25 == 10) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0))) || (((((a25 == 11 && a23 <= 312) && a8 == 15) && (0 < a23 + 43 || 140 < a29)) && 1 == a4) && a3 == 1)) || (a23 <= 599997 && 140 < a29 && (((a25 == 9 && a8 == 15) && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) || (((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && a8 == 15)) && a3 == 1)) || (((((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138))) && a3 == 1) && a25 == 12) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 + 299882 <= (v_prenex_63 + 69157) % 299861) && 0 <= v_prenex_63 + 69157))) || (a25 == 9 && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) || (((((a8 == 15 && a4 <= 0) && a25 == 12 && 140 < a29) && a29 <= 274) && a3 == 1) && a23 <= 138)) || ((((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a23 <= 312) && a25 == 9) && a8 == 15)) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a25 == 10) && a3 == 1)) || (((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a8 == 15) && a23 <= 138)) || (((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && 260 <= a29)) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a3 == 1)) || (a23 <= 599997 && (a8 == 15 && ((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && a3 == 1)) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a25 == 11) && a3 == 1)) || ((a8 == 15 && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) && a23 <= 138)) || ((((a25 == 9 && a8 == 15) && ((140 < a29 && a4 == 1) && !(a25 == 10)) && 245 < a29) || ((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && 260 <= a29)) && a3 == 1)) || ((((((15 == a8 && 1 == a4) && a23 <= 599997) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 <= (v_prenex_63 + 69157) % 299861 + 300138) && 0 <= v_prenex_63 + 69157)) && !(a25 == 11)) && 306 < a23) && a3 == 1)) || ((a25 == 13 && a23 <= 306) && (140 < a29 && a4 == 1) && !(a25 == 10))) || (a29 <= 599998 && (((a29 <= 277 && a8 == 15 && (a4 <= 0 && a23 + 127600 <= 0 && a25 == 12) && 245 < a29) && a3 == 1) || (((((a25 == 9 && a8 == 15) && a4 <= 0) && (\exists v_prenex_58 : int :: (140 < v_prenex_58 && v_prenex_58 % 299861 + 10250 <= a29) && 0 == v_prenex_58 % 299861)) && a3 == 1) && a23 + 43 <= 0)))) || ((((a8 == 15 && a4 <= 0) && a23 <= 138) && a25 == 10 && a29 <= 140) && a3 == 1)) || ((((((a25 == 13 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a3 == 1) && a29 <= 599998)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && a25 == 9) && a23 <= 138) && a3 == 1)) || (((a25 == 13 && a29 <= 130) && 1 == a4) && a23 <= 262)) || ((a23 + 127600 <= 0 && a4 == 1) && a25 == 10)) || (((((a25 == 12 && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1) && (0 < a23 + 43 || 140 < a29))) || ((((((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138))) && a3 == 1) && a23 + 599908 <= 0) && 0 <= a23 + 599908) && a29 <= 245)) || ((a8 == 15 && a3 == 1) && (((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && 245 < a29)) || ((((((a25 == 13 && a8 == 15) && a29 <= 245) && 1 == a4) && a3 == 1) || ((a8 == 15 && ((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && 245 < a29) && a3 == 1)) && 140 < a29) [2019-01-12 03:44:46,172 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((1 == a3 && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && 15 == a8) && 1 == a4) && a25 == 10) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0))) || (((((a25 == 11 && a23 <= 312) && a8 == 15) && (0 < a23 + 43 || 140 < a29)) && 1 == a4) && a3 == 1)) || (a23 <= 599997 && 140 < a29 && (((a25 == 9 && a8 == 15) && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) || (((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && a8 == 15)) && a3 == 1)) || (((((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138))) && a3 == 1) && a25 == 12) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 + 299882 <= (v_prenex_63 + 69157) % 299861) && 0 <= v_prenex_63 + 69157))) || (a25 == 9 && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) || (((((a8 == 15 && a4 <= 0) && a25 == 12 && 140 < a29) && a29 <= 274) && a3 == 1) && a23 <= 138)) || ((((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a23 <= 312) && a25 == 9) && a8 == 15)) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a25 == 10) && a3 == 1)) || (((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a8 == 15) && a23 <= 138)) || (((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && 260 <= a29)) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a3 == 1)) || (a23 <= 599997 && (a8 == 15 && ((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && a3 == 1)) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a25 == 11) && a3 == 1)) || ((a8 == 15 && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) && a23 <= 138)) || ((((a25 == 9 && a8 == 15) && ((140 < a29 && a4 == 1) && !(a25 == 10)) && 245 < a29) || ((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && 260 <= a29)) && a3 == 1)) || ((((((15 == a8 && 1 == a4) && a23 <= 599997) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 <= (v_prenex_63 + 69157) % 299861 + 300138) && 0 <= v_prenex_63 + 69157)) && !(a25 == 11)) && 306 < a23) && a3 == 1)) || ((a25 == 13 && a23 <= 306) && (140 < a29 && a4 == 1) && !(a25 == 10))) || (a29 <= 599998 && (((a29 <= 277 && a8 == 15 && (a4 <= 0 && a23 + 127600 <= 0 && a25 == 12) && 245 < a29) && a3 == 1) || (((((a25 == 9 && a8 == 15) && a4 <= 0) && (\exists v_prenex_58 : int :: (140 < v_prenex_58 && v_prenex_58 % 299861 + 10250 <= a29) && 0 == v_prenex_58 % 299861)) && a3 == 1) && a23 + 43 <= 0)))) || ((((a8 == 15 && a4 <= 0) && a23 <= 138) && a25 == 10 && a29 <= 140) && a3 == 1)) || ((((((a25 == 13 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a3 == 1) && a29 <= 599998)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && a25 == 9) && a23 <= 138) && a3 == 1)) || (((a25 == 13 && a29 <= 130) && 1 == a4) && a23 <= 262)) || ((a23 + 127600 <= 0 && a4 == 1) && a25 == 10)) || (((((a25 == 12 && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1) && (0 < a23 + 43 || 140 < a29))) || ((((((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138))) && a3 == 1) && a23 + 599908 <= 0) && 0 <= a23 + 599908) && a29 <= 245)) || ((a8 == 15 && a3 == 1) && (((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && 245 < a29)) || ((((((a25 == 13 && a8 == 15) && a29 <= 245) && 1 == a4) && a3 == 1) || ((a8 == 15 && ((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && 245 < a29) && a3 == 1)) && 140 < a29) [2019-01-12 03:44:46,346 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:44:46,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:44:46,348 INFO L168 Benchmark]: Toolchain (without parser) took 235968.99 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 940.6 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 355.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:46,349 INFO L168 Benchmark]: CDTParser took 0.17 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 03:44:46,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 950.98 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 892.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:46,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 341.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 892.3 MB in the beginning and 1.1 GB in the end (delta: -227.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:46,352 INFO L168 Benchmark]: Boogie Preprocessor took 157.31 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:46,352 INFO L168 Benchmark]: RCFGBuilder took 3892.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.9 MB in the end (delta: 170.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:46,352 INFO L168 Benchmark]: TraceAbstraction took 230325.11 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 935.1 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-12 03:44:46,355 INFO L168 Benchmark]: Witness Printer took 296.01 ms. Allocated memory is still 2.9 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:46,357 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.17 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 950.98 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 892.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 341.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 892.3 MB in the beginning and 1.1 GB in the end (delta: -227.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 157.31 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3892.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.9 MB in the end (delta: 170.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 230325.11 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 935.1 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 296.01 ms. Allocated memory is still 2.9 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 138]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-01-12 03:44:46,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,397 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,397 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,397 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,397 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((1 == a3 && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && 15 == a8) && 1 == a4) && a25 == 10) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0))) || (((((a25 == 11 && a23 <= 312) && a8 == 15) && (0 < a23 + 43 || 140 < a29)) && 1 == a4) && a3 == 1)) || (a23 <= 599997 && 140 < a29 && (((a25 == 9 && a8 == 15) && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) || (((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && a8 == 15)) && a3 == 1)) || (((((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138))) && a3 == 1) && a25 == 12) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 + 299882 <= (v_prenex_63 + 69157) % 299861) && 0 <= v_prenex_63 + 69157))) || (a25 == 9 && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) || (((((a8 == 15 && a4 <= 0) && a25 == 12 && 140 < a29) && a29 <= 274) && a3 == 1) && a23 <= 138)) || ((((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a23 <= 312) && a25 == 9) && a8 == 15)) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a25 == 10) && a3 == 1)) || (((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a8 == 15) && a23 <= 138)) || (((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && 260 <= a29)) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a3 == 1)) || (a23 <= 599997 && (a8 == 15 && ((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && a3 == 1)) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a25 == 11) && a3 == 1)) || ((a8 == 15 && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) && a23 <= 138)) || ((((a25 == 9 && a8 == 15) && ((140 < a29 && a4 == 1) && !(a25 == 10)) && 245 < a29) || ((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && 260 <= a29)) && a3 == 1)) || ((((((15 == a8 && 1 == a4) && a23 <= 599997) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 <= (v_prenex_63 + 69157) % 299861 + 300138) && 0 <= v_prenex_63 + 69157)) && !(a25 == 11)) && 306 < a23) && a3 == 1)) || ((a25 == 13 && a23 <= 306) && (140 < a29 && a4 == 1) && !(a25 == 10))) || (a29 <= 599998 && (((a29 <= 277 && a8 == 15 && (a4 <= 0 && a23 + 127600 <= 0 && a25 == 12) && 245 < a29) && a3 == 1) || (((((a25 == 9 && a8 == 15) && a4 <= 0) && (\exists v_prenex_58 : int :: (140 < v_prenex_58 && v_prenex_58 % 299861 + 10250 <= a29) && 0 == v_prenex_58 % 299861)) && a3 == 1) && a23 + 43 <= 0)))) || ((((a8 == 15 && a4 <= 0) && a23 <= 138) && a25 == 10 && a29 <= 140) && a3 == 1)) || ((((((a25 == 13 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a3 == 1) && a29 <= 599998)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && a25 == 9) && a23 <= 138) && a3 == 1)) || (((a25 == 13 && a29 <= 130) && 1 == a4) && a23 <= 262)) || ((a23 + 127600 <= 0 && a4 == 1) && a25 == 10)) || (((((a25 == 12 && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1) && (0 < a23 + 43 || 140 < a29))) || ((((((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138))) && a3 == 1) && a23 + 599908 <= 0) && 0 <= a23 + 599908) && a29 <= 245)) || ((a8 == 15 && a3 == 1) && (((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && 245 < a29)) || ((((((a25 == 13 && a8 == 15) && a29 <= 245) && 1 == a4) && a3 == 1) || ((a8 == 15 && ((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && 245 < a29) && a3 == 1)) && 140 < a29) - InvariantResult [Line: 22]: Loop Invariant [2019-01-12 03:44:46,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,490 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,528 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_63,QUANTIFIED] [2019-01-12 03:44:46,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_58,QUANTIFIED] [2019-01-12 03:44:46,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] [2019-01-12 03:44:46,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_39,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((1 == a3 && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && 15 == a8) && 1 == a4) && a25 == 10) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0))) || (((((a25 == 11 && a23 <= 312) && a8 == 15) && (0 < a23 + 43 || 140 < a29)) && 1 == a4) && a3 == 1)) || (a23 <= 599997 && 140 < a29 && (((a25 == 9 && a8 == 15) && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) || (((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && a8 == 15)) && a3 == 1)) || (((((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138))) && a3 == 1) && a25 == 12) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 + 299882 <= (v_prenex_63 + 69157) % 299861) && 0 <= v_prenex_63 + 69157))) || (a25 == 9 && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138)))) || (((((a8 == 15 && a4 <= 0) && a25 == 12 && 140 < a29) && a29 <= 274) && a3 == 1) && a23 <= 138)) || ((((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a23 <= 312) && a25 == 9) && a8 == 15)) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a25 == 10) && a3 == 1)) || (((((a29 <= 130 && (0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && 1 == a4) || ((((0 < a23 + 43 && !(a25 == 13) && a29 <= 140) && !(a25 == 10)) && !(a25 == 12)) && 1 == a4)) && a8 == 15) && a23 <= 138)) || (((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && 260 <= a29)) || ((a8 == 15 && 245 < a29 && a25 == 11 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a3 == 1)) || (a23 <= 599997 && (a8 == 15 && ((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && a3 == 1)) || (((((a8 == 15 && a4 <= 0) && a29 <= 599998) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a25 == 11) && a3 == 1)) || ((a8 == 15 && (((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && !(a25 == 12)) && a29 <= 277) && 1 == a4) && a23 <= 138)) || ((((a25 == 9 && a8 == 15) && ((140 < a29 && a4 == 1) && !(a25 == 10)) && 245 < a29) || ((((((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a25 == 9) && 306 < a23) && a3 == 1) || (a4 == 1 && a25 == 10)) && a8 == 15) && 260 <= a29)) && a3 == 1)) || ((((((15 == a8 && 1 == a4) && a23 <= 599997) && (\exists v_prenex_63 : int :: (130 <= v_prenex_63 && a29 <= (v_prenex_63 + 69157) % 299861 + 300138) && 0 <= v_prenex_63 + 69157)) && !(a25 == 11)) && 306 < a23) && a3 == 1)) || ((a25 == 13 && a23 <= 306) && (140 < a29 && a4 == 1) && !(a25 == 10))) || (a29 <= 599998 && (((a29 <= 277 && a8 == 15 && (a4 <= 0 && a23 + 127600 <= 0 && a25 == 12) && 245 < a29) && a3 == 1) || (((((a25 == 9 && a8 == 15) && a4 <= 0) && (\exists v_prenex_58 : int :: (140 < v_prenex_58 && v_prenex_58 % 299861 + 10250 <= a29) && 0 == v_prenex_58 % 299861)) && a3 == 1) && a23 + 43 <= 0)))) || ((((a8 == 15 && a4 <= 0) && a23 <= 138) && a25 == 10 && a29 <= 140) && a3 == 1)) || ((((((a25 == 13 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && (\exists v_prenex_39 : int :: ((((((v_prenex_39 / 5 < 54476 && !(v_prenex_39 % 5 == 0)) && !((v_prenex_39 / 5 + 4) % 5 == 0)) && a23 <= ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90 + 119) && v_prenex_39 < 0) && 0 == ((v_prenex_39 / 5 + -54476) / 5 + 1) % 90) && v_prenex_39 + 43 <= 0) && v_prenex_39 + 599992 <= 0)) && a3 == 1) && a29 <= 599998)) || (((((a25 == 12 && a8 == 15) && a4 <= 0) && ((!(3 == input) || 0 < a23 + 43) || 140 < a29)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && a25 == 9) && a23 <= 138) && a3 == 1)) || (((a25 == 13 && a29 <= 130) && 1 == a4) && a23 <= 262)) || ((a23 + 127600 <= 0 && a4 == 1) && a25 == 10)) || (((((a25 == 12 && a23 <= 312) && a8 == 15) && a4 == 1) && a3 == 1) && (0 < a23 + 43 || 140 < a29))) || ((((((!(a25 == 11) && a29 <= 274) && (((((!(a25 == 13) && a4 == 1) && !(a25 == 10)) && a8 == 15) && a23 <= 138) || ((a8 == 15 && (140 < a29 && a4 == 1) && !(a25 == 10)) && a23 <= 138))) && a3 == 1) && a23 + 599908 <= 0) && 0 <= a23 + 599908) && a29 <= 245)) || ((a8 == 15 && a3 == 1) && (((((((0 < a23 + 43 && !(a25 == 13)) && !(a25 == 10)) && 140 < a29) && a25 == 11) || (((a8 == 15 && 140 < a29) && a25 == 12 && 306 < a23) && a3 == 1)) && a29 <= 277) && 1 == a4) && 245 < a29)) || ((((((a25 == 13 && a8 == 15) && a29 <= 245) && 1 == a4) && a3 == 1) || ((a8 == 15 && ((((0 < a23 + 43 && a25 == 10) || ((a25 == 9 && a8 == 15) && 306 < a23)) && a29 <= 277) && 1 == a4) && 245 < a29) && a3 == 1)) && 140 < a29) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 230.0s OverallTime, 24 OverallIterations, 8 TraceHistogramMax, 140.7s AutomataDifference, 0.0s DeadEndRemovalTime, 37.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2911 SDtfs, 20482 SDslu, 1618 SDs, 0 SdLazy, 53570 SolverSat, 6370 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 122.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5915 GetRequests, 5739 SyntacticMatches, 13 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12759occurred in iteration=13, 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: 3.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 48793 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 240 NumberOfFragments, 3011 HoareAnnotationTreeSize, 3 FomulaSimplifications, 27146884 FormulaSimplificationTreeSizeReduction, 7.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 12010170 FormulaSimplificationTreeSizeReductionInter, 29.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 40.2s InterpolantComputationTime, 15516 NumberOfCodeBlocks, 15516 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 15481 ConstructedInterpolants, 1206 QuantifiedInterpolants, 47420111 SizeOfPredicates, 14 NumberOfNonLiveVariables, 7367 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 35 InterpolantComputations, 14 PerfectInterpolantSequences, 19732/24139 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...