./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label14_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem10_label14_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 2d05d1de5597bdaeecbf29f7010022c1cc3574fd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:29:56,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:29:56,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:29:56,188 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:29:56,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:29:56,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:29:56,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:29:56,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:29:56,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:29:56,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:29:56,199 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:29:56,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:29:56,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:29:56,202 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:29:56,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:29:56,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:29:56,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:29:56,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:29:56,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:29:56,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:29:56,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:29:56,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:29:56,215 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:29:56,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:29:56,215 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:29:56,216 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:29:56,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:29:56,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:29:56,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:29:56,220 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:29:56,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:29:56,221 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:29:56,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:29:56,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:29:56,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:29:56,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:29:56,225 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:29:56,243 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:29:56,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:29:56,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:29:56,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:29:56,245 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:29:56,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:29:56,247 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:29:56,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:29:56,247 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:29:56,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:29:56,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:29:56,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:29:56,248 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:29:56,249 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:29:56,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:29:56,249 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:29:56,249 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:29:56,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:29:56,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:29:56,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:29:56,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:29:56,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:29:56,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:29:56,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:29:56,251 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:29:56,252 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:29:56,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:29:56,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:29:56,253 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 -> 2d05d1de5597bdaeecbf29f7010022c1cc3574fd [2019-01-12 03:29:56,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:29:56,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:29:56,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:29:56,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:29:56,312 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:29:56,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label14_true-unreach-call.c [2019-01-12 03:29:56,380 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6bd4d3af/c0e16c7602634932863da8cb5388bee9/FLAG975c89865 [2019-01-12 03:29:56,888 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:29:56,889 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label14_true-unreach-call.c [2019-01-12 03:29:56,911 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6bd4d3af/c0e16c7602634932863da8cb5388bee9/FLAG975c89865 [2019-01-12 03:29:57,139 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6bd4d3af/c0e16c7602634932863da8cb5388bee9 [2019-01-12 03:29:57,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:29:57,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:29:57,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:29:57,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:29:57,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:29:57,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:57,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7290c9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57, skipping insertion in model container [2019-01-12 03:29:57,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:57,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:29:57,222 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:29:57,751 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:29:57,759 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:29:57,970 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:29:57,992 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:29:57,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57 WrapperNode [2019-01-12 03:29:57,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:29:57,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:29:57,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:29:57,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:29:58,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:58,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:58,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:29:58,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:29:58,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:29:58,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:29:58,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:58,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:58,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:58,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:58,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:58,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:58,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... [2019-01-12 03:29:58,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:29:58,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:29:58,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:29:58,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:29:58,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:29:58,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:29:58,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:30:01,500 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:30:01,501 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:30:01,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:30:01 BoogieIcfgContainer [2019-01-12 03:30:01,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:30:01,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:30:01,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:30:01,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:30:01,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:29:57" (1/3) ... [2019-01-12 03:30:01,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2098e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:30:01, skipping insertion in model container [2019-01-12 03:30:01,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:57" (2/3) ... [2019-01-12 03:30:01,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2098e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:30:01, skipping insertion in model container [2019-01-12 03:30:01,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:30:01" (3/3) ... [2019-01-12 03:30:01,514 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label14_true-unreach-call.c [2019-01-12 03:30:01,523 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:30:01,532 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:30:01,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:30:01,585 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:30:01,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:30:01,586 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:30:01,587 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:30:01,587 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:30:01,587 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:30:01,587 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:30:01,587 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:30:01,587 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:30:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-12 03:30:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 03:30:01,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:01,620 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] [2019-01-12 03:30:01,622 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:01,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1843609039, now seen corresponding path program 1 times [2019-01-12 03:30:01,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:01,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:01,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:30:02,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:02,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:30:02,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:30:02,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:30:02,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:02,104 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-01-12 03:30:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:04,849 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-01-12 03:30:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:30:04,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-12 03:30:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:04,875 INFO L225 Difference]: With dead ends: 694 [2019-01-12 03:30:04,875 INFO L226 Difference]: Without dead ends: 421 [2019-01-12 03:30:04,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-12 03:30:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-01-12 03:30:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 03:30:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-01-12 03:30:04,947 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 31 [2019-01-12 03:30:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:04,948 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-01-12 03:30:04,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:30:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-01-12 03:30:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-12 03:30:04,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:04,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:30:04,955 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:04,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:04,956 INFO L82 PathProgramCache]: Analyzing trace with hash 616624572, now seen corresponding path program 1 times [2019-01-12 03:30:04,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:04,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:04,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:04,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:04,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:30:05,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:05,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 03:30:05,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:30:05,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:30:05,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:30:05,914 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 8 states. [2019-01-12 03:30:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:07,990 INFO L93 Difference]: Finished difference Result 715 states and 1090 transitions. [2019-01-12 03:30:07,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 03:30:07,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2019-01-12 03:30:07,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:07,997 INFO L225 Difference]: With dead ends: 715 [2019-01-12 03:30:07,997 INFO L226 Difference]: Without dead ends: 435 [2019-01-12 03:30:07,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:30:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-12 03:30:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 421. [2019-01-12 03:30:08,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-12 03:30:08,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 576 transitions. [2019-01-12 03:30:08,031 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 576 transitions. Word has length 146 [2019-01-12 03:30:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:08,031 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 576 transitions. [2019-01-12 03:30:08,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:30:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 576 transitions. [2019-01-12 03:30:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-12 03:30:08,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:08,037 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:30:08,038 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1197128713, now seen corresponding path program 1 times [2019-01-12 03:30:08,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:08,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:08,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:08,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:30:08,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:08,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 03:30:08,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:30:08,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:30:08,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:30:08,579 INFO L87 Difference]: Start difference. First operand 421 states and 576 transitions. Second operand 7 states. [2019-01-12 03:30:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:10,791 INFO L93 Difference]: Finished difference Result 991 states and 1446 transitions. [2019-01-12 03:30:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 03:30:10,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 212 [2019-01-12 03:30:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:10,797 INFO L225 Difference]: With dead ends: 991 [2019-01-12 03:30:10,797 INFO L226 Difference]: Without dead ends: 711 [2019-01-12 03:30:10,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:30:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-01-12 03:30:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 699. [2019-01-12 03:30:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-01-12 03:30:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 914 transitions. [2019-01-12 03:30:10,833 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 914 transitions. Word has length 212 [2019-01-12 03:30:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:10,834 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 914 transitions. [2019-01-12 03:30:10,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:30:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 914 transitions. [2019-01-12 03:30:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-01-12 03:30:10,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:10,847 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:30:10,848 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1537295179, now seen corresponding path program 1 times [2019-01-12 03:30:10,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:10,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:10,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:30:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:30:11,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:30:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:30:11,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:30:11,301 INFO L87 Difference]: Start difference. First operand 699 states and 914 transitions. Second operand 5 states. [2019-01-12 03:30:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:15,296 INFO L93 Difference]: Finished difference Result 1535 states and 2110 transitions. [2019-01-12 03:30:15,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:30:15,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 221 [2019-01-12 03:30:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:15,302 INFO L225 Difference]: With dead ends: 1535 [2019-01-12 03:30:15,302 INFO L226 Difference]: Without dead ends: 699 [2019-01-12 03:30:15,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:30:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-01-12 03:30:15,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2019-01-12 03:30:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-01-12 03:30:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 774 transitions. [2019-01-12 03:30:15,323 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 774 transitions. Word has length 221 [2019-01-12 03:30:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:15,323 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 774 transitions. [2019-01-12 03:30:15,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:30:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 774 transitions. [2019-01-12 03:30:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-01-12 03:30:15,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:15,328 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:30:15,328 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1743086501, now seen corresponding path program 1 times [2019-01-12 03:30:15,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:15,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:15,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:15,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:30:15,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:30:15,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:30:15,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:30:15,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:30:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:15,622 INFO L87 Difference]: Start difference. First operand 699 states and 774 transitions. Second operand 4 states. [2019-01-12 03:30:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:17,382 INFO L93 Difference]: Finished difference Result 1813 states and 2063 transitions. [2019-01-12 03:30:17,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:30:17,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 257 [2019-01-12 03:30:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:17,389 INFO L225 Difference]: With dead ends: 1813 [2019-01-12 03:30:17,389 INFO L226 Difference]: Without dead ends: 1116 [2019-01-12 03:30:17,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:30:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-01-12 03:30:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2019-01-12 03:30:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-01-12 03:30:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1243 transitions. [2019-01-12 03:30:17,420 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1243 transitions. Word has length 257 [2019-01-12 03:30:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:17,421 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1243 transitions. [2019-01-12 03:30:17,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:30:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1243 transitions. [2019-01-12 03:30:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-12 03:30:17,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:17,429 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:30:17,429 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:17,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:17,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1031152901, now seen corresponding path program 1 times [2019-01-12 03:30:17,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:17,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:17,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 244 proven. 68 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-12 03:30:17,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:30:17,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:30:17,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:17,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:30:18,559 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 20 [2019-01-12 03:30:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 250 proven. 62 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-12 03:30:19,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:30:19,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-01-12 03:30:19,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:30:19,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:30:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:30:19,082 INFO L87 Difference]: Start difference. First operand 1116 states and 1243 transitions. Second operand 8 states. [2019-01-12 03:30:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:23,443 INFO L93 Difference]: Finished difference Result 3759 states and 4248 transitions. [2019-01-12 03:30:23,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 03:30:23,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2019-01-12 03:30:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:23,458 INFO L225 Difference]: With dead ends: 3759 [2019-01-12 03:30:23,458 INFO L226 Difference]: Without dead ends: 2784 [2019-01-12 03:30:23,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:30:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-01-12 03:30:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2228. [2019-01-12 03:30:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-01-12 03:30:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2450 transitions. [2019-01-12 03:30:23,526 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2450 transitions. Word has length 330 [2019-01-12 03:30:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:23,526 INFO L480 AbstractCegarLoop]: Abstraction has 2228 states and 2450 transitions. [2019-01-12 03:30:23,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:30:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2450 transitions. [2019-01-12 03:30:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-01-12 03:30:23,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:23,534 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:30:23,534 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:23,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:23,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1413062826, now seen corresponding path program 1 times [2019-01-12 03:30:23,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:23,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:23,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:23,896 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 03:30:24,379 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-12 03:30:24,932 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-12 03:30:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 58 proven. 162 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-01-12 03:30:25,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:30:25,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:30:25,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:25,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:30:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-01-12 03:30:25,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:30:25,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-01-12 03:30:25,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:30:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:30:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:30:25,448 INFO L87 Difference]: Start difference. First operand 2228 states and 2450 transitions. Second operand 10 states. [2019-01-12 03:30:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:28,067 INFO L93 Difference]: Finished difference Result 4927 states and 5459 transitions. [2019-01-12 03:30:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 03:30:28,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 344 [2019-01-12 03:30:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:28,081 INFO L225 Difference]: With dead ends: 4927 [2019-01-12 03:30:28,081 INFO L226 Difference]: Without dead ends: 2698 [2019-01-12 03:30:28,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:30:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-01-12 03:30:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2506. [2019-01-12 03:30:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-01-12 03:30:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2745 transitions. [2019-01-12 03:30:28,144 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2745 transitions. Word has length 344 [2019-01-12 03:30:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:28,145 INFO L480 AbstractCegarLoop]: Abstraction has 2506 states and 2745 transitions. [2019-01-12 03:30:28,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:30:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2745 transitions. [2019-01-12 03:30:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-01-12 03:30:28,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:30:28,151 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:30:28,151 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:30:28,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:30:28,152 INFO L82 PathProgramCache]: Analyzing trace with hash -918739027, now seen corresponding path program 1 times [2019-01-12 03:30:28,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:30:28,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:30:28,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:28,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:28,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:30:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:28,919 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2019-01-12 03:30:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 185 proven. 88 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-01-12 03:30:29,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:30:29,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:30:29,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:30:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:30:29,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:30:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 176 proven. 97 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-01-12 03:30:30,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:30:30,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-01-12 03:30:30,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 03:30:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 03:30:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:30:30,258 INFO L87 Difference]: Start difference. First operand 2506 states and 2745 transitions. Second operand 13 states. [2019-01-12 03:30:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:30:35,101 INFO L93 Difference]: Finished difference Result 6044 states and 6641 transitions. [2019-01-12 03:30:35,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 03:30:35,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 349 [2019-01-12 03:30:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:30:35,102 INFO L225 Difference]: With dead ends: 6044 [2019-01-12 03:30:35,103 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:30:35,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 345 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-01-12 03:30:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:30:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:30:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:30:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:30:35,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 349 [2019-01-12 03:30:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:30:35,112 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:30:35,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 03:30:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:30:35,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:30:35,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:30:35,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,300 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 131 [2019-01-12 03:30:35,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:30:35,476 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 131 [2019-01-12 03:30:37,056 WARN L181 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 123 DAG size of output: 62 [2019-01-12 03:30:37,512 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 62 [2019-01-12 03:30:37,516 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-01-12 03:30:37,516 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,516 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 03:30:37,517 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 03:30:37,518 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 03:30:37,518 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 03:30:37,518 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-01-12 03:30:37,518 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-01-12 03:30:37,518 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-01-12 03:30:37,518 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,518 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,518 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,519 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,519 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,519 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-01-12 03:30:37,519 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-01-12 03:30:37,519 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-01-12 03:30:37,519 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-01-12 03:30:37,519 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 03:30:37,519 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,520 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,521 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,521 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,521 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-01-12 03:30:37,521 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 03:30:37,521 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 03:30:37,521 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 03:30:37,521 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 03:30:37,521 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 03:30:37,522 INFO L444 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse6 (<= ~a19~0 8)) (.cse0 (<= ~a1~0 218)) (.cse1 (= ~a12~0 0)) (.cse2 (= ~a4~0 14)) (.cse3 (not (= 3 ~a10~0))) (.cse5 (= ~a19~0 9))) (or (and .cse0 .cse1 .cse2 (not (= ~a10~0 4)) .cse3) (and (exists ((v_prenex_2 Int)) (let ((.cse4 (* 5 (div v_prenex_2 5)))) (and (<= 23 v_prenex_2) (<= (+ (div .cse4 5) 505228) ~a1~0) (<= 0 .cse4) (<= 0 v_prenex_2)))) .cse5 .cse1 .cse2) (and .cse5 .cse1 (<= (+ ~a1~0 13) 0) .cse2) (and (not (= ~a19~0 6)) .cse6) (and .cse6 .cse1 (<= ~a1~0 33) .cse2) (and (not (= ~a10~0 3)) .cse6) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 (and .cse5 .cse1 .cse2)) (and .cse5 .cse1 .cse2 .cse3) (and (= ~a10~0 1) (not .cse5)))) [2019-01-12 03:30:37,522 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-01-12 03:30:37,522 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-01-12 03:30:37,522 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-01-12 03:30:37,523 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-01-12 03:30:37,523 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,523 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,523 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,523 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,523 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,523 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-01-12 03:30:37,523 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-01-12 03:30:37,523 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-01-12 03:30:37,524 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 03:30:37,524 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 03:30:37,524 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 03:30:37,524 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 03:30:37,524 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 03:30:37,524 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-01-12 03:30:37,524 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-01-12 03:30:37,524 INFO L451 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-01-12 03:30:37,524 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 03:30:37,525 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,526 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-01-12 03:30:37,527 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-01-12 03:30:37,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:30:37,528 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-01-12 03:30:37,528 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse6 (<= ~a19~0 8)) (.cse0 (<= ~a1~0 218)) (.cse1 (= ~a12~0 0)) (.cse2 (= ~a4~0 14)) (.cse3 (not (= 3 ~a10~0))) (.cse5 (= ~a19~0 9))) (or (and .cse0 .cse1 .cse2 (not (= ~a10~0 4)) .cse3) (and (exists ((v_prenex_2 Int)) (let ((.cse4 (* 5 (div v_prenex_2 5)))) (and (<= 23 v_prenex_2) (<= (+ (div .cse4 5) 505228) ~a1~0) (<= 0 .cse4) (<= 0 v_prenex_2)))) .cse5 .cse1 .cse2) (and .cse5 .cse1 (<= (+ ~a1~0 13) 0) .cse2) (and (not (= ~a19~0 6)) .cse6) (and .cse6 .cse1 (<= ~a1~0 33) .cse2) (and (not (= ~a10~0 3)) .cse6) (and (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 (and .cse5 .cse1 .cse2)) (and .cse5 .cse1 .cse2 .cse3) (and (= ~a10~0 1) (not .cse5)))) [2019-01-12 03:30:37,528 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-01-12 03:30:37,528 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,528 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,528 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,528 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 03:30:37,529 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 03:30:37,530 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 03:30:37,530 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 03:30:37,530 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-01-12 03:30:37,530 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-01-12 03:30:37,530 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-01-12 03:30:37,530 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-01-12 03:30:37,530 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,530 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 03:30:37,531 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-01-12 03:30:37,532 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,533 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,533 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,533 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,533 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,533 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,533 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-01-12 03:30:37,533 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 03:30:37,533 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 03:30:37,533 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 03:30:37,534 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 03:30:37,534 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 03:30:37,534 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:30:37,534 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 03:30:37,534 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-01-12 03:30:37,534 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-01-12 03:30:37,534 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-01-12 03:30:37,534 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-01-12 03:30:37,534 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-01-12 03:30:37,535 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-01-12 03:30:37,536 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-01-12 03:30:37,537 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 03:30:37,538 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 03:30:37,538 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 03:30:37,538 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 03:30:37,538 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 03:30:37,538 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 03:30:37,538 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-01-12 03:30:37,538 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-01-12 03:30:37,538 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-01-12 03:30:37,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:30:37 BoogieIcfgContainer [2019-01-12 03:30:37,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:30:37,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:30:37,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:30:37,586 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:30:37,587 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:30:01" (3/4) ... [2019-01-12 03:30:37,596 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:30:37,641 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:30:37,642 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:30:37,681 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a1 <= 218 && a12 == 0) && a4 == 14) && !(a10 == 4)) && !(3 == a10)) || ((((\exists v_prenex_2 : int :: ((23 <= v_prenex_2 && 5 * (v_prenex_2 / 5) / 5 + 505228 <= a1) && 0 <= 5 * (v_prenex_2 / 5)) && 0 <= v_prenex_2) && a19 == 9) && a12 == 0) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (!(a19 == 6) && a19 <= 8)) || (((a19 <= 8 && a12 == 0) && a1 <= 33) && a4 == 14)) || (!(a10 == 3) && a19 <= 8)) || ((!(5 == input) && a1 <= 218) && (a19 == 9 && a12 == 0) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a4 == 14) && !(3 == a10))) || (a10 == 1 && !(a19 == 9)) [2019-01-12 03:30:37,686 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a1 <= 218 && a12 == 0) && a4 == 14) && !(a10 == 4)) && !(3 == a10)) || ((((\exists v_prenex_2 : int :: ((23 <= v_prenex_2 && 5 * (v_prenex_2 / 5) / 5 + 505228 <= a1) && 0 <= 5 * (v_prenex_2 / 5)) && 0 <= v_prenex_2) && a19 == 9) && a12 == 0) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (!(a19 == 6) && a19 <= 8)) || (((a19 <= 8 && a12 == 0) && a1 <= 33) && a4 == 14)) || (!(a10 == 3) && a19 <= 8)) || ((!(5 == input) && a1 <= 218) && (a19 == 9 && a12 == 0) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a4 == 14) && !(3 == a10))) || (a10 == 1 && !(a19 == 9)) [2019-01-12 03:30:37,871 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:30:37,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:30:37,877 INFO L168 Benchmark]: Toolchain (without parser) took 40732.84 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 509.6 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -384.7 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:37,878 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:30:37,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.03 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:37,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 249.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:37,879 INFO L168 Benchmark]: Boogie Preprocessor took 142.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:30:37,879 INFO L168 Benchmark]: RCFGBuilder took 3116.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:37,882 INFO L168 Benchmark]: TraceAbstraction took 36073.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 379.6 MB). Free memory was 999.0 MB in the beginning and 1.3 GB in the end (delta: -347.2 MB). Peak memory consumption was 599.7 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:37,882 INFO L168 Benchmark]: Witness Printer took 286.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:30:37,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 848.03 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 249.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 142.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3116.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.0 MB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36073.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 379.6 MB). Free memory was 999.0 MB in the beginning and 1.3 GB in the end (delta: -347.2 MB). Peak memory consumption was 599.7 MB. Max. memory is 11.5 GB. * Witness Printer took 286.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 97]: 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: 582]: Loop Invariant [2019-01-12 03:30:37,901 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,907 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,908 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((a1 <= 218 && a12 == 0) && a4 == 14) && !(a10 == 4)) && !(3 == a10)) || ((((\exists v_prenex_2 : int :: ((23 <= v_prenex_2 && 5 * (v_prenex_2 / 5) / 5 + 505228 <= a1) && 0 <= 5 * (v_prenex_2 / 5)) && 0 <= v_prenex_2) && a19 == 9) && a12 == 0) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (!(a19 == 6) && a19 <= 8)) || (((a19 <= 8 && a12 == 0) && a1 <= 33) && a4 == 14)) || (!(a10 == 3) && a19 <= 8)) || ((!(5 == input) && a1 <= 218) && (a19 == 9 && a12 == 0) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a4 == 14) && !(3 == a10))) || (a10 == 1 && !(a19 == 9)) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 03:30:37,911 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,911 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,912 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,912 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,913 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,913 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:30:37,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((a1 <= 218 && a12 == 0) && a4 == 14) && !(a10 == 4)) && !(3 == a10)) || ((((\exists v_prenex_2 : int :: ((23 <= v_prenex_2 && 5 * (v_prenex_2 / 5) / 5 + 505228 <= a1) && 0 <= 5 * (v_prenex_2 / 5)) && 0 <= v_prenex_2) && a19 == 9) && a12 == 0) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a1 + 13 <= 0) && a4 == 14)) || (!(a19 == 6) && a19 <= 8)) || (((a19 <= 8 && a12 == 0) && a1 <= 33) && a4 == 14)) || (!(a10 == 3) && a19 <= 8)) || ((!(5 == input) && a1 <= 218) && (a19 == 9 && a12 == 0) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a4 == 14) && !(3 == a10))) || (a10 == 1 && !(a19 == 9)) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. SAFE Result, 35.9s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 3848 SDslu, 263 SDs, 0 SdLazy, 12753 SolverSat, 1691 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1097 GetRequests, 1026 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2506occurred in iteration=7, 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: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 913 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 110 NumberOfFragments, 279 HoareAnnotationTreeSize, 3 FomulaSimplifications, 47929 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3954 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2913 NumberOfCodeBlocks, 2913 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2902 ConstructedInterpolants, 102 QuantifiedInterpolants, 6296923 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1365 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 2057/2534 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...