./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label11_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem11_label11_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 7958494c6199e982ad9ca9c80defa7dd09ad4867 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 22:27:10,112 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 22:27:10,114 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 22:27:10,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 22:27:10,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 22:27:10,130 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 22:27:10,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 22:27:10,133 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 22:27:10,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 22:27:10,136 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 22:27:10,137 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 22:27:10,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 22:27:10,138 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 22:27:10,140 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 22:27:10,141 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 22:27:10,142 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 22:27:10,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 22:27:10,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 22:27:10,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 22:27:10,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 22:27:10,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 22:27:10,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 22:27:10,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 22:27:10,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 22:27:10,156 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 22:27:10,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 22:27:10,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 22:27:10,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 22:27:10,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 22:27:10,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 22:27:10,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 22:27:10,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 22:27:10,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 22:27:10,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 22:27:10,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 22:27:10,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 22:27:10,166 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 22:27:10,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 22:27:10,186 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 22:27:10,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 22:27:10,188 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 22:27:10,188 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 22:27:10,190 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 22:27:10,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 22:27:10,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 22:27:10,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 22:27:10,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 22:27:10,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 22:27:10,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 22:27:10,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 22:27:10,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 22:27:10,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 22:27:10,193 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 22:27:10,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 22:27:10,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 22:27:10,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 22:27:10,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 22:27:10,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 22:27:10,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 22:27:10,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 22:27:10,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 22:27:10,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 22:27:10,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 22:27:10,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 22:27:10,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 22:27:10,198 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 -> 7958494c6199e982ad9ca9c80defa7dd09ad4867 [2018-12-30 22:27:10,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 22:27:10,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 22:27:10,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 22:27:10,284 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 22:27:10,285 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 22:27:10,286 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label11_true-unreach-call.c [2018-12-30 22:27:10,364 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7815df987/e5fa30e4931c415aa3ab0ba65b9ec13d/FLAGc8659536c [2018-12-30 22:27:11,080 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 22:27:11,081 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label11_true-unreach-call.c [2018-12-30 22:27:11,099 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7815df987/e5fa30e4931c415aa3ab0ba65b9ec13d/FLAGc8659536c [2018-12-30 22:27:11,267 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7815df987/e5fa30e4931c415aa3ab0ba65b9ec13d [2018-12-30 22:27:11,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 22:27:11,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 22:27:11,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 22:27:11,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 22:27:11,281 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 22:27:11,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 10:27:11" (1/1) ... [2018-12-30 22:27:11,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c82d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:11, skipping insertion in model container [2018-12-30 22:27:11,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 10:27:11" (1/1) ... [2018-12-30 22:27:11,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 22:27:11,378 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 22:27:12,077 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 22:27:12,086 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 22:27:12,314 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 22:27:12,342 INFO L195 MainTranslator]: Completed translation [2018-12-30 22:27:12,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12 WrapperNode [2018-12-30 22:27:12,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 22:27:12,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 22:27:12,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 22:27:12,345 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 22:27:12,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... [2018-12-30 22:27:12,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... [2018-12-30 22:27:12,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 22:27:12,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 22:27:12,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 22:27:12,653 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 22:27:12,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... [2018-12-30 22:27:12,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... [2018-12-30 22:27:12,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... [2018-12-30 22:27:12,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... [2018-12-30 22:27:12,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... [2018-12-30 22:27:12,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... [2018-12-30 22:27:12,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... [2018-12-30 22:27:12,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 22:27:12,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 22:27:12,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 22:27:12,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 22:27:12,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 22:27:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 22:27:12,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 22:27:17,081 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 22:27:17,081 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 22:27:17,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:27:17 BoogieIcfgContainer [2018-12-30 22:27:17,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 22:27:17,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 22:27:17,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 22:27:17,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 22:27:17,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 10:27:11" (1/3) ... [2018-12-30 22:27:17,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5224a97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 10:27:17, skipping insertion in model container [2018-12-30 22:27:17,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 10:27:12" (2/3) ... [2018-12-30 22:27:17,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5224a97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 10:27:17, skipping insertion in model container [2018-12-30 22:27:17,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:27:17" (3/3) ... [2018-12-30 22:27:17,091 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label11_true-unreach-call.c [2018-12-30 22:27:17,101 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 22:27:17,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 22:27:17,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 22:27:17,170 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 22:27:17,170 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 22:27:17,170 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 22:27:17,171 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 22:27:17,171 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 22:27:17,171 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 22:27:17,171 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 22:27:17,171 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 22:27:17,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 22:27:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2018-12-30 22:27:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-30 22:27:17,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:17,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:27:17,213 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2018-12-30 22:27:17,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:17,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:17,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:17,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:17,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:27:17,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:27:17,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:27:17,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:27:17,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:27:17,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:27:17,778 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2018-12-30 22:27:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:27:21,381 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2018-12-30 22:27:21,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:27:21,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-30 22:27:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:27:21,406 INFO L225 Difference]: With dead ends: 973 [2018-12-30 22:27:21,406 INFO L226 Difference]: Without dead ends: 607 [2018-12-30 22:27:21,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:27:21,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-12-30 22:27:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2018-12-30 22:27:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-30 22:27:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2018-12-30 22:27:21,502 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 61 [2018-12-30 22:27:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:27:21,504 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2018-12-30 22:27:21,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:27:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2018-12-30 22:27:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-30 22:27:21,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:21,515 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:27:21,516 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:21,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:21,517 INFO L82 PathProgramCache]: Analyzing trace with hash -50014000, now seen corresponding path program 1 times [2018-12-30 22:27:21,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:21,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:21,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:21,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:21,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:27:21,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:27:21,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:27:21,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:27:21,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:27:21,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:27:21,790 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2018-12-30 22:27:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:27:24,355 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2018-12-30 22:27:24,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:27:24,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-30 22:27:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:27:24,366 INFO L225 Difference]: With dead ends: 2328 [2018-12-30 22:27:24,366 INFO L226 Difference]: Without dead ends: 1726 [2018-12-30 22:27:24,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:27:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-12-30 22:27:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2018-12-30 22:27:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2018-12-30 22:27:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2341 transitions. [2018-12-30 22:27:24,436 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2341 transitions. Word has length 129 [2018-12-30 22:27:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:27:24,436 INFO L480 AbstractCegarLoop]: Abstraction has 1710 states and 2341 transitions. [2018-12-30 22:27:24,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:27:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2341 transitions. [2018-12-30 22:27:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-30 22:27:24,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:24,443 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:27:24,444 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:24,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2032903069, now seen corresponding path program 1 times [2018-12-30 22:27:24,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:24,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:24,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:24,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:27:24,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:27:24,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 22:27:24,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:27:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:27:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:27:24,663 INFO L87 Difference]: Start difference. First operand 1710 states and 2341 transitions. Second operand 3 states. [2018-12-30 22:27:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:27:27,276 INFO L93 Difference]: Finished difference Result 4707 states and 6451 transitions. [2018-12-30 22:27:27,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:27:27,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2018-12-30 22:27:27,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:27:27,293 INFO L225 Difference]: With dead ends: 4707 [2018-12-30 22:27:27,293 INFO L226 Difference]: Without dead ends: 2999 [2018-12-30 22:27:27,296 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 [2018-12-30 22:27:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2018-12-30 22:27:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2018-12-30 22:27:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-12-30 22:27:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3733 transitions. [2018-12-30 22:27:27,354 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3733 transitions. Word has length 171 [2018-12-30 22:27:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:27:27,354 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 3733 transitions. [2018-12-30 22:27:27,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:27:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3733 transitions. [2018-12-30 22:27:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-30 22:27:27,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:27,358 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:27:27,358 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:27,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:27,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1226033499, now seen corresponding path program 1 times [2018-12-30 22:27:27,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:27,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:27,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:27,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:27,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-30 22:27:27,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:27:27,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:27:27,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:27,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:27:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-30 22:27:27,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:27:27,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-12-30 22:27:27,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:27:27,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:27:27,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:27:27,900 INFO L87 Difference]: Start difference. First operand 2999 states and 3733 transitions. Second operand 4 states. [2018-12-30 22:27:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:27:30,899 INFO L93 Difference]: Finished difference Result 9866 states and 12115 transitions. [2018-12-30 22:27:30,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:27:30,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-12-30 22:27:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:27:30,932 INFO L225 Difference]: With dead ends: 9866 [2018-12-30 22:27:30,932 INFO L226 Difference]: Without dead ends: 6869 [2018-12-30 22:27:30,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:27:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2018-12-30 22:27:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 6316. [2018-12-30 22:27:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2018-12-30 22:27:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 7608 transitions. [2018-12-30 22:27:31,054 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 7608 transitions. Word has length 183 [2018-12-30 22:27:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:27:31,055 INFO L480 AbstractCegarLoop]: Abstraction has 6316 states and 7608 transitions. [2018-12-30 22:27:31,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:27:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 7608 transitions. [2018-12-30 22:27:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-30 22:27:31,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:31,058 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:27:31,058 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:31,059 INFO L82 PathProgramCache]: Analyzing trace with hash -570673419, now seen corresponding path program 1 times [2018-12-30 22:27:31,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:31,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:31,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:31,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:31,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:27:31,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:27:31,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:27:31,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:27:31,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:27:31,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:27:31,447 INFO L87 Difference]: Start difference. First operand 6316 states and 7608 transitions. Second operand 4 states. [2018-12-30 22:27:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:27:34,901 INFO L93 Difference]: Finished difference Result 16142 states and 19602 transitions. [2018-12-30 22:27:34,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:27:34,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-12-30 22:27:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:27:34,940 INFO L225 Difference]: With dead ends: 16142 [2018-12-30 22:27:34,940 INFO L226 Difference]: Without dead ends: 10012 [2018-12-30 22:27:34,948 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 [2018-12-30 22:27:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10012 states. [2018-12-30 22:27:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10012 to 8524. [2018-12-30 22:27:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8524 states. [2018-12-30 22:27:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8524 states to 8524 states and 10181 transitions. [2018-12-30 22:27:35,096 INFO L78 Accepts]: Start accepts. Automaton has 8524 states and 10181 transitions. Word has length 188 [2018-12-30 22:27:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:27:35,097 INFO L480 AbstractCegarLoop]: Abstraction has 8524 states and 10181 transitions. [2018-12-30 22:27:35,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:27:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8524 states and 10181 transitions. [2018-12-30 22:27:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-12-30 22:27:35,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:35,109 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 22:27:35,109 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash 94013981, now seen corresponding path program 1 times [2018-12-30 22:27:35,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:35,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:35,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:35,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:35,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:27:35,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:27:35,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:27:35,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:27:35,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:27:35,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:27:35,668 INFO L87 Difference]: Start difference. First operand 8524 states and 10181 transitions. Second operand 5 states. [2018-12-30 22:27:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:27:38,220 INFO L93 Difference]: Finished difference Result 24247 states and 29091 transitions. [2018-12-30 22:27:38,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 22:27:38,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 321 [2018-12-30 22:27:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:27:38,365 INFO L225 Difference]: With dead ends: 24247 [2018-12-30 22:27:38,365 INFO L226 Difference]: Without dead ends: 15173 [2018-12-30 22:27:38,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:27:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15173 states. [2018-12-30 22:27:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15173 to 12765. [2018-12-30 22:27:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12765 states. [2018-12-30 22:27:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12765 states to 12765 states and 14653 transitions. [2018-12-30 22:27:38,562 INFO L78 Accepts]: Start accepts. Automaton has 12765 states and 14653 transitions. Word has length 321 [2018-12-30 22:27:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:27:38,563 INFO L480 AbstractCegarLoop]: Abstraction has 12765 states and 14653 transitions. [2018-12-30 22:27:38,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:27:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 12765 states and 14653 transitions. [2018-12-30 22:27:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-12-30 22:27:38,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:38,584 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2018-12-30 22:27:38,585 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:38,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash -258687416, now seen corresponding path program 1 times [2018-12-30 22:27:38,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:38,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:38,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:38,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:38,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-12-30 22:27:38,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:27:38,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:27:38,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:27:38,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:27:38,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:27:38,930 INFO L87 Difference]: Start difference. First operand 12765 states and 14653 transitions. Second operand 4 states. [2018-12-30 22:27:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:27:41,621 INFO L93 Difference]: Finished difference Result 27202 states and 31250 transitions. [2018-12-30 22:27:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:27:41,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2018-12-30 22:27:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:27:41,658 INFO L225 Difference]: With dead ends: 27202 [2018-12-30 22:27:41,658 INFO L226 Difference]: Without dead ends: 14623 [2018-12-30 22:27:41,671 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 [2018-12-30 22:27:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14623 states. [2018-12-30 22:27:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14623 to 12580. [2018-12-30 22:27:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12580 states. [2018-12-30 22:27:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 14185 transitions. [2018-12-30 22:27:41,843 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 14185 transitions. Word has length 389 [2018-12-30 22:27:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:27:41,844 INFO L480 AbstractCegarLoop]: Abstraction has 12580 states and 14185 transitions. [2018-12-30 22:27:41,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:27:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 14185 transitions. [2018-12-30 22:27:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-12-30 22:27:41,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:41,868 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:27:41,868 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:41,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1552606349, now seen corresponding path program 1 times [2018-12-30 22:27:41,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:41,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:41,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:41,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:41,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 327 proven. 102 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-12-30 22:27:42,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:27:42,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:27:42,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:42,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:27:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 327 proven. 102 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-12-30 22:27:42,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:27:42,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-30 22:27:42,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:27:42,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:27:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:27:42,618 INFO L87 Difference]: Start difference. First operand 12580 states and 14185 transitions. Second operand 5 states. [2018-12-30 22:27:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:27:46,038 INFO L93 Difference]: Finished difference Result 32162 states and 36513 transitions. [2018-12-30 22:27:46,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 22:27:46,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 401 [2018-12-30 22:27:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:27:46,065 INFO L225 Difference]: With dead ends: 32162 [2018-12-30 22:27:46,065 INFO L226 Difference]: Without dead ends: 19952 [2018-12-30 22:27:46,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-30 22:27:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19952 states. [2018-12-30 22:27:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19952 to 13679. [2018-12-30 22:27:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13679 states. [2018-12-30 22:27:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13679 states to 13679 states and 15483 transitions. [2018-12-30 22:27:46,313 INFO L78 Accepts]: Start accepts. Automaton has 13679 states and 15483 transitions. Word has length 401 [2018-12-30 22:27:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:27:46,314 INFO L480 AbstractCegarLoop]: Abstraction has 13679 states and 15483 transitions. [2018-12-30 22:27:46,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:27:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 13679 states and 15483 transitions. [2018-12-30 22:27:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-12-30 22:27:46,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:46,338 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:27:46,339 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:46,339 INFO L82 PathProgramCache]: Analyzing trace with hash -284474862, now seen corresponding path program 1 times [2018-12-30 22:27:46,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:46,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:46,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:46,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:46,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:46,887 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-30 22:27:47,381 WARN L181 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-12-30 22:27:47,861 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2018-12-30 22:27:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 277 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:27:48,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:27:48,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:27:48,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:48,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:27:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 277 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 22:27:49,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:27:49,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2018-12-30 22:27:49,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-30 22:27:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-30 22:27:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-30 22:27:49,294 INFO L87 Difference]: Start difference. First operand 13679 states and 15483 transitions. Second operand 12 states. [2018-12-30 22:27:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:27:56,751 INFO L93 Difference]: Finished difference Result 32463 states and 36702 transitions. [2018-12-30 22:27:56,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-30 22:27:56,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 424 [2018-12-30 22:27:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:27:56,773 INFO L225 Difference]: With dead ends: 32463 [2018-12-30 22:27:56,773 INFO L226 Difference]: Without dead ends: 19154 [2018-12-30 22:27:56,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 420 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2018-12-30 22:27:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2018-12-30 22:27:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 13853. [2018-12-30 22:27:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13853 states. [2018-12-30 22:27:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 15126 transitions. [2018-12-30 22:27:57,024 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 15126 transitions. Word has length 424 [2018-12-30 22:27:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:27:57,025 INFO L480 AbstractCegarLoop]: Abstraction has 13853 states and 15126 transitions. [2018-12-30 22:27:57,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-30 22:27:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 15126 transitions. [2018-12-30 22:27:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-12-30 22:27:57,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:27:57,059 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-12-30 22:27:57,059 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:27:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:27:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1134199501, now seen corresponding path program 1 times [2018-12-30 22:27:57,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:27:57,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:27:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:57,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:27:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:27:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:27:57,858 WARN L181 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-12-30 22:27:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-30 22:27:58,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:27:58,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:27:58,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:27:58,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:27:58,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:27:58,190 INFO L87 Difference]: Start difference. First operand 13853 states and 15126 transitions. Second operand 4 states. [2018-12-30 22:28:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:28:00,791 INFO L93 Difference]: Finished difference Result 28632 states and 31278 transitions. [2018-12-30 22:28:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:28:00,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 535 [2018-12-30 22:28:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:28:00,808 INFO L225 Difference]: With dead ends: 28632 [2018-12-30 22:28:00,808 INFO L226 Difference]: Without dead ends: 15887 [2018-12-30 22:28:00,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:28:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15887 states. [2018-12-30 22:28:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15887 to 14589. [2018-12-30 22:28:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14589 states. [2018-12-30 22:28:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14589 states to 14589 states and 15878 transitions. [2018-12-30 22:28:01,023 INFO L78 Accepts]: Start accepts. Automaton has 14589 states and 15878 transitions. Word has length 535 [2018-12-30 22:28:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:28:01,024 INFO L480 AbstractCegarLoop]: Abstraction has 14589 states and 15878 transitions. [2018-12-30 22:28:01,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:28:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 14589 states and 15878 transitions. [2018-12-30 22:28:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-12-30 22:28:01,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:28:01,046 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-12-30 22:28:01,047 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:28:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:28:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash -187460572, now seen corresponding path program 1 times [2018-12-30 22:28:01,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:28:01,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:28:01,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:01,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:01,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2018-12-30 22:28:01,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:28:01,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:28:01,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:28:01,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:28:01,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:28:01,503 INFO L87 Difference]: Start difference. First operand 14589 states and 15878 transitions. Second operand 3 states. [2018-12-30 22:28:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:28:02,599 INFO L93 Difference]: Finished difference Result 28805 states and 31336 transitions. [2018-12-30 22:28:02,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:28:02,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 549 [2018-12-30 22:28:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:28:02,613 INFO L225 Difference]: With dead ends: 28805 [2018-12-30 22:28:02,613 INFO L226 Difference]: Without dead ends: 13666 [2018-12-30 22:28:02,623 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 [2018-12-30 22:28:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13666 states. [2018-12-30 22:28:02,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13666 to 13666. [2018-12-30 22:28:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13666 states. [2018-12-30 22:28:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13666 states to 13666 states and 14672 transitions. [2018-12-30 22:28:03,005 INFO L78 Accepts]: Start accepts. Automaton has 13666 states and 14672 transitions. Word has length 549 [2018-12-30 22:28:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:28:03,006 INFO L480 AbstractCegarLoop]: Abstraction has 13666 states and 14672 transitions. [2018-12-30 22:28:03,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:28:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 13666 states and 14672 transitions. [2018-12-30 22:28:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-12-30 22:28:03,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:28:03,025 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:28:03,025 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:28:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:28:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1300429429, now seen corresponding path program 1 times [2018-12-30 22:28:03,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:28:03,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:28:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:03,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:03,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 773 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-12-30 22:28:03,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:28:03,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:28:03,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:03,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:28:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2018-12-30 22:28:04,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:28:04,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-12-30 22:28:04,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:28:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:28:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:28:04,308 INFO L87 Difference]: Start difference. First operand 13666 states and 14672 transitions. Second operand 4 states. [2018-12-30 22:28:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:28:06,107 INFO L93 Difference]: Finished difference Result 26406 states and 28333 transitions. [2018-12-30 22:28:06,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:28:06,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 647 [2018-12-30 22:28:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:28:06,121 INFO L225 Difference]: With dead ends: 26406 [2018-12-30 22:28:06,121 INFO L226 Difference]: Without dead ends: 13848 [2018-12-30 22:28:06,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:28:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13848 states. [2018-12-30 22:28:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13848 to 13661. [2018-12-30 22:28:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13661 states. [2018-12-30 22:28:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13661 states to 13661 states and 14657 transitions. [2018-12-30 22:28:06,304 INFO L78 Accepts]: Start accepts. Automaton has 13661 states and 14657 transitions. Word has length 647 [2018-12-30 22:28:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:28:06,305 INFO L480 AbstractCegarLoop]: Abstraction has 13661 states and 14657 transitions. [2018-12-30 22:28:06,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:28:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 13661 states and 14657 transitions. [2018-12-30 22:28:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2018-12-30 22:28:06,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:28:06,327 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 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] [2018-12-30 22:28:06,327 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:28:06,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:28:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1991250711, now seen corresponding path program 1 times [2018-12-30 22:28:06,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:28:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:28:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:06,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 584 proven. 440 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-12-30 22:28:08,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:28:08,076 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:28:08,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:08,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:28:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 577 proven. 122 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2018-12-30 22:28:09,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:28:09,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2018-12-30 22:28:09,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 22:28:09,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 22:28:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:28:09,277 INFO L87 Difference]: Start difference. First operand 13661 states and 14657 transitions. Second operand 8 states. [2018-12-30 22:28:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:28:11,788 INFO L93 Difference]: Finished difference Result 26600 states and 28507 transitions. [2018-12-30 22:28:11,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 22:28:11,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 658 [2018-12-30 22:28:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:28:11,802 INFO L225 Difference]: With dead ends: 26600 [2018-12-30 22:28:11,802 INFO L226 Difference]: Without dead ends: 14047 [2018-12-30 22:28:11,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 655 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-12-30 22:28:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14047 states. [2018-12-30 22:28:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14047 to 13477. [2018-12-30 22:28:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13477 states. [2018-12-30 22:28:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 14456 transitions. [2018-12-30 22:28:11,995 INFO L78 Accepts]: Start accepts. Automaton has 13477 states and 14456 transitions. Word has length 658 [2018-12-30 22:28:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:28:11,995 INFO L480 AbstractCegarLoop]: Abstraction has 13477 states and 14456 transitions. [2018-12-30 22:28:11,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 22:28:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 13477 states and 14456 transitions. [2018-12-30 22:28:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-12-30 22:28:12,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:28:12,011 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:28:12,011 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:28:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:28:12,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1728529722, now seen corresponding path program 1 times [2018-12-30 22:28:12,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:28:12,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:28:12,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:12,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:12,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:12,970 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-12-30 22:28:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 584 proven. 439 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2018-12-30 22:28:14,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:28:14,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:28:14,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:14,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:28:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 663 proven. 36 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2018-12-30 22:28:15,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:28:15,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2018-12-30 22:28:15,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 22:28:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 22:28:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:28:15,225 INFO L87 Difference]: Start difference. First operand 13477 states and 14456 transitions. Second operand 9 states. [2018-12-30 22:28:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:28:18,161 INFO L93 Difference]: Finished difference Result 26411 states and 28289 transitions. [2018-12-30 22:28:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 22:28:18,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 659 [2018-12-30 22:28:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:28:18,176 INFO L225 Difference]: With dead ends: 26411 [2018-12-30 22:28:18,176 INFO L226 Difference]: Without dead ends: 14042 [2018-12-30 22:28:18,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 657 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-12-30 22:28:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14042 states. [2018-12-30 22:28:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14042 to 13475. [2018-12-30 22:28:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13475 states. [2018-12-30 22:28:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 14441 transitions. [2018-12-30 22:28:18,361 INFO L78 Accepts]: Start accepts. Automaton has 13475 states and 14441 transitions. Word has length 659 [2018-12-30 22:28:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:28:18,362 INFO L480 AbstractCegarLoop]: Abstraction has 13475 states and 14441 transitions. [2018-12-30 22:28:18,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 22:28:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 13475 states and 14441 transitions. [2018-12-30 22:28:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2018-12-30 22:28:18,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:28:18,379 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:28:18,379 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:28:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:28:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1191977518, now seen corresponding path program 1 times [2018-12-30 22:28:18,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:28:18,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:28:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:18,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:18,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1878 backedges. 1269 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-12-30 22:28:19,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:28:19,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:28:19,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:28:19,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:28:19,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:28:19,198 INFO L87 Difference]: Start difference. First operand 13475 states and 14441 transitions. Second operand 3 states. [2018-12-30 22:28:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:28:21,497 INFO L93 Difference]: Finished difference Result 26765 states and 28644 transitions. [2018-12-30 22:28:21,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:28:21,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2018-12-30 22:28:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:28:21,514 INFO L225 Difference]: With dead ends: 26765 [2018-12-30 22:28:21,514 INFO L226 Difference]: Without dead ends: 14030 [2018-12-30 22:28:21,524 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 [2018-12-30 22:28:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14030 states. [2018-12-30 22:28:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14030 to 12923. [2018-12-30 22:28:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12923 states. [2018-12-30 22:28:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12923 states to 12923 states and 13828 transitions. [2018-12-30 22:28:21,680 INFO L78 Accepts]: Start accepts. Automaton has 12923 states and 13828 transitions. Word has length 717 [2018-12-30 22:28:21,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:28:21,681 INFO L480 AbstractCegarLoop]: Abstraction has 12923 states and 13828 transitions. [2018-12-30 22:28:21,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:28:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 12923 states and 13828 transitions. [2018-12-30 22:28:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2018-12-30 22:28:21,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:28:21,695 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:28:21,695 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:28:21,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:28:21,695 INFO L82 PathProgramCache]: Analyzing trace with hash -856846528, now seen corresponding path program 1 times [2018-12-30 22:28:21,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:28:21,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:28:21,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:21,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:21,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:22,390 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-30 22:28:23,079 WARN L181 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 18 [2018-12-30 22:28:23,263 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-12-30 22:28:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1882 backedges. 377 proven. 495 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2018-12-30 22:28:24,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:28:24,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:28:24,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:24,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:28:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1882 backedges. 707 proven. 165 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2018-12-30 22:28:26,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:28:26,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-12-30 22:28:26,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 22:28:26,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 22:28:26,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:28:26,020 INFO L87 Difference]: Start difference. First operand 12923 states and 13828 transitions. Second operand 9 states. [2018-12-30 22:28:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:28:28,539 INFO L93 Difference]: Finished difference Result 25300 states and 27033 transitions. [2018-12-30 22:28:28,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 22:28:28,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 718 [2018-12-30 22:28:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:28:28,561 INFO L225 Difference]: With dead ends: 25300 [2018-12-30 22:28:28,561 INFO L226 Difference]: Without dead ends: 13485 [2018-12-30 22:28:28,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-30 22:28:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13485 states. [2018-12-30 22:28:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13485 to 12923. [2018-12-30 22:28:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12923 states. [2018-12-30 22:28:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12923 states to 12923 states and 13822 transitions. [2018-12-30 22:28:28,734 INFO L78 Accepts]: Start accepts. Automaton has 12923 states and 13822 transitions. Word has length 718 [2018-12-30 22:28:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:28:28,735 INFO L480 AbstractCegarLoop]: Abstraction has 12923 states and 13822 transitions. [2018-12-30 22:28:28,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 22:28:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 12923 states and 13822 transitions. [2018-12-30 22:28:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2018-12-30 22:28:28,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:28:28,754 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:28:28,755 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:28:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:28:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1612885747, now seen corresponding path program 1 times [2018-12-30 22:28:28,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:28:28,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:28:28,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:28,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:28,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:28:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:29,329 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-30 22:28:29,762 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-12-30 22:28:30,195 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-12-30 22:28:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 1133 proven. 111 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-30 22:28:31,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:28:31,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:28:31,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:28:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:28:31,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:28:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 1481 proven. 405 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2018-12-30 22:28:33,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:28:33,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2018-12-30 22:28:33,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-30 22:28:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-30 22:28:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-30 22:28:33,517 INFO L87 Difference]: Start difference. First operand 12923 states and 13822 transitions. Second operand 13 states. [2018-12-30 22:35:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:35:49,680 INFO L93 Difference]: Finished difference Result 40042 states and 42794 transitions. [2018-12-30 22:35:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-30 22:35:49,681 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 860 [2018-12-30 22:35:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:35:49,709 INFO L225 Difference]: With dead ends: 40042 [2018-12-30 22:35:49,709 INFO L226 Difference]: Without dead ends: 28227 [2018-12-30 22:35:49,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 857 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=642, Invalid=2327, Unknown=1, NotChecked=0, Total=2970 [2018-12-30 22:35:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2018-12-30 22:35:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 17164. [2018-12-30 22:35:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17164 states. [2018-12-30 22:35:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17164 states to 17164 states and 18353 transitions. [2018-12-30 22:35:50,001 INFO L78 Accepts]: Start accepts. Automaton has 17164 states and 18353 transitions. Word has length 860 [2018-12-30 22:35:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:35:50,002 INFO L480 AbstractCegarLoop]: Abstraction has 17164 states and 18353 transitions. [2018-12-30 22:35:50,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-30 22:35:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 17164 states and 18353 transitions. [2018-12-30 22:35:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2018-12-30 22:35:50,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:35:50,021 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, 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, 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, 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] [2018-12-30 22:35:50,021 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:35:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:35:50,023 INFO L82 PathProgramCache]: Analyzing trace with hash -550943215, now seen corresponding path program 1 times [2018-12-30 22:35:50,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:35:50,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:35:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:35:50,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:35:50,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:35:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:35:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 862 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2018-12-30 22:35:51,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:35:51,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 22:35:51,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 22:35:51,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 22:35:51,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 22:35:51,050 INFO L87 Difference]: Start difference. First operand 17164 states and 18353 transitions. Second operand 3 states. [2018-12-30 22:35:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:35:52,359 INFO L93 Difference]: Finished difference Result 33770 states and 36053 transitions. [2018-12-30 22:35:52,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 22:35:52,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 906 [2018-12-30 22:35:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:35:52,377 INFO L225 Difference]: With dead ends: 33770 [2018-12-30 22:35:52,377 INFO L226 Difference]: Without dead ends: 17530 [2018-12-30 22:35:52,388 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 [2018-12-30 22:35:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17530 states. [2018-12-30 22:35:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17530 to 14950. [2018-12-30 22:35:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14950 states. [2018-12-30 22:35:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14950 states to 14950 states and 15940 transitions. [2018-12-30 22:35:52,605 INFO L78 Accepts]: Start accepts. Automaton has 14950 states and 15940 transitions. Word has length 906 [2018-12-30 22:35:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:35:52,606 INFO L480 AbstractCegarLoop]: Abstraction has 14950 states and 15940 transitions. [2018-12-30 22:35:52,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 22:35:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 14950 states and 15940 transitions. [2018-12-30 22:35:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2018-12-30 22:35:52,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:35:52,626 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:35:52,627 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:35:52,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:35:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1186542856, now seen corresponding path program 1 times [2018-12-30 22:35:52,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:35:52,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:35:52,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:35:52,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:35:52,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:35:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:35:53,522 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 7 [2018-12-30 22:35:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 1956 proven. 989 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-12-30 22:35:54,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:35:54,397 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 [2018-12-30 22:35:54,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:35:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:35:54,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:35:54,912 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2018-12-30 22:35:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 2324 proven. 0 refuted. 0 times theorem prover too weak. 1243 trivial. 0 not checked. [2018-12-30 22:35:56,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:35:56,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-12-30 22:35:56,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 22:35:56,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 22:35:56,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:35:56,033 INFO L87 Difference]: Start difference. First operand 14950 states and 15940 transitions. Second operand 8 states. [2018-12-30 22:36:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:36:04,012 INFO L93 Difference]: Finished difference Result 37648 states and 40030 transitions. [2018-12-30 22:36:04,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-30 22:36:04,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1083 [2018-12-30 22:36:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:36:04,034 INFO L225 Difference]: With dead ends: 37648 [2018-12-30 22:36:04,034 INFO L226 Difference]: Without dead ends: 21596 [2018-12-30 22:36:04,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 1087 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-30 22:36:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21596 states. [2018-12-30 22:36:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21596 to 13298. [2018-12-30 22:36:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-30 22:36:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 14083 transitions. [2018-12-30 22:36:04,266 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 14083 transitions. Word has length 1083 [2018-12-30 22:36:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:36:04,267 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 14083 transitions. [2018-12-30 22:36:04,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 22:36:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 14083 transitions. [2018-12-30 22:36:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1099 [2018-12-30 22:36:04,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:36:04,283 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:36:04,283 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:36:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:36:04,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1145857182, now seen corresponding path program 1 times [2018-12-30 22:36:04,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:36:04,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:36:04,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:04,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:36:04,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:36:04,973 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-12-30 22:36:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4393 backedges. 2431 proven. 1267 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2018-12-30 22:36:06,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:36:06,035 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 [2018-12-30 22:36:06,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:36:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:36:06,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:36:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4393 backedges. 3472 proven. 0 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2018-12-30 22:36:08,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 22:36:08,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2018-12-30 22:36:08,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 22:36:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 22:36:08,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:36:08,890 INFO L87 Difference]: Start difference. First operand 13298 states and 14083 transitions. Second operand 9 states. [2018-12-30 22:36:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:36:13,223 INFO L93 Difference]: Finished difference Result 34507 states and 36542 transitions. [2018-12-30 22:36:13,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 22:36:13,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1098 [2018-12-30 22:36:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:36:13,244 INFO L225 Difference]: With dead ends: 34507 [2018-12-30 22:36:13,244 INFO L226 Difference]: Without dead ends: 21961 [2018-12-30 22:36:13,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1104 GetRequests, 1096 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-12-30 22:36:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21961 states. [2018-12-30 22:36:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21961 to 14946. [2018-12-30 22:36:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14946 states. [2018-12-30 22:36:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14946 states to 14946 states and 15824 transitions. [2018-12-30 22:36:13,519 INFO L78 Accepts]: Start accepts. Automaton has 14946 states and 15824 transitions. Word has length 1098 [2018-12-30 22:36:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:36:13,520 INFO L480 AbstractCegarLoop]: Abstraction has 14946 states and 15824 transitions. [2018-12-30 22:36:13,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 22:36:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 14946 states and 15824 transitions. [2018-12-30 22:36:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-12-30 22:36:13,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:36:13,537 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:36:13,539 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:36:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:36:13,539 INFO L82 PathProgramCache]: Analyzing trace with hash 772585210, now seen corresponding path program 1 times [2018-12-30 22:36:13,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:36:13,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:36:13,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:13,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:36:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:36:13,986 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-30 22:36:14,186 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2018-12-30 22:36:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4215 backedges. 1650 proven. 45 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-12-30 22:36:15,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:36:15,339 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 [2018-12-30 22:36:15,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:36:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:36:15,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:36:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4215 backedges. 1657 proven. 38 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-12-30 22:36:16,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:36:16,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-12-30 22:36:16,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 22:36:16,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 22:36:16,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:36:16,752 INFO L87 Difference]: Start difference. First operand 14946 states and 15824 transitions. Second operand 8 states. [2018-12-30 22:36:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:36:19,415 INFO L93 Difference]: Finished difference Result 29022 states and 30707 transitions. [2018-12-30 22:36:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-30 22:36:19,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1107 [2018-12-30 22:36:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:36:19,429 INFO L225 Difference]: With dead ends: 29022 [2018-12-30 22:36:19,429 INFO L226 Difference]: Without dead ends: 17028 [2018-12-30 22:36:19,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1118 GetRequests, 1104 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-12-30 22:36:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17028 states. [2018-12-30 22:36:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17028 to 15314. [2018-12-30 22:36:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15314 states. [2018-12-30 22:36:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15314 states to 15314 states and 16195 transitions. [2018-12-30 22:36:19,657 INFO L78 Accepts]: Start accepts. Automaton has 15314 states and 16195 transitions. Word has length 1107 [2018-12-30 22:36:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:36:19,658 INFO L480 AbstractCegarLoop]: Abstraction has 15314 states and 16195 transitions. [2018-12-30 22:36:19,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 22:36:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 15314 states and 16195 transitions. [2018-12-30 22:36:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1127 [2018-12-30 22:36:19,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:36:19,674 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:36:19,674 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:36:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:36:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash -33287460, now seen corresponding path program 1 times [2018-12-30 22:36:19,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:36:19,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:36:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:19,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:36:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:36:21,008 WARN L181 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 9 [2018-12-30 22:36:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4882 backedges. 2533 proven. 428 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2018-12-30 22:36:21,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:36:21,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:36:21,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:36:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:36:22,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:36:22,468 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 26 [2018-12-30 22:36:24,677 WARN L181 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 213 DAG size of output: 30 [2018-12-30 22:36:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4882 backedges. 3211 proven. 90 refuted. 0 times theorem prover too weak. 1581 trivial. 0 not checked. [2018-12-30 22:36:26,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:36:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-30 22:36:26,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 22:36:26,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 22:36:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-30 22:36:26,921 INFO L87 Difference]: Start difference. First operand 15314 states and 16195 transitions. Second operand 8 states. [2018-12-30 22:36:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:36:53,164 INFO L93 Difference]: Finished difference Result 27864 states and 29423 transitions. [2018-12-30 22:36:53,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-30 22:36:53,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1126 [2018-12-30 22:36:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:36:53,180 INFO L225 Difference]: With dead ends: 27864 [2018-12-30 22:36:53,180 INFO L226 Difference]: Without dead ends: 15502 [2018-12-30 22:36:53,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 1130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-30 22:36:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15502 states. [2018-12-30 22:36:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15502 to 10886. [2018-12-30 22:36:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10886 states. [2018-12-30 22:36:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10886 states to 10886 states and 11522 transitions. [2018-12-30 22:36:53,363 INFO L78 Accepts]: Start accepts. Automaton has 10886 states and 11522 transitions. Word has length 1126 [2018-12-30 22:36:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:36:53,363 INFO L480 AbstractCegarLoop]: Abstraction has 10886 states and 11522 transitions. [2018-12-30 22:36:53,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 22:36:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 10886 states and 11522 transitions. [2018-12-30 22:36:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1215 [2018-12-30 22:36:53,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:36:53,377 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:36:53,377 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:36:53,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:36:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1478558766, now seen corresponding path program 1 times [2018-12-30 22:36:53,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:36:53,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:36:53,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:53,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:36:53,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:36:54,049 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-12-30 22:36:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5194 backedges. 2959 proven. 0 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-12-30 22:36:54,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:36:54,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 22:36:54,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 22:36:54,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 22:36:54,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:36:54,861 INFO L87 Difference]: Start difference. First operand 10886 states and 11522 transitions. Second operand 4 states. [2018-12-30 22:36:56,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:36:56,492 INFO L93 Difference]: Finished difference Result 20670 states and 21850 transitions. [2018-12-30 22:36:56,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 22:36:56,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1214 [2018-12-30 22:36:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:36:56,504 INFO L225 Difference]: With dead ends: 20670 [2018-12-30 22:36:56,504 INFO L226 Difference]: Without dead ends: 12548 [2018-12-30 22:36:56,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 22:36:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12548 states. [2018-12-30 22:36:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12548 to 7758. [2018-12-30 22:36:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7758 states. [2018-12-30 22:36:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7758 states to 7758 states and 8152 transitions. [2018-12-30 22:36:56,654 INFO L78 Accepts]: Start accepts. Automaton has 7758 states and 8152 transitions. Word has length 1214 [2018-12-30 22:36:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:36:56,655 INFO L480 AbstractCegarLoop]: Abstraction has 7758 states and 8152 transitions. [2018-12-30 22:36:56,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 22:36:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7758 states and 8152 transitions. [2018-12-30 22:36:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1333 [2018-12-30 22:36:56,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:36:56,670 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 22:36:56,670 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:36:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:36:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1637180648, now seen corresponding path program 1 times [2018-12-30 22:36:56,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:36:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:36:56,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:56,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:36:56,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:36:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:36:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 2750 proven. 237 refuted. 0 times theorem prover too weak. 3407 trivial. 0 not checked. [2018-12-30 22:36:58,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 22:36:58,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 22:36:58,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:36:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:36:59,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 22:36:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 2750 proven. 237 refuted. 0 times theorem prover too weak. 3407 trivial. 0 not checked. [2018-12-30 22:36:59,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 22:36:59,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-12-30 22:36:59,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:36:59,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:36:59,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:36:59,895 INFO L87 Difference]: Start difference. First operand 7758 states and 8152 transitions. Second operand 5 states. [2018-12-30 22:37:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:37:02,388 INFO L93 Difference]: Finished difference Result 19197 states and 20152 transitions. [2018-12-30 22:37:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 22:37:02,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1332 [2018-12-30 22:37:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:37:02,395 INFO L225 Difference]: With dead ends: 19197 [2018-12-30 22:37:02,395 INFO L226 Difference]: Without dead ends: 6640 [2018-12-30 22:37:02,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1335 GetRequests, 1331 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:37:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2018-12-30 22:37:02,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 3512. [2018-12-30 22:37:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2018-12-30 22:37:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 3564 transitions. [2018-12-30 22:37:02,467 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 3564 transitions. Word has length 1332 [2018-12-30 22:37:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:37:02,468 INFO L480 AbstractCegarLoop]: Abstraction has 3512 states and 3564 transitions. [2018-12-30 22:37:02,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:37:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 3564 transitions. [2018-12-30 22:37:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1522 [2018-12-30 22:37:02,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:37:02,482 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 22:37:02,483 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:37:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:37:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash -845056045, now seen corresponding path program 1 times [2018-12-30 22:37:02,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:37:02,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:37:02,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:37:02,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:37:02,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:37:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:37:03,424 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-30 22:37:03,695 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 7 [2018-12-30 22:37:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7742 backedges. 4623 proven. 0 refuted. 0 times theorem prover too weak. 3119 trivial. 0 not checked. [2018-12-30 22:37:04,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:37:04,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 22:37:04,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:37:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:37:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:37:04,544 INFO L87 Difference]: Start difference. First operand 3512 states and 3564 transitions. Second operand 5 states. [2018-12-30 22:37:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:37:05,956 INFO L93 Difference]: Finished difference Result 7756 states and 7875 transitions. [2018-12-30 22:37:05,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 22:37:05,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1521 [2018-12-30 22:37:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:37:05,962 INFO L225 Difference]: With dead ends: 7756 [2018-12-30 22:37:05,962 INFO L226 Difference]: Without dead ends: 4800 [2018-12-30 22:37:05,964 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 [2018-12-30 22:37:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2018-12-30 22:37:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 3512. [2018-12-30 22:37:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2018-12-30 22:37:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 3564 transitions. [2018-12-30 22:37:06,026 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 3564 transitions. Word has length 1521 [2018-12-30 22:37:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:37:06,027 INFO L480 AbstractCegarLoop]: Abstraction has 3512 states and 3564 transitions. [2018-12-30 22:37:06,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:37:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 3564 transitions. [2018-12-30 22:37:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1591 [2018-12-30 22:37:06,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 22:37:06,042 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-30 22:37:06,042 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 22:37:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 22:37:06,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1380787000, now seen corresponding path program 1 times [2018-12-30 22:37:06,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 22:37:06,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 22:37:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:37:06,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 22:37:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 22:37:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 22:37:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8104 backedges. 6082 proven. 0 refuted. 0 times theorem prover too weak. 2022 trivial. 0 not checked. [2018-12-30 22:37:07,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 22:37:07,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 22:37:07,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 22:37:07,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 22:37:07,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:37:07,902 INFO L87 Difference]: Start difference. First operand 3512 states and 3564 transitions. Second operand 5 states. [2018-12-30 22:37:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 22:37:08,907 INFO L93 Difference]: Finished difference Result 5538 states and 5619 transitions. [2018-12-30 22:37:08,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 22:37:08,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1590 [2018-12-30 22:37:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 22:37:08,909 INFO L225 Difference]: With dead ends: 5538 [2018-12-30 22:37:08,909 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 22:37:08,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 22:37:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 22:37:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 22:37:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 22:37:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 22:37:08,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1590 [2018-12-30 22:37:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 22:37:08,913 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 22:37:08,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 22:37:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 22:37:08,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 22:37:08,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 22:37:09,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:09,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:10,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:11,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:12,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:13,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:14,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:15,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:15,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:15,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:15,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:15,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:15,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:15,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,489 WARN L181 SmtUtils]: Spent 8.56 s on a formula simplification. DAG size of input: 1911 DAG size of output: 1463 [2018-12-30 22:37:17,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:17,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:18,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:19,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:20,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:21,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:22,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:22,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:23,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:23,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:23,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:23,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:23,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:24,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 22:37:24,847 WARN L181 SmtUtils]: Spent 7.35 s on a formula simplification. DAG size of input: 1905 DAG size of output: 1458 [2018-12-30 22:38:08,845 WARN L181 SmtUtils]: Spent 43.98 s on a formula simplification. DAG size of input: 1343 DAG size of output: 205 [2018-12-30 22:38:51,632 WARN L181 SmtUtils]: Spent 42.78 s on a formula simplification. DAG size of input: 1338 DAG size of output: 205 [2018-12-30 22:38:51,637 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-12-30 22:38:51,637 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-12-30 22:38:51,637 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-12-30 22:38:51,637 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-12-30 22:38:51,637 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,637 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,637 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,637 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,638 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,639 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,639 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,639 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,639 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,639 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-30 22:38:51,639 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-12-30 22:38:51,639 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-12-30 22:38:51,639 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,640 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse22 (= ~a25~0 13)) (.cse33 (+ ~a23~0 43))) (let ((.cse24 (<= ~a29~0 245)) (.cse32 (<= ~a23~0 312)) (.cse3 (= ~a25~0 12)) (.cse29 (< 0 .cse33)) (.cse31 (not .cse22)) (.cse0 (= ~a4~0 1))) (let ((.cse17 (<= ~a29~0 277)) (.cse16 (< 306 ~a23~0)) (.cse14 (not (= ULTIMATE.start_calculate_output_~input 1))) (.cse12 (exists ((v_~a29~0_504 Int)) (let ((.cse34 (mod (+ v_~a29~0_504 26) 52))) (and (< (+ v_~a29~0_504 370578) 0) (<= (+ .cse34 140) ~a29~0) (not (= .cse34 0)))))) (.cse15 (<= 312 ~a23~0)) (.cse13 (<= ~a23~0 599997)) (.cse5 (= 1 ~a4~0)) (.cse11 (exists ((v_prenex_13 Int)) (and (<= 0 v_prenex_13) (<= 312 v_prenex_13) (<= ~a23~0 (+ (mod v_prenex_13 299846) 300155))))) (.cse18 (and .cse29 .cse31 .cse0)) (.cse10 (< 245 ~a29~0)) (.cse4 (= 15 ~a8~0)) (.cse27 (<= ~a29~0 140)) (.cse26 (<= (+ ~a23~0 307) 0)) (.cse1 (= ~a25~0 10)) (.cse8 (<= ~a29~0 130)) (.cse19 (<= ~a4~0 0)) (.cse25 (<= 10250 ~a29~0)) (.cse23 (or (and .cse3 (not .cse0)) (< 140 ~a29~0))) (.cse2 (<= .cse33 0)) (.cse20 (and .cse32 .cse29 .cse31 .cse0)) (.cse28 (= ~a25~0 11)) (.cse6 (= ~a25~0 9)) (.cse7 (= ~a8~0 15)) (.cse21 (<= ~a23~0 138)) (.cse30 (and .cse32 .cse29 .cse31 .cse0 .cse24)) (.cse9 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2) (and (and .cse3 (= 1 ~a3~0) .cse4 .cse5) (<= ~a23~0 247)) (and (and .cse6 (and .cse7 (and .cse8 .cse2))) .cse9) (and (and (and (or (and .cse7 .cse0 .cse1) (and .cse0 (and .cse6 .cse7 .cse10))) .cse9) .cse11) .cse12) (and .cse13 (or (and .cse7 (and .cse0 .cse1) .cse9) (and .cse3 .cse7 .cse0 .cse14 .cse8 .cse9 .cse15))) (and (and .cse16 .cse11 .cse14 .cse17 (and .cse3 .cse10) .cse9) .cse4 .cse5) (and (and (and .cse6 (and .cse10 (and .cse18 .cse17))) .cse9) .cse4) (and .cse7 .cse19 (and .cse10 (and .cse3 .cse17)) .cse9) (and (and .cse7 (and .cse20 .cse17) .cse10 .cse9) .cse21) (and .cse7 (and .cse22 .cse23 .cse0 .cse24) .cse9) (and (and .cse7 .cse25 .cse20 .cse9) .cse21) (and .cse26 (and (and (and (and .cse19 .cse7) .cse9) .cse27) .cse28)) (and (and (and (and .cse3 .cse7 .cse19) .cse9) .cse12) .cse24 .cse2) (or (and (and .cse6 .cse7 .cse0 .cse23 .cse24) .cse9 .cse15) (and (and .cse7 (and .cse0 .cse17 .cse1) .cse9) .cse12)) (and .cse13 (or (and (or (and .cse3 .cse9 .cse15) (and .cse16 .cse14 .cse3 (<= ~a29~0 220) .cse9)) .cse12 .cse4 .cse5) (and .cse4 .cse5 .cse28 .cse12 .cse9 .cse15)) .cse24) (and .cse13 (and (and .cse22 .cse29 .cse9) .cse4 .cse5)) (and (and (and .cse11 .cse9 (and .cse18 .cse10)) .cse4) .cse28) (and (and .cse9 (and .cse30 .cse6 .cse7)) .cse27) (and .cse26 .cse7 .cse19 .cse1 (<= (+ ~a29~0 28445) 0) .cse9) (and (and .cse3 .cse7 .cse19 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse8 .cse9) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (and (<= 0 v_prenex_18) (<= v_prenex_17 (+ (mod v_prenex_18 299846) 300155)) (not (= 0 (mod (+ v_prenex_17 4) 5))) (<= 312 v_prenex_18) (< v_prenex_17 600276) (<= ~a23~0 (+ (div (+ v_prenex_17 (- 600276)) 5) 1))))) (and (and (and .cse19 (and .cse6 .cse7 .cse25)) .cse9) .cse2) (and .cse9 (and .cse7 .cse23 (and (not .cse28) .cse31 .cse0 .cse2))) (and (and .cse7 .cse20 .cse9) (<= ~a23~0 306) .cse28) (and .cse6 .cse7 .cse21 .cse30 .cse9))))) [2018-12-30 22:38:51,640 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,640 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,640 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,640 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,640 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,640 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,640 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-12-30 22:38:51,641 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-30 22:38:51,642 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,643 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-12-30 22:38:51,644 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,645 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,646 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-12-30 22:38:51,647 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,648 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,649 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-12-30 22:38:51,650 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,651 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,652 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-30 22:38:51,653 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,654 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,655 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,656 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-30 22:38:51,656 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,659 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-30 22:38:51,660 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,661 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,662 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,663 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,664 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,664 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-30 22:38:51,664 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-12-30 22:38:51,664 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-12-30 22:38:51,664 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,664 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,664 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,665 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse22 (= ~a25~0 13)) (.cse33 (+ ~a23~0 43))) (let ((.cse24 (<= ~a29~0 245)) (.cse32 (<= ~a23~0 312)) (.cse3 (= ~a25~0 12)) (.cse29 (< 0 .cse33)) (.cse31 (not .cse22)) (.cse0 (= ~a4~0 1))) (let ((.cse17 (<= ~a29~0 277)) (.cse16 (< 306 ~a23~0)) (.cse14 (not (= ULTIMATE.start_calculate_output_~input 1))) (.cse12 (exists ((v_~a29~0_504 Int)) (let ((.cse34 (mod (+ v_~a29~0_504 26) 52))) (and (< (+ v_~a29~0_504 370578) 0) (<= (+ .cse34 140) ~a29~0) (not (= .cse34 0)))))) (.cse15 (<= 312 ~a23~0)) (.cse13 (<= ~a23~0 599997)) (.cse5 (= 1 ~a4~0)) (.cse11 (exists ((v_prenex_13 Int)) (and (<= 0 v_prenex_13) (<= 312 v_prenex_13) (<= ~a23~0 (+ (mod v_prenex_13 299846) 300155))))) (.cse18 (and .cse29 .cse31 .cse0)) (.cse10 (< 245 ~a29~0)) (.cse4 (= 15 ~a8~0)) (.cse27 (<= ~a29~0 140)) (.cse26 (<= (+ ~a23~0 307) 0)) (.cse1 (= ~a25~0 10)) (.cse8 (<= ~a29~0 130)) (.cse19 (<= ~a4~0 0)) (.cse25 (<= 10250 ~a29~0)) (.cse23 (or (and .cse3 (not .cse0)) (< 140 ~a29~0))) (.cse2 (<= .cse33 0)) (.cse20 (and .cse32 .cse29 .cse31 .cse0)) (.cse28 (= ~a25~0 11)) (.cse6 (= ~a25~0 9)) (.cse7 (= ~a8~0 15)) (.cse21 (<= ~a23~0 138)) (.cse30 (and .cse32 .cse29 .cse31 .cse0 .cse24)) (.cse9 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2) (and (and .cse3 (= 1 ~a3~0) .cse4 .cse5) (<= ~a23~0 247)) (and (and .cse6 (and .cse7 (and .cse8 .cse2))) .cse9) (and (and (and (or (and .cse7 .cse0 .cse1) (and .cse0 (and .cse6 .cse7 .cse10))) .cse9) .cse11) .cse12) (and .cse13 (or (and .cse7 (and .cse0 .cse1) .cse9) (and .cse3 .cse7 .cse0 .cse14 .cse8 .cse9 .cse15))) (and (and .cse16 .cse11 .cse14 .cse17 (and .cse3 .cse10) .cse9) .cse4 .cse5) (and (and (and .cse6 (and .cse10 (and .cse18 .cse17))) .cse9) .cse4) (and .cse7 .cse19 (and .cse10 (and .cse3 .cse17)) .cse9) (and (and .cse7 (and .cse20 .cse17) .cse10 .cse9) .cse21) (and .cse7 (and .cse22 .cse23 .cse0 .cse24) .cse9) (and (and .cse7 .cse25 .cse20 .cse9) .cse21) (and .cse26 (and (and (and (and .cse19 .cse7) .cse9) .cse27) .cse28)) (and (and (and (and .cse3 .cse7 .cse19) .cse9) .cse12) .cse24 .cse2) (or (and (and .cse6 .cse7 .cse0 .cse23 .cse24) .cse9 .cse15) (and (and .cse7 (and .cse0 .cse17 .cse1) .cse9) .cse12)) (and .cse13 (or (and (or (and .cse3 .cse9 .cse15) (and .cse16 .cse14 .cse3 (<= ~a29~0 220) .cse9)) .cse12 .cse4 .cse5) (and .cse4 .cse5 .cse28 .cse12 .cse9 .cse15)) .cse24) (and .cse13 (and (and .cse22 .cse29 .cse9) .cse4 .cse5)) (and (and (and .cse11 .cse9 (and .cse18 .cse10)) .cse4) .cse28) (and (and .cse9 (and .cse30 .cse6 .cse7)) .cse27) (and .cse26 .cse7 .cse19 .cse1 (<= (+ ~a29~0 28445) 0) .cse9) (and (and .cse3 .cse7 .cse19 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse8 .cse9) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (and (<= 0 v_prenex_18) (<= v_prenex_17 (+ (mod v_prenex_18 299846) 300155)) (not (= 0 (mod (+ v_prenex_17 4) 5))) (<= 312 v_prenex_18) (< v_prenex_17 600276) (<= ~a23~0 (+ (div (+ v_prenex_17 (- 600276)) 5) 1))))) (and (and (and .cse19 (and .cse6 .cse7 .cse25)) .cse9) .cse2) (and .cse9 (and .cse7 .cse23 (and (not .cse28) .cse31 .cse0 .cse2))) (and (and .cse7 .cse20 .cse9) (<= ~a23~0 306) .cse28) (and .cse6 .cse7 .cse21 .cse30 .cse9))))) [2018-12-30 22:38:51,665 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,665 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-12-30 22:38:51,665 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-12-30 22:38:51,665 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,665 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,666 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-12-30 22:38:51,666 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,666 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,666 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2018-12-30 22:38:51,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,723 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,774 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,780 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,781 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:51,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:51,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:51,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:51,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 10:38:51 BoogieIcfgContainer [2018-12-30 22:38:51,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 22:38:51,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 22:38:51,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 22:38:51,834 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 22:38:51,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 10:27:17" (3/4) ... [2018-12-30 22:38:51,848 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 22:38:51,915 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 22:38:51,917 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 22:38:51,955 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a4 == 1 && a25 == 10) && a23 + 43 <= 0) || ((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && a23 <= 247)) || ((a25 == 9 && a8 == 15 && a29 <= 130 && a23 + 43 <= 0) && a3 == 1)) || ((((((a8 == 15 && a4 == 1) && a25 == 10) || (a4 == 1 && (a25 == 9 && a8 == 15) && 245 < a29)) && a3 == 1) && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155)) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)))) || (a23 <= 599997 && (((a8 == 15 && a4 == 1 && a25 == 10) && a3 == 1) || ((((((a25 == 12 && a8 == 15) && a4 == 1) && !(input == 1)) && a29 <= 130) && a3 == 1) && 312 <= a23)))) || (((((((306 < a23 && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155)) && !(input == 1)) && a29 <= 277) && a25 == 12 && 245 < a29) && a3 == 1) && 15 == a8) && 1 == a4)) || (((a25 == 9 && 245 < a29 && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && a29 <= 277) && a3 == 1) && 15 == a8)) || (((a8 == 15 && a4 <= 0) && 245 < a29 && a25 == 12 && a29 <= 277) && a3 == 1)) || ((((a8 == 15 && (((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 277) && 245 < a29) && a3 == 1) && a23 <= 138)) || ((a8 == 15 && ((a25 == 13 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a4 == 1) && a29 <= 245) && a3 == 1)) || ((((a8 == 15 && 10250 <= a29) && ((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a3 == 1) && a23 <= 138)) || (a23 + 307 <= 0 && (((a4 <= 0 && a8 == 15) && a3 == 1) && a29 <= 140) && a25 == 11)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a29 <= 245) && a23 + 43 <= 0)) || ((((((a25 == 9 && a8 == 15) && a4 == 1) && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a29 <= 245) && a3 == 1) && 312 <= a23) || (((a8 == 15 && (a4 == 1 && a29 <= 277) && a25 == 10) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)))) || ((a23 <= 599997 && (((((((a25 == 12 && a3 == 1) && 312 <= a23) || ((((306 < a23 && !(input == 1)) && a25 == 12) && a29 <= 220) && a3 == 1)) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && 15 == a8) && 1 == a4) || (((((15 == a8 && 1 == a4) && a25 == 11) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a3 == 1) && 312 <= a23))) && a29 <= 245)) || (a23 <= 599997 && (((a25 == 13 && 0 < a23 + 43) && a3 == 1) && 15 == a8) && 1 == a4)) || (((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && a3 == 1) && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) && 15 == a8) && a25 == 11)) || ((a3 == 1 && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 245) && a25 == 9) && a8 == 15) && a29 <= 140)) || (((((a23 + 307 <= 0 && a8 == 15) && a4 <= 0) && a25 == 10) && a29 + 28445 <= 0) && a3 == 1)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && !(3 == input)) && a29 <= 130) && a3 == 1) && (\exists v_prenex_18 : int, v_prenex_17 : int :: ((((0 <= v_prenex_18 && v_prenex_17 <= v_prenex_18 % 299846 + 300155) && !(0 == (v_prenex_17 + 4) % 5)) && 312 <= v_prenex_18) && v_prenex_17 < 600276) && a23 <= (v_prenex_17 + -600276) / 5 + 1))) || (((a4 <= 0 && (a25 == 9 && a8 == 15) && 10250 <= a29) && a3 == 1) && a23 + 43 <= 0)) || (a3 == 1 && (a8 == 15 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && ((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && ((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a3 == 1) && a23 <= 306) && a25 == 11)) || ((((a25 == 9 && a8 == 15) && a23 <= 138) && (((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 245) && a3 == 1) [2018-12-30 22:38:51,963 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a4 == 1 && a25 == 10) && a23 + 43 <= 0) || ((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && a23 <= 247)) || ((a25 == 9 && a8 == 15 && a29 <= 130 && a23 + 43 <= 0) && a3 == 1)) || ((((((a8 == 15 && a4 == 1) && a25 == 10) || (a4 == 1 && (a25 == 9 && a8 == 15) && 245 < a29)) && a3 == 1) && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155)) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)))) || (a23 <= 599997 && (((a8 == 15 && a4 == 1 && a25 == 10) && a3 == 1) || ((((((a25 == 12 && a8 == 15) && a4 == 1) && !(input == 1)) && a29 <= 130) && a3 == 1) && 312 <= a23)))) || (((((((306 < a23 && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155)) && !(input == 1)) && a29 <= 277) && a25 == 12 && 245 < a29) && a3 == 1) && 15 == a8) && 1 == a4)) || (((a25 == 9 && 245 < a29 && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && a29 <= 277) && a3 == 1) && 15 == a8)) || (((a8 == 15 && a4 <= 0) && 245 < a29 && a25 == 12 && a29 <= 277) && a3 == 1)) || ((((a8 == 15 && (((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 277) && 245 < a29) && a3 == 1) && a23 <= 138)) || ((a8 == 15 && ((a25 == 13 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a4 == 1) && a29 <= 245) && a3 == 1)) || ((((a8 == 15 && 10250 <= a29) && ((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a3 == 1) && a23 <= 138)) || (a23 + 307 <= 0 && (((a4 <= 0 && a8 == 15) && a3 == 1) && a29 <= 140) && a25 == 11)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a29 <= 245) && a23 + 43 <= 0)) || ((((((a25 == 9 && a8 == 15) && a4 == 1) && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a29 <= 245) && a3 == 1) && 312 <= a23) || (((a8 == 15 && (a4 == 1 && a29 <= 277) && a25 == 10) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)))) || ((a23 <= 599997 && (((((((a25 == 12 && a3 == 1) && 312 <= a23) || ((((306 < a23 && !(input == 1)) && a25 == 12) && a29 <= 220) && a3 == 1)) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && 15 == a8) && 1 == a4) || (((((15 == a8 && 1 == a4) && a25 == 11) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a3 == 1) && 312 <= a23))) && a29 <= 245)) || (a23 <= 599997 && (((a25 == 13 && 0 < a23 + 43) && a3 == 1) && 15 == a8) && 1 == a4)) || (((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && a3 == 1) && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) && 15 == a8) && a25 == 11)) || ((a3 == 1 && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 245) && a25 == 9) && a8 == 15) && a29 <= 140)) || (((((a23 + 307 <= 0 && a8 == 15) && a4 <= 0) && a25 == 10) && a29 + 28445 <= 0) && a3 == 1)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && !(3 == input)) && a29 <= 130) && a3 == 1) && (\exists v_prenex_18 : int, v_prenex_17 : int :: ((((0 <= v_prenex_18 && v_prenex_17 <= v_prenex_18 % 299846 + 300155) && !(0 == (v_prenex_17 + 4) % 5)) && 312 <= v_prenex_18) && v_prenex_17 < 600276) && a23 <= (v_prenex_17 + -600276) / 5 + 1))) || (((a4 <= 0 && (a25 == 9 && a8 == 15) && 10250 <= a29) && a3 == 1) && a23 + 43 <= 0)) || (a3 == 1 && (a8 == 15 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && ((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && ((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a3 == 1) && a23 <= 306) && a25 == 11)) || ((((a25 == 9 && a8 == 15) && a23 <= 138) && (((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 245) && a3 == 1) [2018-12-30 22:38:52,120 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 22:38:52,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 22:38:52,123 INFO L168 Benchmark]: Toolchain (without parser) took 700849.23 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 943.3 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 310.9 MB. Max. memory is 11.5 GB. [2018-12-30 22:38:52,123 INFO L168 Benchmark]: CDTParser took 0.26 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. [2018-12-30 22:38:52,124 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1068.13 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 895.0 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2018-12-30 22:38:52,125 INFO L168 Benchmark]: Boogie Procedure Inliner took 307.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 895.0 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-12-30 22:38:52,125 INFO L168 Benchmark]: Boogie Preprocessor took 184.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-30 22:38:52,126 INFO L168 Benchmark]: RCFGBuilder took 4244.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 910.9 MB in the end (delta: 165.2 MB). Peak memory consumption was 165.2 MB. Max. memory is 11.5 GB. [2018-12-30 22:38:52,126 INFO L168 Benchmark]: TraceAbstraction took 694750.08 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 910.9 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-12-30 22:38:52,126 INFO L168 Benchmark]: Witness Printer took 287.21 ms. Allocated memory is still 4.3 GB. Free memory is still 3.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 22:38:52,132 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.26 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 1068.13 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 895.0 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 307.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 895.0 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 184.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4244.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 910.9 MB in the end (delta: 165.2 MB). Peak memory consumption was 165.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 694750.08 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 910.9 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 287.21 ms. Allocated memory is still 4.3 GB. Free memory is still 3.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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 [2018-12-30 22:38:52,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,166 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,167 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,168 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a4 == 1 && a25 == 10) && a23 + 43 <= 0) || ((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && a23 <= 247)) || ((a25 == 9 && a8 == 15 && a29 <= 130 && a23 + 43 <= 0) && a3 == 1)) || ((((((a8 == 15 && a4 == 1) && a25 == 10) || (a4 == 1 && (a25 == 9 && a8 == 15) && 245 < a29)) && a3 == 1) && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155)) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)))) || (a23 <= 599997 && (((a8 == 15 && a4 == 1 && a25 == 10) && a3 == 1) || ((((((a25 == 12 && a8 == 15) && a4 == 1) && !(input == 1)) && a29 <= 130) && a3 == 1) && 312 <= a23)))) || (((((((306 < a23 && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155)) && !(input == 1)) && a29 <= 277) && a25 == 12 && 245 < a29) && a3 == 1) && 15 == a8) && 1 == a4)) || (((a25 == 9 && 245 < a29 && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && a29 <= 277) && a3 == 1) && 15 == a8)) || (((a8 == 15 && a4 <= 0) && 245 < a29 && a25 == 12 && a29 <= 277) && a3 == 1)) || ((((a8 == 15 && (((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 277) && 245 < a29) && a3 == 1) && a23 <= 138)) || ((a8 == 15 && ((a25 == 13 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a4 == 1) && a29 <= 245) && a3 == 1)) || ((((a8 == 15 && 10250 <= a29) && ((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a3 == 1) && a23 <= 138)) || (a23 + 307 <= 0 && (((a4 <= 0 && a8 == 15) && a3 == 1) && a29 <= 140) && a25 == 11)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a29 <= 245) && a23 + 43 <= 0)) || ((((((a25 == 9 && a8 == 15) && a4 == 1) && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a29 <= 245) && a3 == 1) && 312 <= a23) || (((a8 == 15 && (a4 == 1 && a29 <= 277) && a25 == 10) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)))) || ((a23 <= 599997 && (((((((a25 == 12 && a3 == 1) && 312 <= a23) || ((((306 < a23 && !(input == 1)) && a25 == 12) && a29 <= 220) && a3 == 1)) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && 15 == a8) && 1 == a4) || (((((15 == a8 && 1 == a4) && a25 == 11) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a3 == 1) && 312 <= a23))) && a29 <= 245)) || (a23 <= 599997 && (((a25 == 13 && 0 < a23 + 43) && a3 == 1) && 15 == a8) && 1 == a4)) || (((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && a3 == 1) && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) && 15 == a8) && a25 == 11)) || ((a3 == 1 && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 245) && a25 == 9) && a8 == 15) && a29 <= 140)) || (((((a23 + 307 <= 0 && a8 == 15) && a4 <= 0) && a25 == 10) && a29 + 28445 <= 0) && a3 == 1)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && !(3 == input)) && a29 <= 130) && a3 == 1) && (\exists v_prenex_18 : int, v_prenex_17 : int :: ((((0 <= v_prenex_18 && v_prenex_17 <= v_prenex_18 % 299846 + 300155) && !(0 == (v_prenex_17 + 4) % 5)) && 312 <= v_prenex_18) && v_prenex_17 < 600276) && a23 <= (v_prenex_17 + -600276) / 5 + 1))) || (((a4 <= 0 && (a25 == 9 && a8 == 15) && 10250 <= a29) && a3 == 1) && a23 + 43 <= 0)) || (a3 == 1 && (a8 == 15 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && ((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && ((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a3 == 1) && a23 <= 306) && a25 == 11)) || ((((a25 == 9 && a8 == 15) && a23 <= 138) && (((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 245) && a3 == 1) - InvariantResult [Line: 22]: Loop Invariant [2018-12-30 22:38:52,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,177 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,181 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,182 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2018-12-30 22:38:52,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2018-12-30 22:38:52,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-12-30 22:38:52,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-30 22:38:52,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a4 == 1 && a25 == 10) && a23 + 43 <= 0) || ((((a25 == 12 && 1 == a3) && 15 == a8) && 1 == a4) && a23 <= 247)) || ((a25 == 9 && a8 == 15 && a29 <= 130 && a23 + 43 <= 0) && a3 == 1)) || ((((((a8 == 15 && a4 == 1) && a25 == 10) || (a4 == 1 && (a25 == 9 && a8 == 15) && 245 < a29)) && a3 == 1) && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155)) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)))) || (a23 <= 599997 && (((a8 == 15 && a4 == 1 && a25 == 10) && a3 == 1) || ((((((a25 == 12 && a8 == 15) && a4 == 1) && !(input == 1)) && a29 <= 130) && a3 == 1) && 312 <= a23)))) || (((((((306 < a23 && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155)) && !(input == 1)) && a29 <= 277) && a25 == 12 && 245 < a29) && a3 == 1) && 15 == a8) && 1 == a4)) || (((a25 == 9 && 245 < a29 && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && a29 <= 277) && a3 == 1) && 15 == a8)) || (((a8 == 15 && a4 <= 0) && 245 < a29 && a25 == 12 && a29 <= 277) && a3 == 1)) || ((((a8 == 15 && (((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 277) && 245 < a29) && a3 == 1) && a23 <= 138)) || ((a8 == 15 && ((a25 == 13 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a4 == 1) && a29 <= 245) && a3 == 1)) || ((((a8 == 15 && 10250 <= a29) && ((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a3 == 1) && a23 <= 138)) || (a23 + 307 <= 0 && (((a4 <= 0 && a8 == 15) && a3 == 1) && a29 <= 140) && a25 == 11)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a29 <= 245) && a23 + 43 <= 0)) || ((((((a25 == 9 && a8 == 15) && a4 == 1) && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a29 <= 245) && a3 == 1) && 312 <= a23) || (((a8 == 15 && (a4 == 1 && a29 <= 277) && a25 == 10) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)))) || ((a23 <= 599997 && (((((((a25 == 12 && a3 == 1) && 312 <= a23) || ((((306 < a23 && !(input == 1)) && a25 == 12) && a29 <= 220) && a3 == 1)) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && 15 == a8) && 1 == a4) || (((((15 == a8 && 1 == a4) && a25 == 11) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a3 == 1) && 312 <= a23))) && a29 <= 245)) || (a23 <= 599997 && (((a25 == 13 && 0 < a23 + 43) && a3 == 1) && 15 == a8) && 1 == a4)) || (((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && a3 == 1) && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) && 15 == a8) && a25 == 11)) || ((a3 == 1 && (((((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 245) && a25 == 9) && a8 == 15) && a29 <= 140)) || (((((a23 + 307 <= 0 && a8 == 15) && a4 <= 0) && a25 == 10) && a29 + 28445 <= 0) && a3 == 1)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && !(3 == input)) && a29 <= 130) && a3 == 1) && (\exists v_prenex_18 : int, v_prenex_17 : int :: ((((0 <= v_prenex_18 && v_prenex_17 <= v_prenex_18 % 299846 + 300155) && !(0 == (v_prenex_17 + 4) % 5)) && 312 <= v_prenex_18) && v_prenex_17 < 600276) && a23 <= (v_prenex_17 + -600276) / 5 + 1))) || (((a4 <= 0 && (a25 == 9 && a8 == 15) && 10250 <= a29) && a3 == 1) && a23 + 43 <= 0)) || (a3 == 1 && (a8 == 15 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && ((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && ((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a3 == 1) && a23 <= 306) && a25 == 11)) || ((((a25 == 9 && a8 == 15) && a23 <= 138) && (((a23 <= 312 && 0 < a23 + 43) && !(a25 == 13)) && a4 == 1) && a29 <= 245) && a3 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 694.5s OverallTime, 26 OverallIterations, 13 TraceHistogramMax, 533.2s AutomataDifference, 0.0s DeadEndRemovalTime, 102.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2633 SDtfs, 19417 SDslu, 1361 SDs, 0 SdLazy, 49797 SolverSat, 6143 SolverUnsat, 231 SolverUnknown, 0 SolverNotchecked, 509.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10521 GetRequests, 10306 SyntacticMatches, 22 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17164occurred in iteration=17, 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: 4.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 66868 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 148 NumberOfFragments, 1823 HoareAnnotationTreeSize, 3 FomulaSimplifications, 61045255 FormulaSimplificationTreeSizeReduction, 15.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 15689224 FormulaSimplificationTreeSizeReductionInter, 86.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 28883 NumberOfCodeBlocks, 28883 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 28844 ConstructedInterpolants, 987 QuantifiedInterpolants, 110395980 SizeOfPredicates, 40 NumberOfNonLiveVariables, 13103 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 86924/93135 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...