./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem16_label45_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/Problem16_label45_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 b47e6efaac96dd68fdf2e956514ab24129d0709d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:42:33,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:42:33,134 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:42:33,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:42:33,147 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:42:33,148 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:42:33,149 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:42:33,152 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:42:33,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:42:33,154 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:42:33,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:42:33,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:42:33,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:42:33,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:42:33,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:42:33,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:42:33,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:42:33,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:42:33,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:42:33,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:42:33,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:42:33,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:42:33,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:42:33,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:42:33,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:42:33,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:42:33,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:42:33,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:42:33,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:42:33,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:42:33,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:42:33,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:42:33,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:42:33,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:42:33,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:42:33,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:42:33,210 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:42:33,236 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:42:33,236 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:42:33,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:42:33,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:42:33,238 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:42:33,238 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:42:33,239 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:42:33,239 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:42:33,239 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:42:33,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:42:33,239 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:42:33,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:42:33,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:42:33,240 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:42:33,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:42:33,240 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:42:33,240 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:42:33,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:42:33,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:42:33,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:42:33,242 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:42:33,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:42:33,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:42:33,243 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:42:33,243 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:42:33,243 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:42:33,243 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:42:33,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:42:33,245 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 -> b47e6efaac96dd68fdf2e956514ab24129d0709d [2019-01-12 04:42:33,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:42:33,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:42:33,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:42:33,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:42:33,309 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:42:33,311 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem16_label45_true-unreach-call.c [2019-01-12 04:42:33,369 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f15e9c1c/9cb76b90f4af48b98c77513d3825c22c/FLAG3703f449c [2019-01-12 04:42:33,995 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:42:33,995 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem16_label45_true-unreach-call.c [2019-01-12 04:42:34,015 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f15e9c1c/9cb76b90f4af48b98c77513d3825c22c/FLAG3703f449c [2019-01-12 04:42:34,142 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f15e9c1c/9cb76b90f4af48b98c77513d3825c22c [2019-01-12 04:42:34,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:42:34,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:42:34,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:42:34,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:42:34,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:42:34,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:42:34" (1/1) ... [2019-01-12 04:42:34,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4f5252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:34, skipping insertion in model container [2019-01-12 04:42:34,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:42:34" (1/1) ... [2019-01-12 04:42:34,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:42:34,231 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:42:34,892 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:42:34,897 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:42:35,207 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:42:35,385 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:42:35,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35 WrapperNode [2019-01-12 04:42:35,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:42:35,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:42:35,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:42:35,387 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:42:35,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... [2019-01-12 04:42:35,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... [2019-01-12 04:42:35,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:42:35,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:42:35,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:42:35,629 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:42:35,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... [2019-01-12 04:42:35,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... [2019-01-12 04:42:35,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... [2019-01-12 04:42:35,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... [2019-01-12 04:42:35,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... [2019-01-12 04:42:35,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... [2019-01-12 04:42:35,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... [2019-01-12 04:42:35,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:42:35,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:42:35,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:42:35,814 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:42:35,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:42:35,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:42:35,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:42:41,307 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:42:41,308 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:42:41,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:42:41 BoogieIcfgContainer [2019-01-12 04:42:41,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:42:41,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:42:41,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:42:41,315 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:42:41,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:42:34" (1/3) ... [2019-01-12 04:42:41,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e00ec92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:42:41, skipping insertion in model container [2019-01-12 04:42:41,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:42:35" (2/3) ... [2019-01-12 04:42:41,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e00ec92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:42:41, skipping insertion in model container [2019-01-12 04:42:41,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:42:41" (3/3) ... [2019-01-12 04:42:41,320 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label45_true-unreach-call.c [2019-01-12 04:42:41,330 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:42:41,339 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:42:41,358 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:42:41,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:42:41,399 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:42:41,400 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:42:41,400 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:42:41,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:42:41,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:42:41,400 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:42:41,400 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:42:41,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:42:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-01-12 04:42:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 04:42:41,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:42:41,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:42:41,445 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:42:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:42:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2019-01-12 04:42:41,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:42:41,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:42:41,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:41,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:41,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:41,897 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 04:42:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:42:41,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:42:41,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:42:41,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:42:42,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:42:42,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:42:42,014 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2019-01-12 04:42:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:42:46,988 INFO L93 Difference]: Finished difference Result 1454 states and 2762 transitions. [2019-01-12 04:42:46,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:42:46,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-12 04:42:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:42:47,029 INFO L225 Difference]: With dead ends: 1454 [2019-01-12 04:42:47,029 INFO L226 Difference]: Without dead ends: 991 [2019-01-12 04:42:47,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:42:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-01-12 04:42:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-01-12 04:42:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-01-12 04:42:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1555 transitions. [2019-01-12 04:42:47,153 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1555 transitions. Word has length 53 [2019-01-12 04:42:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:42:47,154 INFO L480 AbstractCegarLoop]: Abstraction has 991 states and 1555 transitions. [2019-01-12 04:42:47,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:42:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1555 transitions. [2019-01-12 04:42:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 04:42:47,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:42:47,164 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:42:47,165 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:42:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:42:47,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1686833650, now seen corresponding path program 1 times [2019-01-12 04:42:47,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:42:47,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:42:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:47,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:47,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:42:47,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:42:47,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:42:47,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:42:47,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:42:47,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:42:47,584 INFO L87 Difference]: Start difference. First operand 991 states and 1555 transitions. Second operand 5 states. [2019-01-12 04:42:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:42:51,499 INFO L93 Difference]: Finished difference Result 2967 states and 4660 transitions. [2019-01-12 04:42:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:42:51,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-01-12 04:42:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:42:51,516 INFO L225 Difference]: With dead ends: 2967 [2019-01-12 04:42:51,517 INFO L226 Difference]: Without dead ends: 1978 [2019-01-12 04:42:51,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 04:42:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-01-12 04:42:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2019-01-12 04:42:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-01-12 04:42:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2801 transitions. [2019-01-12 04:42:51,570 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2801 transitions. Word has length 121 [2019-01-12 04:42:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:42:51,571 INFO L480 AbstractCegarLoop]: Abstraction has 1978 states and 2801 transitions. [2019-01-12 04:42:51,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:42:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2801 transitions. [2019-01-12 04:42:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-01-12 04:42:51,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:42:51,580 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:42:51,580 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:42:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:42:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1689727149, now seen corresponding path program 1 times [2019-01-12 04:42:51,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:42:51,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:42:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:51,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 04:42:52,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:42:52,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:42:52,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:52,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:42:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:42:52,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:42:52,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-01-12 04:42:52,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:42:52,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:42:52,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:42:52,340 INFO L87 Difference]: Start difference. First operand 1978 states and 2801 transitions. Second operand 4 states. [2019-01-12 04:43:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:00,654 INFO L93 Difference]: Finished difference Result 7902 states and 11196 transitions. [2019-01-12 04:43:00,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:43:00,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-01-12 04:43:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:00,689 INFO L225 Difference]: With dead ends: 7902 [2019-01-12 04:43:00,690 INFO L226 Difference]: Without dead ends: 5926 [2019-01-12 04:43:00,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-01-12 04:43:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 3952. [2019-01-12 04:43:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2019-01-12 04:43:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5369 transitions. [2019-01-12 04:43:00,778 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5369 transitions. Word has length 288 [2019-01-12 04:43:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:00,780 INFO L480 AbstractCegarLoop]: Abstraction has 3952 states and 5369 transitions. [2019-01-12 04:43:00,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:43:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5369 transitions. [2019-01-12 04:43:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-01-12 04:43:00,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:00,788 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:43:00,789 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:00,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 139861487, now seen corresponding path program 1 times [2019-01-12 04:43:00,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:00,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:00,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:00,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:01,252 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 19 [2019-01-12 04:43:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-12 04:43:01,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:43:01,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:43:01,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:43:01,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:43:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:43:01,522 INFO L87 Difference]: Start difference. First operand 3952 states and 5369 transitions. Second operand 7 states. [2019-01-12 04:43:05,707 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-12 04:43:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:09,063 INFO L93 Difference]: Finished difference Result 8269 states and 11121 transitions. [2019-01-12 04:43:09,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:43:09,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 343 [2019-01-12 04:43:09,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:09,094 INFO L225 Difference]: With dead ends: 8269 [2019-01-12 04:43:09,094 INFO L226 Difference]: Without dead ends: 4319 [2019-01-12 04:43:09,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:43:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2019-01-12 04:43:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 4281. [2019-01-12 04:43:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-01-12 04:43:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5704 transitions. [2019-01-12 04:43:09,185 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5704 transitions. Word has length 343 [2019-01-12 04:43:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:09,187 INFO L480 AbstractCegarLoop]: Abstraction has 4281 states and 5704 transitions. [2019-01-12 04:43:09,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:43:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5704 transitions. [2019-01-12 04:43:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-01-12 04:43:09,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:09,199 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:09,200 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash -492956799, now seen corresponding path program 1 times [2019-01-12 04:43:09,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:09,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:09,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-12 04:43:09,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:43:09,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:43:09,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:43:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:43:09,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:43:09,583 INFO L87 Difference]: Start difference. First operand 4281 states and 5704 transitions. Second operand 3 states. [2019-01-12 04:43:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:11,500 INFO L93 Difference]: Finished difference Result 12179 states and 16437 transitions. [2019-01-12 04:43:11,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:43:11,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 430 [2019-01-12 04:43:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:11,531 INFO L225 Difference]: With dead ends: 12179 [2019-01-12 04:43:11,532 INFO L226 Difference]: Without dead ends: 6255 [2019-01-12 04:43:11,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:43:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2019-01-12 04:43:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 5926. [2019-01-12 04:43:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-01-12 04:43:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 6485 transitions. [2019-01-12 04:43:11,633 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 6485 transitions. Word has length 430 [2019-01-12 04:43:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:11,633 INFO L480 AbstractCegarLoop]: Abstraction has 5926 states and 6485 transitions. [2019-01-12 04:43:11,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:43:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 6485 transitions. [2019-01-12 04:43:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-01-12 04:43:11,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:11,644 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:43:11,644 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:11,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1084367381, now seen corresponding path program 1 times [2019-01-12 04:43:11,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:11,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:11,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:43:11,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:43:11,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:43:11,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:43:11,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:43:11,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:11,939 INFO L87 Difference]: Start difference. First operand 5926 states and 6485 transitions. Second operand 4 states. [2019-01-12 04:43:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:14,179 INFO L93 Difference]: Finished difference Result 13495 states and 14822 transitions. [2019-01-12 04:43:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:43:14,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-01-12 04:43:14,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:14,207 INFO L225 Difference]: With dead ends: 13495 [2019-01-12 04:43:14,208 INFO L226 Difference]: Without dead ends: 7900 [2019-01-12 04:43:14,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2019-01-12 04:43:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7242. [2019-01-12 04:43:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7242 states. [2019-01-12 04:43:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 7787 transitions. [2019-01-12 04:43:14,330 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 7787 transitions. Word has length 447 [2019-01-12 04:43:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:14,331 INFO L480 AbstractCegarLoop]: Abstraction has 7242 states and 7787 transitions. [2019-01-12 04:43:14,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:43:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 7787 transitions. [2019-01-12 04:43:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-01-12 04:43:14,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:14,350 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:14,354 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash -947048121, now seen corresponding path program 1 times [2019-01-12 04:43:14,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:14,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:14,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:14,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:14,812 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 04:43:15,151 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-12 04:43:15,525 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-01-12 04:43:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 456 proven. 64 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-12 04:43:16,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:43:16,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:43:16,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:16,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:43:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-01-12 04:43:16,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:43:16,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-01-12 04:43:16,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 04:43:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 04:43:16,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:43:16,843 INFO L87 Difference]: Start difference. First operand 7242 states and 7787 transitions. Second operand 10 states. [2019-01-12 04:43:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:23,506 INFO L93 Difference]: Finished difference Result 17457 states and 18695 transitions. [2019-01-12 04:43:23,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 04:43:23,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 586 [2019-01-12 04:43:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:23,526 INFO L225 Difference]: With dead ends: 17457 [2019-01-12 04:43:23,527 INFO L226 Difference]: Without dead ends: 10546 [2019-01-12 04:43:23,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2019-01-12 04:43:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10546 states. [2019-01-12 04:43:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10546 to 9874. [2019-01-12 04:43:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-01-12 04:43:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10405 transitions. [2019-01-12 04:43:23,666 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10405 transitions. Word has length 586 [2019-01-12 04:43:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:23,667 INFO L480 AbstractCegarLoop]: Abstraction has 9874 states and 10405 transitions. [2019-01-12 04:43:23,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 04:43:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10405 transitions. [2019-01-12 04:43:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2019-01-12 04:43:23,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:23,678 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:23,679 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1463765033, now seen corresponding path program 1 times [2019-01-12 04:43:23,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:23,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:23,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:23,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:23,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-01-12 04:43:24,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:43:24,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:43:24,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:43:24,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:43:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:24,340 INFO L87 Difference]: Start difference. First operand 9874 states and 10405 transitions. Second operand 4 states. [2019-01-12 04:43:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:27,485 INFO L93 Difference]: Finished difference Result 22049 states and 23209 transitions. [2019-01-12 04:43:27,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:43:27,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 666 [2019-01-12 04:43:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:27,510 INFO L225 Difference]: With dead ends: 22049 [2019-01-12 04:43:27,510 INFO L226 Difference]: Without dead ends: 12177 [2019-01-12 04:43:27,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2019-01-12 04:43:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 9874. [2019-01-12 04:43:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9874 states. [2019-01-12 04:43:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9874 states to 9874 states and 10341 transitions. [2019-01-12 04:43:27,680 INFO L78 Accepts]: Start accepts. Automaton has 9874 states and 10341 transitions. Word has length 666 [2019-01-12 04:43:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:27,681 INFO L480 AbstractCegarLoop]: Abstraction has 9874 states and 10341 transitions. [2019-01-12 04:43:27,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:43:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 9874 states and 10341 transitions. [2019-01-12 04:43:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2019-01-12 04:43:27,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:27,700 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:27,701 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:27,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:27,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1348188237, now seen corresponding path program 1 times [2019-01-12 04:43:27,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:27,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:27,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:27,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:27,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1427 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2019-01-12 04:43:28,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:43:28,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:43:28,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:43:28,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:43:28,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:28,369 INFO L87 Difference]: Start difference. First operand 9874 states and 10341 transitions. Second operand 4 states. [2019-01-12 04:43:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:30,306 INFO L93 Difference]: Finished difference Result 22049 states and 23091 transitions. [2019-01-12 04:43:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:43:30,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 945 [2019-01-12 04:43:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:30,323 INFO L225 Difference]: With dead ends: 22049 [2019-01-12 04:43:30,323 INFO L226 Difference]: Without dead ends: 12177 [2019-01-12 04:43:30,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2019-01-12 04:43:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2019-01-12 04:43:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-01-12 04:43:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12646 transitions. [2019-01-12 04:43:30,502 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12646 transitions. Word has length 945 [2019-01-12 04:43:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:30,503 INFO L480 AbstractCegarLoop]: Abstraction has 12177 states and 12646 transitions. [2019-01-12 04:43:30,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:43:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12646 transitions. [2019-01-12 04:43:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2019-01-12 04:43:30,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:30,543 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:30,543 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1437504205, now seen corresponding path program 1 times [2019-01-12 04:43:30,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:30,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:30,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3078 backedges. 2131 proven. 0 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-01-12 04:43:32,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:43:32,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:43:32,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:43:32,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:43:32,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:32,100 INFO L87 Difference]: Start difference. First operand 12177 states and 12646 transitions. Second operand 4 states. [2019-01-12 04:43:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:34,162 INFO L93 Difference]: Finished difference Result 25010 states and 25972 transitions. [2019-01-12 04:43:34,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:43:34,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1280 [2019-01-12 04:43:34,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:34,190 INFO L225 Difference]: With dead ends: 25010 [2019-01-12 04:43:34,190 INFO L226 Difference]: Without dead ends: 12835 [2019-01-12 04:43:34,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2019-01-12 04:43:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12506. [2019-01-12 04:43:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-01-12 04:43:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12871 transitions. [2019-01-12 04:43:34,375 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12871 transitions. Word has length 1280 [2019-01-12 04:43:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:34,377 INFO L480 AbstractCegarLoop]: Abstraction has 12506 states and 12871 transitions. [2019-01-12 04:43:34,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:43:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12871 transitions. [2019-01-12 04:43:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1282 [2019-01-12 04:43:34,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:34,424 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:34,427 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 553184258, now seen corresponding path program 1 times [2019-01-12 04:43:34,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:34,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:34,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:34,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:34,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:35,192 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 04:43:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 1594 proven. 467 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2019-01-12 04:43:36,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:43:36,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:43:36,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:36,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:43:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 1848 proven. 0 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2019-01-12 04:43:38,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:43:38,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:43:38,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:43:38,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:43:38,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:43:38,545 INFO L87 Difference]: Start difference. First operand 12506 states and 12871 transitions. Second operand 9 states. [2019-01-12 04:43:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:41,351 INFO L93 Difference]: Finished difference Result 25444 states and 26176 transitions. [2019-01-12 04:43:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:43:41,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1281 [2019-01-12 04:43:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:41,368 INFO L225 Difference]: With dead ends: 25444 [2019-01-12 04:43:41,368 INFO L226 Difference]: Without dead ends: 12940 [2019-01-12 04:43:41,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1292 GetRequests, 1282 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:43:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12940 states. [2019-01-12 04:43:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12940 to 12506. [2019-01-12 04:43:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-01-12 04:43:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12824 transitions. [2019-01-12 04:43:41,529 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12824 transitions. Word has length 1281 [2019-01-12 04:43:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:41,531 INFO L480 AbstractCegarLoop]: Abstraction has 12506 states and 12824 transitions. [2019-01-12 04:43:41,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:43:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12824 transitions. [2019-01-12 04:43:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1448 [2019-01-12 04:43:41,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:41,577 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:41,580 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1726997540, now seen corresponding path program 1 times [2019-01-12 04:43:41,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:41,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:42,534 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 04:43:42,856 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-12 04:43:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4081 backedges. 1903 proven. 242 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-01-12 04:43:45,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:43:45,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:43:45,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:46,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:43:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4081 backedges. 1903 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2019-01-12 04:43:47,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:43:47,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2019-01-12 04:43:47,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:43:47,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:43:47,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:43:47,765 INFO L87 Difference]: Start difference. First operand 12506 states and 12824 transitions. Second operand 9 states. [2019-01-12 04:43:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:54,158 INFO L93 Difference]: Finished difference Result 27317 states and 28010 transitions. [2019-01-12 04:43:54,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:43:54,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1447 [2019-01-12 04:43:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:54,172 INFO L225 Difference]: With dead ends: 27317 [2019-01-12 04:43:54,172 INFO L226 Difference]: Without dead ends: 14813 [2019-01-12 04:43:54,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1461 GetRequests, 1446 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:43:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14813 states. [2019-01-12 04:43:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14813 to 12506. [2019-01-12 04:43:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-01-12 04:43:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12821 transitions. [2019-01-12 04:43:54,335 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12821 transitions. Word has length 1447 [2019-01-12 04:43:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:54,337 INFO L480 AbstractCegarLoop]: Abstraction has 12506 states and 12821 transitions. [2019-01-12 04:43:54,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:43:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12821 transitions. [2019-01-12 04:43:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1478 [2019-01-12 04:43:54,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:54,372 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:54,372 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:54,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:54,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1682721022, now seen corresponding path program 1 times [2019-01-12 04:43:54,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:54,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:54,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:54,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:55,030 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-12 04:43:55,351 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2019-01-12 04:43:55,729 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 04:43:55,937 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2019-01-12 04:43:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4798 backedges. 1996 proven. 157 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2019-01-12 04:43:57,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:43:57,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:43:57,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:58,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:43:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4798 backedges. 2153 proven. 0 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2019-01-12 04:43:59,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:43:59,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-01-12 04:43:59,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:43:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:43:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:43:59,407 INFO L87 Difference]: Start difference. First operand 12506 states and 12821 transitions. Second operand 9 states. [2019-01-12 04:44:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:06,810 INFO L93 Difference]: Finished difference Result 34680 states and 35572 transitions. [2019-01-12 04:44:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 04:44:06,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1477 [2019-01-12 04:44:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:06,829 INFO L225 Difference]: With dead ends: 34680 [2019-01-12 04:44:06,830 INFO L226 Difference]: Without dead ends: 22176 [2019-01-12 04:44:06,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1503 GetRequests, 1485 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-01-12 04:44:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22176 states. [2019-01-12 04:44:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22176 to 16783. [2019-01-12 04:44:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16783 states. [2019-01-12 04:44:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17169 transitions. [2019-01-12 04:44:07,141 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17169 transitions. Word has length 1477 [2019-01-12 04:44:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:07,142 INFO L480 AbstractCegarLoop]: Abstraction has 16783 states and 17169 transitions. [2019-01-12 04:44:07,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:44:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17169 transitions. [2019-01-12 04:44:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1731 [2019-01-12 04:44:07,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:07,180 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:44:07,180 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1358453474, now seen corresponding path program 1 times [2019-01-12 04:44:07,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:07,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:07,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:08,071 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 04:44:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5458 backedges. 3789 proven. 0 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2019-01-12 04:44:10,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:44:10,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:44:10,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:44:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:44:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:44:10,637 INFO L87 Difference]: Start difference. First operand 16783 states and 17169 transitions. Second operand 5 states. [2019-01-12 04:44:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:13,237 INFO L93 Difference]: Finished difference Result 33896 states and 34672 transitions. [2019-01-12 04:44:13,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:44:13,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1730 [2019-01-12 04:44:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:13,254 INFO L225 Difference]: With dead ends: 33896 [2019-01-12 04:44:13,255 INFO L226 Difference]: Without dead ends: 17115 [2019-01-12 04:44:13,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:44:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17115 states. [2019-01-12 04:44:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17115 to 16783. [2019-01-12 04:44:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16783 states. [2019-01-12 04:44:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17167 transitions. [2019-01-12 04:44:13,450 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17167 transitions. Word has length 1730 [2019-01-12 04:44:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:13,451 INFO L480 AbstractCegarLoop]: Abstraction has 16783 states and 17167 transitions. [2019-01-12 04:44:13,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:44:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17167 transitions. [2019-01-12 04:44:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1987 [2019-01-12 04:44:13,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:13,480 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:44:13,480 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:13,481 INFO L82 PathProgramCache]: Analyzing trace with hash 461220889, now seen corresponding path program 1 times [2019-01-12 04:44:13,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:13,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:13,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:14,792 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-12 04:44:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7242 backedges. 3417 proven. 249 refuted. 0 times theorem prover too weak. 3576 trivial. 0 not checked. [2019-01-12 04:44:20,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:44:20,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:44:20,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:20,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:44:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7242 backedges. 4373 proven. 0 refuted. 0 times theorem prover too weak. 2869 trivial. 0 not checked. [2019-01-12 04:44:22,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:44:22,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-01-12 04:44:22,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 04:44:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 04:44:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:44:22,914 INFO L87 Difference]: Start difference. First operand 16783 states and 17167 transitions. Second operand 10 states. [2019-01-12 04:44:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:33,548 INFO L93 Difference]: Finished difference Result 38848 states and 39733 transitions. [2019-01-12 04:44:33,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 04:44:33,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1986 [2019-01-12 04:44:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:33,569 INFO L225 Difference]: With dead ends: 38848 [2019-01-12 04:44:33,569 INFO L226 Difference]: Without dead ends: 19480 [2019-01-12 04:44:33,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2012 GetRequests, 1991 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-12 04:44:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19480 states. [2019-01-12 04:44:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19480 to 19349. [2019-01-12 04:44:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19349 states. [2019-01-12 04:44:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19349 states to 19349 states and 19734 transitions. [2019-01-12 04:44:33,743 INFO L78 Accepts]: Start accepts. Automaton has 19349 states and 19734 transitions. Word has length 1986 [2019-01-12 04:44:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:33,744 INFO L480 AbstractCegarLoop]: Abstraction has 19349 states and 19734 transitions. [2019-01-12 04:44:33,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 04:44:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 19349 states and 19734 transitions. [2019-01-12 04:44:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2302 [2019-01-12 04:44:33,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:33,779 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:44:33,779 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:33,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2111276462, now seen corresponding path program 1 times [2019-01-12 04:44:33,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:33,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:33,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:33,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:33,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:34,686 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 04:44:34,896 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-12 04:44:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10380 backedges. 5702 proven. 2056 refuted. 0 times theorem prover too weak. 2622 trivial. 0 not checked. [2019-01-12 04:44:38,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:44:38,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:44:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:38,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:44:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10380 backedges. 5835 proven. 0 refuted. 0 times theorem prover too weak. 4545 trivial. 0 not checked. [2019-01-12 04:44:40,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:44:40,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-01-12 04:44:40,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 04:44:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 04:44:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:44:40,944 INFO L87 Difference]: Start difference. First operand 19349 states and 19734 transitions. Second operand 11 states. [2019-01-12 04:44:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:48,076 INFO L93 Difference]: Finished difference Result 39354 states and 40138 transitions. [2019-01-12 04:44:48,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:44:48,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 2301 [2019-01-12 04:44:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:48,099 INFO L225 Difference]: With dead ends: 39354 [2019-01-12 04:44:48,100 INFO L226 Difference]: Without dead ends: 20994 [2019-01-12 04:44:48,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2316 GetRequests, 2303 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-12 04:44:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20994 states. [2019-01-12 04:44:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20994 to 19678. [2019-01-12 04:44:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19678 states. [2019-01-12 04:44:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19678 states to 19678 states and 20034 transitions. [2019-01-12 04:44:48,299 INFO L78 Accepts]: Start accepts. Automaton has 19678 states and 20034 transitions. Word has length 2301 [2019-01-12 04:44:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:48,301 INFO L480 AbstractCegarLoop]: Abstraction has 19678 states and 20034 transitions. [2019-01-12 04:44:48,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 04:44:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 19678 states and 20034 transitions. [2019-01-12 04:44:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2515 [2019-01-12 04:44:48,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:48,357 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:44:48,358 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1259897281, now seen corresponding path program 1 times [2019-01-12 04:44:48,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:48,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:48,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:48,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:48,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:49,581 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 04:44:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11811 backedges. 5679 proven. 569 refuted. 0 times theorem prover too weak. 5563 trivial. 0 not checked. [2019-01-12 04:44:53,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:44:53,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:44:53,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:54,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:44:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11811 backedges. 5784 proven. 464 refuted. 0 times theorem prover too weak. 5563 trivial. 0 not checked. [2019-01-12 04:44:58,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:44:58,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2019-01-12 04:44:58,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:44:58,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:44:58,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:44:58,066 INFO L87 Difference]: Start difference. First operand 19678 states and 20034 transitions. Second operand 9 states. [2019-01-12 04:44:58,476 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-12 04:45:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:45:03,217 INFO L93 Difference]: Finished difference Result 41038 states and 41790 transitions. [2019-01-12 04:45:03,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 04:45:03,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2514 [2019-01-12 04:45:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:45:03,236 INFO L225 Difference]: With dead ends: 41038 [2019-01-12 04:45:03,236 INFO L226 Difference]: Without dead ends: 22349 [2019-01-12 04:45:03,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2527 GetRequests, 2514 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:45:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22349 states. [2019-01-12 04:45:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22349 to 20304. [2019-01-12 04:45:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20304 states. [2019-01-12 04:45:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20304 states to 20304 states and 20636 transitions. [2019-01-12 04:45:03,451 INFO L78 Accepts]: Start accepts. Automaton has 20304 states and 20636 transitions. Word has length 2514 [2019-01-12 04:45:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:45:03,452 INFO L480 AbstractCegarLoop]: Abstraction has 20304 states and 20636 transitions. [2019-01-12 04:45:03,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:45:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 20304 states and 20636 transitions. [2019-01-12 04:45:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2542 [2019-01-12 04:45:03,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:45:03,513 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:45:03,513 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:45:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:45:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1616626033, now seen corresponding path program 1 times [2019-01-12 04:45:03,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:45:03,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:45:03,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:45:03,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:45:03,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:45:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:45:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11255 backedges. 1308 proven. 51 refuted. 0 times theorem prover too weak. 9896 trivial. 0 not checked. [2019-01-12 04:45:06,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:45:06,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:45:06,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:45:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:45:07,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:45:10,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11255 backedges. 1308 proven. 51 refuted. 0 times theorem prover too weak. 9896 trivial. 0 not checked. [2019-01-12 04:45:10,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:45:10,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-01-12 04:45:10,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:45:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:45:10,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:45:10,131 INFO L87 Difference]: Start difference. First operand 20304 states and 20636 transitions. Second operand 6 states. [2019-01-12 04:45:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:45:13,672 INFO L93 Difference]: Finished difference Result 45161 states and 45933 transitions. [2019-01-12 04:45:13,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:45:13,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2541 [2019-01-12 04:45:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:45:13,674 INFO L225 Difference]: With dead ends: 45161 [2019-01-12 04:45:13,674 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:45:13,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2545 GetRequests, 2540 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:45:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:45:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:45:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:45:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:45:13,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2541 [2019-01-12 04:45:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:45:13,688 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:45:13,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:45:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:45:13,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:45:13,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:45:13,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:14,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:14,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:14,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:14,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:14,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,302 WARN L181 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 603 DAG size of output: 480 [2019-01-12 04:45:15,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:15,697 WARN L181 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 277 [2019-01-12 04:45:15,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:45:16,511 WARN L181 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 606 DAG size of output: 481 [2019-01-12 04:45:20,517 WARN L181 SmtUtils]: Spent 4.00 s on a formula simplification. DAG size of input: 458 DAG size of output: 89 [2019-01-12 04:45:22,570 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 262 DAG size of output: 84 [2019-01-12 04:45:26,333 WARN L181 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 458 DAG size of output: 89 [2019-01-12 04:45:26,337 INFO L448 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,337 INFO L448 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,337 INFO L448 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,337 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,337 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,337 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,337 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,337 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,337 INFO L448 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:45:26,338 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:45:26,343 INFO L444 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse17 (= ~a12~0 6))) (let ((.cse16 (<= (+ ~a18~0 79) 0)) (.cse15 (<= ~a16~0 11)) (.cse8 (not (= 8 ~a12~0))) (.cse4 (not (= ~a16~0 10))) (.cse18 (not .cse17)) (.cse2 (= ~a15~0 3))) (let ((.cse0 (<= ~a18~0 134)) (.cse9 (<= 12 ~a16~0)) (.cse13 (not (= 7 ~a12~0))) (.cse1 (< 0 (+ ~a18~0 156))) (.cse11 (= ~a12~0 8)) (.cse5 (= ~a12~0 7)) (.cse12 (and .cse15 .cse8 .cse4 .cse18 .cse2)) (.cse10 (<= ~a16~0 9)) (.cse6 (= ~a16~0 8)) (.cse14 (and .cse18 .cse16)) (.cse7 (= ~a15~0 4)) (.cse3 (= ~a12~0 5))) (or (and .cse0 .cse1 (and .cse2 .cse3)) (and .cse1 (and .cse4 .cse5 .cse2)) (and .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse1) (and .cse7 .cse0 .cse10 .cse11 .cse1) (and .cse0 .cse12 .cse13) (and .cse10 (and .cse7 .cse8 .cse14)) (and .cse7 .cse15 .cse16 .cse3) (and .cse6 .cse2) (and .cse2 (<= 594219 ~a18~0) .cse17) (and (and .cse9 (and .cse18 .cse2)) .cse13) (and (and (and .cse2 .cse16) .cse1) .cse17) (and .cse15 .cse2 (< 134 ~a18~0) .cse17) (and .cse7 .cse15 .cse17) (and .cse2 .cse11) (and (and .cse7 .cse5) .cse10) (and (<= (+ ~a18~0 18726) 0) .cse15 .cse2 .cse17) (and .cse12 .cse10) (and .cse7 (and .cse6 .cse14)) (and .cse7 .cse15 .cse3 (exists ((v_~a18~0_903 Int)) (and (< 0 (+ v_~a18~0_903 156)) (= ~a18~0 (+ (* 3 v_~a18~0_903) 599175)) (<= (+ v_~a18~0_903 79) 0)))))))) [2019-01-12 04:45:26,343 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,343 INFO L448 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,343 INFO L448 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,344 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,345 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,346 INFO L448 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,346 INFO L448 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,351 INFO L448 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L444 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse15 (= ~a12~0 6))) (let ((.cse7 (= ~a16~0 11)) (.cse5 (= ~a12~0 8)) (.cse11 (= ~a12~0 7)) (.cse10 (not (= 7 ~a12~0))) (.cse12 (<= ~a16~0 11)) (.cse13 (= ~a12~0 5)) (.cse3 (<= ~a18~0 134)) (.cse6 (< 0 (+ ~a18~0 156))) (.cse0 (= ~a16~0 8)) (.cse1 (= ~a15~0 4)) (.cse2 (not (= 8 ~a12~0))) (.cse4 (<= ~a16~0 9)) (.cse14 (<= (+ ~a18~0 79) 0)) (.cse17 (<= 12 ~a16~0)) (.cse8 (not .cse15)) (.cse9 (= ~a15~0 3)) (.cse16 (< 134 ~a18~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse9 .cse10) (and .cse6 .cse7 .cse9 .cse11) (and .cse1 .cse12 (and .cse13 .cse14)) (and .cse8 .cse9 .cse4) (and .cse9 .cse5) (and .cse0 .cse9) (and .cse9 (<= 594219 ~a18~0) .cse15) (and (and (and .cse9 .cse6) .cse15) .cse14) (and .cse12 .cse9 .cse16 .cse15) (and .cse1 .cse12 .cse15) (and .cse1 .cse11 .cse4) (and .cse1 .cse12 .cse13 (exists ((v_~a18~0_903 Int)) (and (< 0 (+ v_~a18~0_903 156)) (= ~a18~0 (+ (* 3 v_~a18~0_903) 599175)) (<= (+ v_~a18~0_903 79) 0)))) (and (and .cse17 (and .cse8 .cse9)) .cse10) (and (<= (+ ~a18~0 18726) 0) .cse12 .cse9 .cse15) (and .cse3 .cse6 (and .cse9 .cse13)) (and .cse17 .cse9 .cse3 .cse6) (and .cse1 (and .cse0 .cse14)) (and .cse1 .cse2 .cse4 .cse14) (and .cse17 .cse8 .cse9 .cse16)))) [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,352 INFO L448 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:45:26,353 INFO L448 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L451 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,354 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,355 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,356 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:45:26,357 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:45:26,357 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:45:26,357 INFO L444 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse17 (= ~a12~0 6))) (let ((.cse16 (<= (+ ~a18~0 79) 0)) (.cse15 (<= ~a16~0 11)) (.cse8 (not (= 8 ~a12~0))) (.cse4 (not (= ~a16~0 10))) (.cse18 (not .cse17)) (.cse2 (= ~a15~0 3))) (let ((.cse0 (<= ~a18~0 134)) (.cse9 (<= 12 ~a16~0)) (.cse13 (not (= 7 ~a12~0))) (.cse1 (< 0 (+ ~a18~0 156))) (.cse11 (= ~a12~0 8)) (.cse5 (= ~a12~0 7)) (.cse12 (and .cse15 .cse8 .cse4 .cse18 .cse2)) (.cse10 (<= ~a16~0 9)) (.cse6 (= ~a16~0 8)) (.cse14 (and .cse18 .cse16)) (.cse7 (= ~a15~0 4)) (.cse3 (= ~a12~0 5))) (or (and .cse0 .cse1 (and .cse2 .cse3)) (and .cse1 (and .cse4 .cse5 .cse2)) (and .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse2 .cse1) (and .cse7 .cse0 .cse10 .cse11 .cse1) (and .cse0 .cse12 .cse13) (and .cse10 (and .cse7 .cse8 .cse14)) (and .cse7 .cse15 .cse16 .cse3) (and .cse6 .cse2) (and .cse2 (<= 594219 ~a18~0) .cse17) (and (and .cse9 (and .cse18 .cse2)) .cse13) (and (and (and .cse2 .cse16) .cse1) .cse17) (and .cse15 .cse2 (< 134 ~a18~0) .cse17) (and .cse7 .cse15 .cse17) (and .cse2 .cse11) (and (and .cse7 .cse5) .cse10) (and (<= (+ ~a18~0 18726) 0) .cse15 .cse2 .cse17) (and .cse12 .cse10) (and .cse7 (and .cse6 .cse14)) (and .cse7 .cse15 .cse3 (exists ((v_~a18~0_903 Int)) (and (< 0 (+ v_~a18~0_903 156)) (= ~a18~0 (+ (* 3 v_~a18~0_903) 599175)) (<= (+ v_~a18~0_903 79) 0)))))))) [2019-01-12 04:45:26,357 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,357 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,357 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,357 INFO L448 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,357 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,357 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,358 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:45:26,359 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:45:26,360 INFO L448 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,360 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,360 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,361 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,362 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:45:26,363 INFO L448 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,364 INFO L448 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,365 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,366 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,367 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,368 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:45:26,369 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:45:26,369 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:45:26,369 INFO L448 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,369 INFO L448 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,369 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,369 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,369 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,369 INFO L448 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,369 INFO L448 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,370 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,371 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,371 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,372 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2019-01-12 04:45:26,372 INFO L448 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,372 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,373 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,374 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,376 INFO L448 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,376 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,376 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,376 INFO L448 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,376 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,376 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,377 INFO L448 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,378 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,379 INFO L448 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,380 INFO L448 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,387 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,387 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:45:26,387 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:45:26,387 INFO L448 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,387 INFO L448 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,387 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,387 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,387 INFO L448 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:45:26,388 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,389 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,390 INFO L448 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,391 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,391 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,394 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,394 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,394 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,394 INFO L448 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,394 INFO L448 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,394 INFO L448 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,394 INFO L448 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,394 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,394 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,395 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,396 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,399 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,400 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:45:26,400 INFO L448 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,400 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:45:26,400 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:45:26,400 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:45:26,400 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,400 INFO L448 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-01-12 04:45:26,400 INFO L448 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,400 INFO L448 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-01-12 04:45:26,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,463 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:45:26 BoogieIcfgContainer [2019-01-12 04:45:26,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:45:26,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:45:26,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:45:26,480 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:45:26,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:42:41" (3/4) ... [2019-01-12 04:45:26,490 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:45:26,549 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:45:26,553 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:45:26,589 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a18 <= 134 && 0 < a18 + 156) && a15 == 3 && a12 == 5) || (0 < a18 + 156 && (!(a16 == 10) && a12 == 7) && a15 == 3)) || ((a16 == 8 && a15 == 4) && !(8 == a12))) || (((12 <= a16 && a18 <= 134) && a15 == 3) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 156)) || ((a18 <= 134 && (((a16 <= 11 && !(8 == a12)) && !(a16 == 10)) && !(a12 == 6)) && a15 == 3) && !(7 == a12))) || (a16 <= 9 && (a15 == 4 && !(8 == a12)) && !(a12 == 6) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && a18 + 79 <= 0) && a12 == 5)) || (a16 == 8 && a15 == 3)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || ((12 <= a16 && !(a12 == 6) && a15 == 3) && !(7 == a12))) || (((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (((a16 <= 11 && a15 == 3) && 134 < a18) && a12 == 6)) || ((a15 == 4 && a16 <= 11) && a12 == 6)) || (a15 == 3 && a12 == 8)) || ((a15 == 4 && a12 == 7) && a16 <= 9)) || (((a18 + 18726 <= 0 && a16 <= 11) && a15 == 3) && a12 == 6)) || (((((a16 <= 11 && !(8 == a12)) && !(a16 == 10)) && !(a12 == 6)) && a15 == 3) && a16 <= 9)) || (a15 == 4 && a16 == 8 && !(a12 == 6) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && a12 == 5) && (\exists v_~a18~0_903 : int :: (0 < v_~a18~0_903 + 156 && a18 == 3 * v_~a18~0_903 + 599175) && v_~a18~0_903 + 79 <= 0)) [2019-01-12 04:45:26,594 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a18 <= 134 && 0 < a18 + 156) && a15 == 3 && a12 == 5) || (0 < a18 + 156 && (!(a16 == 10) && a12 == 7) && a15 == 3)) || ((a16 == 8 && a15 == 4) && !(8 == a12))) || (((12 <= a16 && a18 <= 134) && a15 == 3) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 156)) || ((a18 <= 134 && (((a16 <= 11 && !(8 == a12)) && !(a16 == 10)) && !(a12 == 6)) && a15 == 3) && !(7 == a12))) || (a16 <= 9 && (a15 == 4 && !(8 == a12)) && !(a12 == 6) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && a18 + 79 <= 0) && a12 == 5)) || (a16 == 8 && a15 == 3)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || ((12 <= a16 && !(a12 == 6) && a15 == 3) && !(7 == a12))) || (((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (((a16 <= 11 && a15 == 3) && 134 < a18) && a12 == 6)) || ((a15 == 4 && a16 <= 11) && a12 == 6)) || (a15 == 3 && a12 == 8)) || ((a15 == 4 && a12 == 7) && a16 <= 9)) || (((a18 + 18726 <= 0 && a16 <= 11) && a15 == 3) && a12 == 6)) || (((((a16 <= 11 && !(8 == a12)) && !(a16 == 10)) && !(a12 == 6)) && a15 == 3) && a16 <= 9)) || (a15 == 4 && a16 == 8 && !(a12 == 6) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && a12 == 5) && (\exists v_~a18~0_903 : int :: (0 < v_~a18~0_903 + 156 && a18 == 3 * v_~a18~0_903 + 599175) && v_~a18~0_903 + 79 <= 0)) [2019-01-12 04:45:26,610 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((a16 == 8 && a15 == 4) && !(8 == a12)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 156)) || ((((a16 == 11 && !(a12 == 6)) && a18 <= 134) && a15 == 3) && !(7 == a12))) || (((0 < a18 + 156 && a16 == 11) && a15 == 3) && a12 == 7)) || ((a15 == 4 && a16 <= 11) && a12 == 5 && a18 + 79 <= 0)) || ((!(a12 == 6) && a15 == 3) && a16 <= 9)) || (a15 == 3 && a12 == 8)) || (a16 == 8 && a15 == 3)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || (((a15 == 3 && 0 < a18 + 156) && a12 == 6) && a18 + 79 <= 0)) || (((a16 <= 11 && a15 == 3) && 134 < a18) && a12 == 6)) || ((a15 == 4 && a16 <= 11) && a12 == 6)) || ((a15 == 4 && a12 == 7) && a16 <= 9)) || (((a15 == 4 && a16 <= 11) && a12 == 5) && (\exists v_~a18~0_903 : int :: (0 < v_~a18~0_903 + 156 && a18 == 3 * v_~a18~0_903 + 599175) && v_~a18~0_903 + 79 <= 0))) || ((12 <= a16 && !(a12 == 6) && a15 == 3) && !(7 == a12))) || (((a18 + 18726 <= 0 && a16 <= 11) && a15 == 3) && a12 == 6)) || ((a18 <= 134 && 0 < a18 + 156) && a15 == 3 && a12 == 5)) || (((12 <= a16 && a15 == 3) && a18 <= 134) && 0 < a18 + 156)) || (a15 == 4 && a16 == 8 && a18 + 79 <= 0)) || (((a15 == 4 && !(8 == a12)) && a16 <= 9) && a18 + 79 <= 0)) || (((12 <= a16 && !(a12 == 6)) && a15 == 3) && 134 < a18) [2019-01-12 04:45:26,803 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:45:26,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:45:26,804 INFO L168 Benchmark]: Toolchain (without parser) took 172657.84 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -55.8 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-01-12 04:45:26,806 INFO L168 Benchmark]: CDTParser took 0.19 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 04:45:26,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1238.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 945.9 MB in the beginning and 1.2 GB in the end (delta: -213.8 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2019-01-12 04:45:26,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 241.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:45:26,807 INFO L168 Benchmark]: Boogie Preprocessor took 184.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:45:26,807 INFO L168 Benchmark]: RCFGBuilder took 5497.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 863.4 MB in the end (delta: 258.6 MB). Peak memory consumption was 258.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:45:26,808 INFO L168 Benchmark]: TraceAbstraction took 165168.27 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 863.4 MB in the beginning and 1.1 GB in the end (delta: -219.8 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-01-12 04:45:26,811 INFO L168 Benchmark]: Witness Printer took 323.29 ms. Allocated memory is still 5.0 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:45:26,815 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1238.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 945.9 MB in the beginning and 1.2 GB in the end (delta: -213.8 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 241.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 184.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5497.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 863.4 MB in the end (delta: 258.6 MB). Peak memory consumption was 258.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 165168.27 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 863.4 MB in the beginning and 1.1 GB in the end (delta: -219.8 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 323.29 ms. Allocated memory is still 5.0 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.5 MB). Peak memory consumption was 81.5 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_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:45:26,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a18 <= 134 && 0 < a18 + 156) && a15 == 3 && a12 == 5) || (0 < a18 + 156 && (!(a16 == 10) && a12 == 7) && a15 == 3)) || ((a16 == 8 && a15 == 4) && !(8 == a12))) || (((12 <= a16 && a18 <= 134) && a15 == 3) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 156)) || ((a18 <= 134 && (((a16 <= 11 && !(8 == a12)) && !(a16 == 10)) && !(a12 == 6)) && a15 == 3) && !(7 == a12))) || (a16 <= 9 && (a15 == 4 && !(8 == a12)) && !(a12 == 6) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && a18 + 79 <= 0) && a12 == 5)) || (a16 == 8 && a15 == 3)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || ((12 <= a16 && !(a12 == 6) && a15 == 3) && !(7 == a12))) || (((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (((a16 <= 11 && a15 == 3) && 134 < a18) && a12 == 6)) || ((a15 == 4 && a16 <= 11) && a12 == 6)) || (a15 == 3 && a12 == 8)) || ((a15 == 4 && a12 == 7) && a16 <= 9)) || (((a18 + 18726 <= 0 && a16 <= 11) && a15 == 3) && a12 == 6)) || (((((a16 <= 11 && !(8 == a12)) && !(a16 == 10)) && !(a12 == 6)) && a15 == 3) && a16 <= 9)) || (a15 == 4 && a16 == 8 && !(a12 == 6) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && a12 == 5) && (\exists v_~a18~0_903 : int :: (0 < v_~a18~0_903 + 156 && a18 == 3 * v_~a18~0_903 + 599175) && v_~a18~0_903 + 79 <= 0)) - InvariantResult [Line: 1494]: Loop Invariant [2019-01-12 04:45:26,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((a16 == 8 && a15 == 4) && !(8 == a12)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 156)) || ((((a16 == 11 && !(a12 == 6)) && a18 <= 134) && a15 == 3) && !(7 == a12))) || (((0 < a18 + 156 && a16 == 11) && a15 == 3) && a12 == 7)) || ((a15 == 4 && a16 <= 11) && a12 == 5 && a18 + 79 <= 0)) || ((!(a12 == 6) && a15 == 3) && a16 <= 9)) || (a15 == 3 && a12 == 8)) || (a16 == 8 && a15 == 3)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || (((a15 == 3 && 0 < a18 + 156) && a12 == 6) && a18 + 79 <= 0)) || (((a16 <= 11 && a15 == 3) && 134 < a18) && a12 == 6)) || ((a15 == 4 && a16 <= 11) && a12 == 6)) || ((a15 == 4 && a12 == 7) && a16 <= 9)) || (((a15 == 4 && a16 <= 11) && a12 == 5) && (\exists v_~a18~0_903 : int :: (0 < v_~a18~0_903 + 156 && a18 == 3 * v_~a18~0_903 + 599175) && v_~a18~0_903 + 79 <= 0))) || ((12 <= a16 && !(a12 == 6) && a15 == 3) && !(7 == a12))) || (((a18 + 18726 <= 0 && a16 <= 11) && a15 == 3) && a12 == 6)) || ((a18 <= 134 && 0 < a18 + 156) && a15 == 3 && a12 == 5)) || (((12 <= a16 && a15 == 3) && a18 <= 134) && 0 < a18 + 156)) || (a15 == 4 && a16 == 8 && a18 + 79 <= 0)) || (((a15 == 4 && !(8 == a12)) && a16 <= 9) && a18 + 79 <= 0)) || (((12 <= a16 && !(a12 == 6)) && a15 == 3) && 134 < a18) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant [2019-01-12 04:45:26,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,844 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] [2019-01-12 04:45:26,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a18~0_903,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a18 <= 134 && 0 < a18 + 156) && a15 == 3 && a12 == 5) || (0 < a18 + 156 && (!(a16 == 10) && a12 == 7) && a15 == 3)) || ((a16 == 8 && a15 == 4) && !(8 == a12))) || (((12 <= a16 && a18 <= 134) && a15 == 3) && 0 < a18 + 156)) || ((((a15 == 4 && a18 <= 134) && a16 <= 9) && a12 == 8) && 0 < a18 + 156)) || ((a18 <= 134 && (((a16 <= 11 && !(8 == a12)) && !(a16 == 10)) && !(a12 == 6)) && a15 == 3) && !(7 == a12))) || (a16 <= 9 && (a15 == 4 && !(8 == a12)) && !(a12 == 6) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && a18 + 79 <= 0) && a12 == 5)) || (a16 == 8 && a15 == 3)) || ((a15 == 3 && 594219 <= a18) && a12 == 6)) || ((12 <= a16 && !(a12 == 6) && a15 == 3) && !(7 == a12))) || (((a15 == 3 && a18 + 79 <= 0) && 0 < a18 + 156) && a12 == 6)) || (((a16 <= 11 && a15 == 3) && 134 < a18) && a12 == 6)) || ((a15 == 4 && a16 <= 11) && a12 == 6)) || (a15 == 3 && a12 == 8)) || ((a15 == 4 && a12 == 7) && a16 <= 9)) || (((a18 + 18726 <= 0 && a16 <= 11) && a15 == 3) && a12 == 6)) || (((((a16 <= 11 && !(8 == a12)) && !(a16 == 10)) && !(a12 == 6)) && a15 == 3) && a16 <= 9)) || (a15 == 4 && a16 == 8 && !(a12 == 6) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && a12 == 5) && (\exists v_~a18~0_903 : int :: (0 < v_~a18~0_903 + 156 && a18 == 3 * v_~a18~0_903 + 599175) && v_~a18~0_903 + 79 <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. SAFE Result, 165.0s OverallTime, 18 OverallIterations, 13 TraceHistogramMax, 88.9s AutomataDifference, 0.0s DeadEndRemovalTime, 12.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 2245 SDtfs, 25245 SDslu, 614 SDs, 0 SdLazy, 60738 SolverSat, 4202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14589 GetRequests, 14450 SyntacticMatches, 24 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20304occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 18261 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 281 NumberOfFragments, 944 HoareAnnotationTreeSize, 4 FomulaSimplifications, 139426 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 104468 FormulaSimplificationTreeSizeReductionInter, 9.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 34857 NumberOfCodeBlocks, 34857 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 34830 ConstructedInterpolants, 69 QuantifiedInterpolants, 175020171 SizeOfPredicates, 8 NumberOfNonLiveVariables, 16560 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 114376/118760 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...