java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label18.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:11:04,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:11:04,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:11:04,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:11:04,233 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:11:04,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:11:04,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:11:04,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:11:04,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:11:04,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:11:04,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:11:04,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:11:04,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:11:04,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:11:04,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:11:04,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:11:04,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:11:04,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:11:04,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:11:04,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:11:04,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:11:04,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:11:04,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:11:04,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:11:04,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:11:04,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:11:04,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:11:04,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:11:04,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:11:04,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:11:04,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:11:04,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:11:04,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:11:04,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:11:04,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:11:04,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:11:04,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:11:04,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:11:04,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:11:04,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:11:04,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:11:04,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 13:11:04,312 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:11:04,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:11:04,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:11:04,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:11:04,314 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:11:04,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:11:04,314 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:11:04,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:11:04,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:11:04,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:11:04,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:11:04,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:11:04,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:11:04,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:11:04,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:11:04,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:11:04,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:11:04,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:11:04,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:11:04,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:11:04,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:11:04,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:11:04,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:11:04,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:11:04,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:11:04,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:11:04,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:11:04,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:11:04,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:11:04,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:11:04,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:11:04,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:11:04,401 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:11:04,402 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:11:04,403 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label18.c [2019-09-07 13:11:04,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807cacc73/d962edc33ef745858d3a65dee36aee99/FLAGf726f2d80 [2019-09-07 13:11:05,119 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:11:05,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label18.c [2019-09-07 13:11:05,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807cacc73/d962edc33ef745858d3a65dee36aee99/FLAGf726f2d80 [2019-09-07 13:11:05,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807cacc73/d962edc33ef745858d3a65dee36aee99 [2019-09-07 13:11:05,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:11:05,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:11:05,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:11:05,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:11:05,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:11:05,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:11:05" (1/1) ... [2019-09-07 13:11:05,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62240cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:05, skipping insertion in model container [2019-09-07 13:11:05,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:11:05" (1/1) ... [2019-09-07 13:11:05,363 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:11:05,421 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:11:05,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:11:05,957 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:11:06,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:11:06,115 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:11:06,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06 WrapperNode [2019-09-07 13:11:06,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:11:06,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:11:06,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:11:06,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:11:06,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06" (1/1) ... [2019-09-07 13:11:06,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06" (1/1) ... [2019-09-07 13:11:06,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06" (1/1) ... [2019-09-07 13:11:06,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06" (1/1) ... [2019-09-07 13:11:06,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06" (1/1) ... [2019-09-07 13:11:06,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06" (1/1) ... [2019-09-07 13:11:06,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06" (1/1) ... [2019-09-07 13:11:06,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:11:06,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:11:06,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:11:06,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:11:06,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06" (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-09-07 13:11:06,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:11:06,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:11:06,340 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 13:11:06,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:11:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 13:11:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:11:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:11:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 13:11:06,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:11:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:11:06,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:11:07,690 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:11:07,694 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:11:07,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:11:07 BoogieIcfgContainer [2019-09-07 13:11:07,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:11:07,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:11:07,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:11:07,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:11:07,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:11:05" (1/3) ... [2019-09-07 13:11:07,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1943a1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:11:07, skipping insertion in model container [2019-09-07 13:11:07,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:11:06" (2/3) ... [2019-09-07 13:11:07,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1943a1e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:11:07, skipping insertion in model container [2019-09-07 13:11:07,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:11:07" (3/3) ... [2019-09-07 13:11:07,713 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label18.c [2019-09-07 13:11:07,722 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:11:07,730 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:11:07,744 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:11:07,776 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:11:07,777 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:11:07,777 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:11:07,777 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:11:07,777 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:11:07,777 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:11:07,777 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:11:07,778 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:11:07,778 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:11:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-09-07 13:11:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-07 13:11:07,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:07,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 13:11:07,822 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:07,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:07,827 INFO L82 PathProgramCache]: Analyzing trace with hash -427743519, now seen corresponding path program 1 times [2019-09-07 13:11:07,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:08,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:08,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:11:08,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:11:08,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:11:08,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:11:08,355 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-09-07 13:11:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:09,307 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-09-07 13:11:09,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:11:09,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-07 13:11:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:09,338 INFO L225 Difference]: With dead ends: 618 [2019-09-07 13:11:09,338 INFO L226 Difference]: Without dead ends: 320 [2019-09-07 13:11:09,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:11:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-07 13:11:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-07 13:11:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-07 13:11:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-09-07 13:11:09,455 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 133 [2019-09-07 13:11:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:09,456 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-09-07 13:11:09,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:11:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-09-07 13:11:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 13:11:09,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:09,462 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:11:09,463 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash -309931354, now seen corresponding path program 1 times [2019-09-07 13:11:09,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:09,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:09,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:09,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:09,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:11:09,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:11:09,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:11:09,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:11:09,914 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-09-07 13:11:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:10,607 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-09-07 13:11:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:11:10,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-09-07 13:11:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:10,615 INFO L225 Difference]: With dead ends: 721 [2019-09-07 13:11:10,615 INFO L226 Difference]: Without dead ends: 320 [2019-09-07 13:11:10,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:11:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-07 13:11:10,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-07 13:11:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-07 13:11:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-09-07 13:11:10,642 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 141 [2019-09-07 13:11:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:10,643 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-09-07 13:11:10,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:11:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-09-07 13:11:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 13:11:10,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:10,647 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:11:10,647 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash 325171058, now seen corresponding path program 1 times [2019-09-07 13:11:10,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:10,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:10,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:10,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:11,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:11,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:11:11,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:11:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:11:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:11:11,011 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-09-07 13:11:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:11,761 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-09-07 13:11:11,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:11:11,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-07 13:11:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:11,765 INFO L225 Difference]: With dead ends: 717 [2019-09-07 13:11:11,766 INFO L226 Difference]: Without dead ends: 320 [2019-09-07 13:11:11,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:11:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-07 13:11:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-09-07 13:11:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-07 13:11:11,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-09-07 13:11:11,786 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 147 [2019-09-07 13:11:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:11,787 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-09-07 13:11:11,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:11:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-09-07 13:11:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 13:11:11,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:11,791 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:11:11,791 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:11,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1977398583, now seen corresponding path program 1 times [2019-09-07 13:11:11,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:11,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:11,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:11,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:11,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:11,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:11,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:11:11,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:11:11,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:11:11,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:11:11,961 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-09-07 13:11:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:12,828 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-09-07 13:11:12,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:11:12,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-07 13:11:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:12,834 INFO L225 Difference]: With dead ends: 951 [2019-09-07 13:11:12,834 INFO L226 Difference]: Without dead ends: 637 [2019-09-07 13:11:12,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:11:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-09-07 13:11:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-09-07 13:11:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-07 13:11:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-09-07 13:11:12,870 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 155 [2019-09-07 13:11:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:12,870 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-09-07 13:11:12,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:11:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-09-07 13:11:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-07 13:11:12,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:12,874 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 13:11:12,875 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash -282643699, now seen corresponding path program 1 times [2019-09-07 13:11:12,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:12,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:12,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:13,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:13,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:11:13,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:11:13,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:11:13,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:11:13,090 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-09-07 13:11:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:13,851 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2019-09-07 13:11:13,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:11:13,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-07 13:11:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:13,856 INFO L225 Difference]: With dead ends: 1330 [2019-09-07 13:11:13,857 INFO L226 Difference]: Without dead ends: 626 [2019-09-07 13:11:13,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:11:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-07 13:11:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-07 13:11:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-07 13:11:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-09-07 13:11:13,884 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 157 [2019-09-07 13:11:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:13,884 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-09-07 13:11:13,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:11:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-09-07 13:11:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 13:11:13,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:13,889 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 13:11:13,889 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash -440018095, now seen corresponding path program 1 times [2019-09-07 13:11:13,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:13,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:13,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:13,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:13,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:14,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:14,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:11:14,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:11:14,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:11:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:11:14,147 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-09-07 13:11:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:14,882 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2019-09-07 13:11:14,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:11:14,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-09-07 13:11:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:14,888 INFO L225 Difference]: With dead ends: 1332 [2019-09-07 13:11:14,888 INFO L226 Difference]: Without dead ends: 626 [2019-09-07 13:11:14,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:11:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-07 13:11:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-07 13:11:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-07 13:11:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-09-07 13:11:14,911 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 159 [2019-09-07 13:11:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:14,912 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-09-07 13:11:14,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:11:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-09-07 13:11:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-07 13:11:14,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:14,916 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 13:11:14,916 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:14,917 INFO L82 PathProgramCache]: Analyzing trace with hash -988582951, now seen corresponding path program 1 times [2019-09-07 13:11:14,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:14,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:14,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:14,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:14,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:15,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:15,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:11:15,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:11:15,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:11:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:11:15,002 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-09-07 13:11:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:15,748 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2019-09-07 13:11:15,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:11:15,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-07 13:11:15,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:15,766 INFO L225 Difference]: With dead ends: 1858 [2019-09-07 13:11:15,767 INFO L226 Difference]: Without dead ends: 1238 [2019-09-07 13:11:15,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:11:15,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-09-07 13:11:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-09-07 13:11:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-09-07 13:11:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-09-07 13:11:15,829 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 163 [2019-09-07 13:11:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:15,829 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-09-07 13:11:15,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:11:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-09-07 13:11:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-07 13:11:15,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:15,835 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 13:11:15,835 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1094001216, now seen corresponding path program 1 times [2019-09-07 13:11:15,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:15,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:15,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:15,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:15,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:16,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:11:16,182 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-09-07 13:11:16,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:16,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:11:16,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:11:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 13:11:16,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:11:16,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-09-07 13:11:16,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:11:16,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:11:16,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:11:16,504 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 11 states. [2019-09-07 13:11:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:19,098 INFO L93 Difference]: Finished difference Result 3662 states and 5134 transitions. [2019-09-07 13:11:19,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 13:11:19,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 168 [2019-09-07 13:11:19,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:19,118 INFO L225 Difference]: With dead ends: 3662 [2019-09-07 13:11:19,118 INFO L226 Difference]: Without dead ends: 2450 [2019-09-07 13:11:19,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=540, Unknown=0, NotChecked=0, Total=756 [2019-09-07 13:11:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2019-09-07 13:11:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2410. [2019-09-07 13:11:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2019-09-07 13:11:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3127 transitions. [2019-09-07 13:11:19,214 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3127 transitions. Word has length 168 [2019-09-07 13:11:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:19,215 INFO L475 AbstractCegarLoop]: Abstraction has 2410 states and 3127 transitions. [2019-09-07 13:11:19,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:11:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3127 transitions. [2019-09-07 13:11:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-07 13:11:19,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:19,227 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 13:11:19,227 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:19,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2028700589, now seen corresponding path program 1 times [2019-09-07 13:11:19,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:19,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:19,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 123 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:19,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:11:19,518 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-09-07 13:11:19,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:19,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:11:19,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:11:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 13:11:19,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:11:19,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 13:11:19,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:11:19,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:11:19,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:11:19,760 INFO L87 Difference]: Start difference. First operand 2410 states and 3127 transitions. Second operand 14 states. [2019-09-07 13:11:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:23,060 INFO L93 Difference]: Finished difference Result 5251 states and 6855 transitions. [2019-09-07 13:11:23,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 13:11:23,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 245 [2019-09-07 13:11:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:23,061 INFO L225 Difference]: With dead ends: 5251 [2019-09-07 13:11:23,061 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:11:23,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2019-09-07 13:11:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:11:23,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:11:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:11:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:11:23,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 245 [2019-09-07 13:11:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:23,074 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:11:23,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:11:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:11:23,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:11:23,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:11:23,735 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 53 [2019-09-07 13:11:23,950 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-07 13:11:24,197 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-07 13:11:24,200 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:11:24,201 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-09-07 13:11:24,201 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:11:24,201 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,201 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,201 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,201 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,201 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,202 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-09-07 13:11:24,202 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-09-07 13:11:24,202 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-09-07 13:11:24,202 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-09-07 13:11:24,202 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-09-07 13:11:24,202 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-09-07 13:11:24,202 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-09-07 13:11:24,203 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-09-07 13:11:24,203 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-09-07 13:11:24,203 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-09-07 13:11:24,203 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-09-07 13:11:24,203 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-09-07 13:11:24,203 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-09-07 13:11:24,204 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,204 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,204 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,204 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,204 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-09-07 13:11:24,204 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,204 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-09-07 13:11:24,204 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-09-07 13:11:24,205 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-09-07 13:11:24,205 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-09-07 13:11:24,205 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-09-07 13:11:24,205 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-09-07 13:11:24,205 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-09-07 13:11:24,205 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-09-07 13:11:24,205 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-09-07 13:11:24,206 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-09-07 13:11:24,206 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-09-07 13:11:24,206 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-09-07 13:11:24,206 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-09-07 13:11:24,206 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-09-07 13:11:24,230 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-09-07 13:11:24,230 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,230 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,230 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-09-07 13:11:24,231 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-09-07 13:11:24,232 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,233 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,234 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,234 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,234 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-09-07 13:11:24,234 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-09-07 13:11:24,234 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-09-07 13:11:24,234 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-09-07 13:11:24,234 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-09-07 13:11:24,234 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,235 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,236 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,236 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-09-07 13:11:24,236 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,236 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-09-07 13:11:24,236 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,236 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-09-07 13:11:24,236 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-09-07 13:11:24,236 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-09-07 13:11:24,236 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,237 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,237 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-09-07 13:11:24,237 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-09-07 13:11:24,237 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-09-07 13:11:24,237 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-09-07 13:11:24,237 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-09-07 13:11:24,237 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-09-07 13:11:24,237 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-09-07 13:11:24,237 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-09-07 13:11:24,238 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,239 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,240 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,240 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-09-07 13:11:24,240 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-09-07 13:11:24,240 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-09-07 13:11:24,240 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-09-07 13:11:24,240 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-09-07 13:11:24,240 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-09-07 13:11:24,240 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-09-07 13:11:24,240 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-09-07 13:11:24,241 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-09-07 13:11:24,241 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-09-07 13:11:24,241 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-09-07 13:11:24,241 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 553) no Hoare annotation was computed. [2019-09-07 13:11:24,241 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-09-07 13:11:24,241 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-09-07 13:11:24,241 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-09-07 13:11:24,242 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,242 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,242 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,242 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse10 (= ~a11~0 |old(~a11~0)|)) (.cse11 (= ~a19~0 |old(~a19~0)|)) (.cse12 (= ~a28~0 |old(~a28~0)|)) (.cse13 (= ~a25~0 |old(~a25~0)|))) (let ((.cse8 (= 8 |old(~a28~0)|)) (.cse1 (= 1 |old(~a25~0)|)) (.cse7 (not (<= |old(~a28~0)| 10))) (.cse9 (and .cse10 (= ~a17~0 |old(~a17~0)|) .cse11 .cse12 .cse13)) (.cse5 (= 9 |old(~a28~0)|)) (.cse0 (not (= 1 ~a21~0))) (.cse6 (= 1 |old(~a11~0)|)) (.cse2 (not (= 1 |old(~a19~0)|))) (.cse4 (= ~a17~0 8)) (.cse3 (not (= 8 |old(~a17~0)|)))) (and (or .cse0 (not .cse1) .cse2 .cse3 (and (= ~a28~0 9) .cse4 (= ~a19~0 1) (= ~a25~0 1) (= ~a11~0 1)) (not .cse5) (not .cse6)) (or .cse7 .cse0 .cse8 .cse9 (not (<= |old(~a17~0)| 7))) (or .cse7 .cse0 .cse8 .cse5 .cse3 .cse9) (or .cse7 .cse0 .cse9 .cse8 .cse3 .cse1) (or .cse7 .cse0 .cse6 .cse9 .cse5 .cse3) (or .cse0 .cse6 .cse2 (and .cse10 .cse4 .cse11 .cse12 .cse13) .cse3)))) [2019-09-07 13:11:24,243 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,243 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,243 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,243 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-09-07 13:11:24,243 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-09-07 13:11:24,243 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-09-07 13:11:24,243 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-09-07 13:11:24,244 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-09-07 13:11:24,244 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-09-07 13:11:24,244 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-09-07 13:11:24,244 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-09-07 13:11:24,244 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-09-07 13:11:24,244 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-09-07 13:11:24,244 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-09-07 13:11:24,244 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-09-07 13:11:24,245 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-09-07 13:11:24,246 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,247 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,247 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,247 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,247 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-09-07 13:11:24,247 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-09-07 13:11:24,247 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-09-07 13:11:24,247 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-09-07 13:11:24,247 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-09-07 13:11:24,247 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-09-07 13:11:24,248 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-09-07 13:11:24,248 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-09-07 13:11:24,248 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-09-07 13:11:24,248 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-09-07 13:11:24,248 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-09-07 13:11:24,248 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-09-07 13:11:24,248 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-09-07 13:11:24,248 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-09-07 13:11:24,248 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-09-07 13:11:24,249 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-09-07 13:11:24,249 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-09-07 13:11:24,249 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-09-07 13:11:24,249 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-09-07 13:11:24,249 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-09-07 13:11:24,249 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:11:24,249 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a25~0 1)) (<= ~a28~0 10) (not (= ~a28~0 8)) (= ~a17~0 8) (= ~a19~0 1) (= ~a21~0 1) (not (= ~a11~0 1)) (not (= ~a28~0 9))) [2019-09-07 13:11:24,249 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:11:24,250 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:11:24,250 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (<= |old(~a28~0)| 10)) (not (= 1 ~a21~0)) (= 1 |old(~a11~0)|) (and (= ~a11~0 |old(~a11~0)|) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (= 9 |old(~a28~0)|) (not (= 8 |old(~a17~0)|)) (= 1 |old(~a25~0)|)) [2019-09-07 13:11:24,250 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse6 (= ~a28~0 9))) (let ((.cse4 (= ~a17~0 8)) (.cse5 (= ~a19~0 1)) (.cse2 (not (= ~a28~0 8))) (.cse0 (= ~a17~0 |old(~a17~0)|)) (.cse1 (<= ~a28~0 10)) (.cse3 (not .cse6))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (not (= ~a11~0 1))) (= 9 |old(~a28~0)|) (and .cse6 .cse4 .cse5) (and .cse0 (not (= ~a25~0 1)) .cse1 .cse2) (= 1 |old(~a25~0)|) (not (<= |old(~a28~0)| 10)) (= 1 |old(~a11~0)|) (and (<= ~a17~0 7) .cse1 .cse2) (not (= 1 |old(~a19~0)|)) (and (not (= 1 ~a11~0)) .cse0 .cse1 .cse3) (= 8 |old(~a28~0)|) (not (= 8 |old(~a17~0)|))))) [2019-09-07 13:11:24,250 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-09-07 13:11:24,250 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-09-07 13:11:24,250 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (= ~a28~0 9))) (let ((.cse4 (= ~a17~0 8)) (.cse5 (= ~a19~0 1)) (.cse2 (not (= ~a28~0 8))) (.cse0 (= ~a17~0 |old(~a17~0)|)) (.cse1 (<= ~a28~0 10)) (.cse3 (not .cse6))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (not (= ~a11~0 1))) (= 9 |old(~a28~0)|) (and .cse6 .cse4 .cse5) (and .cse0 (not (= ~a25~0 1)) .cse1 .cse2) (= 1 |old(~a25~0)|) (not (<= |old(~a28~0)| 10)) (= 1 |old(~a11~0)|) (and (<= ~a17~0 7) .cse1 .cse2) (not (= 1 |old(~a19~0)|)) (and (not (= 1 ~a11~0)) .cse0 .cse1 .cse3) (= 8 |old(~a28~0)|) (not (= 8 |old(~a17~0)|))))) [2019-09-07 13:11:24,251 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-09-07 13:11:24,251 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-09-07 13:11:24,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:11:24 BoogieIcfgContainer [2019-09-07 13:11:24,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:11:24,274 INFO L168 Benchmark]: Toolchain (without parser) took 18931.78 ms. Allocated memory was 140.0 MB in the beginning and 546.8 MB in the end (delta: 406.8 MB). Free memory was 86.5 MB in the beginning and 494.0 MB in the end (delta: -407.6 MB). Peak memory consumption was 361.3 MB. Max. memory is 7.1 GB. [2019-09-07 13:11:24,275 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 13:11:24,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.17 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 86.0 MB in the beginning and 169.1 MB in the end (delta: -83.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2019-09-07 13:11:24,277 INFO L168 Benchmark]: Boogie Preprocessor took 129.66 ms. Allocated memory is still 202.9 MB. Free memory was 169.1 MB in the beginning and 163.9 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2019-09-07 13:11:24,278 INFO L168 Benchmark]: RCFGBuilder took 1449.86 ms. Allocated memory was 202.9 MB in the beginning and 227.5 MB in the end (delta: 24.6 MB). Free memory was 163.9 MB in the beginning and 181.2 MB in the end (delta: -17.4 MB). Peak memory consumption was 91.3 MB. Max. memory is 7.1 GB. [2019-09-07 13:11:24,279 INFO L168 Benchmark]: TraceAbstraction took 16574.05 ms. Allocated memory was 227.5 MB in the beginning and 546.8 MB in the end (delta: 319.3 MB). Free memory was 181.2 MB in the beginning and 494.0 MB in the end (delta: -312.8 MB). Peak memory consumption was 368.5 MB. Max. memory is 7.1 GB. [2019-09-07 13:11:24,283 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.17 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 86.0 MB in the beginning and 169.1 MB in the end (delta: -83.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.66 ms. Allocated memory is still 202.9 MB. Free memory was 169.1 MB in the beginning and 163.9 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1449.86 ms. Allocated memory was 202.9 MB in the beginning and 227.5 MB in the end (delta: 24.6 MB). Free memory was 163.9 MB in the beginning and 181.2 MB in the end (delta: -17.4 MB). Peak memory consumption was 91.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16574.05 ms. Allocated memory was 227.5 MB in the beginning and 546.8 MB in the end (delta: 319.3 MB). Free memory was 181.2 MB in the beginning and 494.0 MB in the end (delta: -312.8 MB). Peak memory consumption was 368.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 553]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == a21) || (((a17 == \old(a17) && a28 <= 10) && !(a28 == 8)) && !(a28 == 9))) || ((a17 == 8 && a19 == 1) && !(a11 == 1))) || 9 == \old(a28)) || ((a28 == 9 && a17 == 8) && a19 == 1)) || (((a17 == \old(a17) && !(a25 == 1)) && a28 <= 10) && !(a28 == 8))) || 1 == \old(a25)) || !(\old(a28) <= 10)) || 1 == \old(a11)) || ((a17 <= 7 && a28 <= 10) && !(a28 == 8))) || !(1 == \old(a19))) || (((!(1 == a11) && a17 == \old(a17)) && a28 <= 10) && !(a28 == 9))) || 8 == \old(a28)) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 16.4s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 514 SDtfs, 7104 SDslu, 567 SDs, 0 SdLazy, 7427 SolverSat, 1915 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 557 GetRequests, 471 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2410occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 71 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 75 PreInvPairs, 127 NumberOfFragments, 514 HoareAnnotationTreeSize, 75 FomulaSimplifications, 3588 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1655 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1881 NumberOfCodeBlocks, 1881 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1870 ConstructedInterpolants, 0 QuantifiedInterpolants, 1786907 SizeOfPredicates, 3 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 437/488 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...