java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:20:18,312 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:20:18,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:20:18,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:20:18,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:20:18,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:20:18,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:20:18,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:20:18,337 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:20:18,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:20:18,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:20:18,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:20:18,340 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:20:18,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:20:18,342 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:20:18,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:20:18,344 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:20:18,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:20:18,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:20:18,349 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:20:18,350 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:20:18,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:20:18,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:20:18,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:20:18,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:20:18,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:20:18,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:20:18,362 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:20:18,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:20:18,367 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:20:18,368 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:20:18,368 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:20:18,368 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:20:18,369 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:20:18,370 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:20:18,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:20:18,371 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:20:18,403 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:20:18,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:20:18,404 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:20:18,405 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:20:18,405 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:20:18,405 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:20:18,405 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:20:18,406 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:20:18,406 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:20:18,406 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:20:18,406 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:20:18,406 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:20:18,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:20:18,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:20:18,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:20:18,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:20:18,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:20:18,413 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:20:18,413 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:20:18,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:20:18,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:20:18,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:20:18,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:20:18,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:20:18,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:20:18,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:20:18,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:20:18,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:20:18,416 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:20:18,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:20:18,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:20:18,416 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:20:18,416 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:20:18,417 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:20:18,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:20:18,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:20:18,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:20:18,486 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:20:18,486 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:20:18,487 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c [2018-10-27 12:20:18,558 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f5e8184c/0ac319efd7e743af9f30d1f1a70927cf/FLAG62075c539 [2018-10-27 12:20:19,141 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:20:19,142 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c [2018-10-27 12:20:19,160 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f5e8184c/0ac319efd7e743af9f30d1f1a70927cf/FLAG62075c539 [2018-10-27 12:20:19,179 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4f5e8184c/0ac319efd7e743af9f30d1f1a70927cf [2018-10-27 12:20:19,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:20:19,194 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:20:19,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:20:19,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:20:19,199 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:20:19,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:19,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180ddc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19, skipping insertion in model container [2018-10-27 12:20:19,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:19,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:20:19,279 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:20:19,771 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:20:19,778 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:20:19,912 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:20:19,934 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:20:19,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19 WrapperNode [2018-10-27 12:20:19,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:20:19,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:20:19,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:20:19,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:20:19,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:19,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:20,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:20:20,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:20:20,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:20:20,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:20:20,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:20,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:20,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:20,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:20,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:20,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:20,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... [2018-10-27 12:20:20,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:20:20,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:20:20,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:20:20,272 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:20:20,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:20:20,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:20:20,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:20:20,342 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:20:20,342 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:20:20,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:20:20,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:20:20,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:20:20,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:20:23,606 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:20:23,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:20:23 BoogieIcfgContainer [2018-10-27 12:20:23,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:20:23,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:20:23,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:20:23,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:20:23,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:20:19" (1/3) ... [2018-10-27 12:20:23,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c367e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:20:23, skipping insertion in model container [2018-10-27 12:20:23,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:20:19" (2/3) ... [2018-10-27 12:20:23,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c367e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:20:23, skipping insertion in model container [2018-10-27 12:20:23,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:20:23" (3/3) ... [2018-10-27 12:20:23,625 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label10_true-unreach-call_false-termination.c [2018-10-27 12:20:23,636 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:20:23,649 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:20:23,671 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:20:23,720 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:20:23,721 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:20:23,721 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:20:23,721 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:20:23,721 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:20:23,722 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:20:23,722 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:20:23,722 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:20:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 12:20:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 12:20:23,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:20:23,792 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:20:23,796 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:20:23,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:20:23,804 INFO L82 PathProgramCache]: Analyzing trace with hash -773755248, now seen corresponding path program 1 times [2018-10-27 12:20:23,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:20:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:23,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:20:23,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:23,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:20:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:20:24,525 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-27 12:20:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:20:24,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:20:24,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 12:20:24,807 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:20:24,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 12:20:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 12:20:24,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 12:20:24,832 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 4 states. [2018-10-27 12:20:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:20:27,163 INFO L93 Difference]: Finished difference Result 774 states and 1357 transitions. [2018-10-27 12:20:27,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:20:27,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-10-27 12:20:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:20:27,189 INFO L225 Difference]: With dead ends: 774 [2018-10-27 12:20:27,189 INFO L226 Difference]: Without dead ends: 531 [2018-10-27 12:20:27,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 12:20:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-27 12:20:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2018-10-27 12:20:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-27 12:20:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 922 transitions. [2018-10-27 12:20:27,313 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 922 transitions. Word has length 142 [2018-10-27 12:20:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:20:27,314 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 922 transitions. [2018-10-27 12:20:27,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 12:20:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 922 transitions. [2018-10-27 12:20:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-27 12:20:27,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:20:27,327 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:20:27,327 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:20:27,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:20:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash -309014567, now seen corresponding path program 1 times [2018-10-27 12:20:27,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:20:27,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:27,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:20:27,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:27,335 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:20:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:20:27,649 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:20:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:20:27,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:20:27,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:20:27,859 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:20:27,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:20:27,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:20:27,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:20:27,862 INFO L87 Difference]: Start difference. First operand 529 states and 922 transitions. Second operand 6 states. [2018-10-27 12:20:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:20:29,913 INFO L93 Difference]: Finished difference Result 1284 states and 2274 transitions. [2018-10-27 12:20:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:20:29,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-27 12:20:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:20:29,922 INFO L225 Difference]: With dead ends: 1284 [2018-10-27 12:20:29,922 INFO L226 Difference]: Without dead ends: 761 [2018-10-27 12:20:29,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:20:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-10-27 12:20:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 742. [2018-10-27 12:20:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-10-27 12:20:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1199 transitions. [2018-10-27 12:20:29,979 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1199 transitions. Word has length 164 [2018-10-27 12:20:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:20:29,980 INFO L481 AbstractCegarLoop]: Abstraction has 742 states and 1199 transitions. [2018-10-27 12:20:29,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:20:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1199 transitions. [2018-10-27 12:20:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-27 12:20:29,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:20:29,986 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:20:29,986 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:20:29,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:20:29,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1423050670, now seen corresponding path program 1 times [2018-10-27 12:20:29,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:20:29,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:29,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:20:29,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:29,989 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:20:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:20:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:20:30,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:20:30,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 12:20:30,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:20:30,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 12:20:30,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 12:20:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:20:30,422 INFO L87 Difference]: Start difference. First operand 742 states and 1199 transitions. Second operand 5 states. [2018-10-27 12:20:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:20:32,349 INFO L93 Difference]: Finished difference Result 1625 states and 2665 transitions. [2018-10-27 12:20:32,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 12:20:32,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-10-27 12:20:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:20:32,359 INFO L225 Difference]: With dead ends: 1625 [2018-10-27 12:20:32,359 INFO L226 Difference]: Without dead ends: 741 [2018-10-27 12:20:32,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 12:20:32,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-27 12:20:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2018-10-27 12:20:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-27 12:20:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1181 transitions. [2018-10-27 12:20:32,409 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1181 transitions. Word has length 169 [2018-10-27 12:20:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:20:32,410 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 1181 transitions. [2018-10-27 12:20:32,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 12:20:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1181 transitions. [2018-10-27 12:20:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-27 12:20:32,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:20:32,415 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:20:32,415 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:20:32,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:20:32,416 INFO L82 PathProgramCache]: Analyzing trace with hash 192175635, now seen corresponding path program 1 times [2018-10-27 12:20:32,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:20:32,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:32,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:20:32,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:32,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:20:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:20:32,654 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:20:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:20:32,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:20:32,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:20:32,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:20:32,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:20:32,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:20:32,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:20:32,713 INFO L87 Difference]: Start difference. First operand 741 states and 1181 transitions. Second operand 6 states. [2018-10-27 12:20:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:20:34,280 INFO L93 Difference]: Finished difference Result 2329 states and 3898 transitions. [2018-10-27 12:20:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:20:34,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2018-10-27 12:20:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:20:34,292 INFO L225 Difference]: With dead ends: 2329 [2018-10-27 12:20:34,292 INFO L226 Difference]: Without dead ends: 1594 [2018-10-27 12:20:34,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:20:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2018-10-27 12:20:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1552. [2018-10-27 12:20:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2018-10-27 12:20:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2380 transitions. [2018-10-27 12:20:34,353 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2380 transitions. Word has length 197 [2018-10-27 12:20:34,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:20:34,353 INFO L481 AbstractCegarLoop]: Abstraction has 1552 states and 2380 transitions. [2018-10-27 12:20:34,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:20:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2380 transitions. [2018-10-27 12:20:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-27 12:20:34,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:20:34,365 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:20:34,365 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:20:34,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:20:34,366 INFO L82 PathProgramCache]: Analyzing trace with hash 36195093, now seen corresponding path program 1 times [2018-10-27 12:20:34,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:20:34,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:34,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:20:34,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:34,367 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:20:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:20:34,697 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:20:34,962 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 12:20:34,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:20:34,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:20:34,964 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-10-27 12:20:34,968 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [207], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:20:35,040 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:20:35,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:20:35,876 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:20:35,879 INFO L272 AbstractInterpreter]: Visited 142 different actions 142 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-27 12:20:35,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:20:35,920 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:20:36,693 INFO L227 lantSequenceWeakener]: Weakened 179 states. On average, predicates are now at 81.4% of their original sizes. [2018-10-27 12:20:36,693 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:20:38,159 INFO L415 sIntCurrentIteration]: We unified 196 AI predicates to 196 [2018-10-27 12:20:38,159 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:20:38,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:20:38,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-27 12:20:38,160 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:20:38,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 12:20:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 12:20:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-27 12:20:38,162 INFO L87 Difference]: Start difference. First operand 1552 states and 2380 transitions. Second operand 14 states. [2018-10-27 12:20:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:20:51,688 INFO L93 Difference]: Finished difference Result 3398 states and 5219 transitions. [2018-10-27 12:20:51,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 12:20:51,688 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2018-10-27 12:20:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:20:51,698 INFO L225 Difference]: With dead ends: 3398 [2018-10-27 12:20:51,699 INFO L226 Difference]: Without dead ends: 1852 [2018-10-27 12:20:51,704 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-10-27 12:20:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2018-10-27 12:20:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1699. [2018-10-27 12:20:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2018-10-27 12:20:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2539 transitions. [2018-10-27 12:20:51,752 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2539 transitions. Word has length 197 [2018-10-27 12:20:51,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:20:51,753 INFO L481 AbstractCegarLoop]: Abstraction has 1699 states and 2539 transitions. [2018-10-27 12:20:51,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 12:20:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2539 transitions. [2018-10-27 12:20:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-27 12:20:51,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:20:51,761 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:20:51,762 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:20:51,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:20:51,762 INFO L82 PathProgramCache]: Analyzing trace with hash 981314004, now seen corresponding path program 1 times [2018-10-27 12:20:51,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:20:51,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:51,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:20:51,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:20:51,764 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:20:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:20:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 65 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:20:52,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:20:52,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:20:52,002 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-10-27 12:20:52,002 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [207], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:20:52,008 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:20:52,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:20:52,532 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:20:52,532 INFO L272 AbstractInterpreter]: Visited 146 different actions 288 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 12:20:52,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:20:52,576 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:20:53,127 INFO L227 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 81.82% of their original sizes. [2018-10-27 12:20:53,127 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:20:54,105 INFO L415 sIntCurrentIteration]: We unified 206 AI predicates to 206 [2018-10-27 12:20:54,105 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:20:54,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:20:54,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-27 12:20:54,106 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:20:54,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 12:20:54,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 12:20:54,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:20:54,108 INFO L87 Difference]: Start difference. First operand 1699 states and 2539 transitions. Second operand 18 states. [2018-10-27 12:21:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:12,134 INFO L93 Difference]: Finished difference Result 4139 states and 6090 transitions. [2018-10-27 12:21:12,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 12:21:12,135 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 207 [2018-10-27 12:21:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:12,146 INFO L225 Difference]: With dead ends: 4139 [2018-10-27 12:21:12,146 INFO L226 Difference]: Without dead ends: 2446 [2018-10-27 12:21:12,152 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2018-10-27 12:21:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-10-27 12:21:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2291. [2018-10-27 12:21:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2018-10-27 12:21:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3209 transitions. [2018-10-27 12:21:12,217 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3209 transitions. Word has length 207 [2018-10-27 12:21:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:12,217 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3209 transitions. [2018-10-27 12:21:12,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 12:21:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3209 transitions. [2018-10-27 12:21:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 12:21:12,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:12,227 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:21:12,228 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:12,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:12,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2105417946, now seen corresponding path program 1 times [2018-10-27 12:21:12,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:12,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:12,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:12,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:12,229 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:21:12,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:12,393 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:21:12,393 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-10-27 12:21:12,393 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:21:12,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:21:12,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:21:12,683 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:21:12,683 INFO L272 AbstractInterpreter]: Visited 146 different actions 288 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 12:21:12,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:12,687 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:21:13,045 INFO L227 lantSequenceWeakener]: Weakened 120 states. On average, predicates are now at 81.47% of their original sizes. [2018-10-27 12:21:13,045 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:21:13,704 INFO L415 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-10-27 12:21:13,704 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:21:13,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:21:13,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-27 12:21:13,705 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:13,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 12:21:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 12:21:13,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:21:13,706 INFO L87 Difference]: Start difference. First operand 2291 states and 3209 transitions. Second operand 18 states. [2018-10-27 12:21:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:22,914 INFO L93 Difference]: Finished difference Result 5187 states and 7660 transitions. [2018-10-27 12:21:22,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 12:21:22,914 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 211 [2018-10-27 12:21:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:22,927 INFO L225 Difference]: With dead ends: 5187 [2018-10-27 12:21:22,928 INFO L226 Difference]: Without dead ends: 3197 [2018-10-27 12:21:22,935 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 12:21:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2018-10-27 12:21:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3184. [2018-10-27 12:21:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2018-10-27 12:21:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4316 transitions. [2018-10-27 12:21:23,021 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4316 transitions. Word has length 211 [2018-10-27 12:21:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:23,021 INFO L481 AbstractCegarLoop]: Abstraction has 3184 states and 4316 transitions. [2018-10-27 12:21:23,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 12:21:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4316 transitions. [2018-10-27 12:21:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-27 12:21:23,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:23,034 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 12:21:23,034 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:23,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:23,034 INFO L82 PathProgramCache]: Analyzing trace with hash 406363975, now seen corresponding path program 1 times [2018-10-27 12:21:23,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:23,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:23,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:23,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:23,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 12:21:23,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:23,255 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:21:23,255 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-10-27 12:21:23,256 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:21:23,259 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:21:23,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:21:23,663 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:21:23,663 INFO L272 AbstractInterpreter]: Visited 147 different actions 440 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:21:23,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:23,672 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:21:23,899 INFO L227 lantSequenceWeakener]: Weakened 211 states. On average, predicates are now at 81.16% of their original sizes. [2018-10-27 12:21:23,899 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:21:23,978 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-10-27 12:21:23,979 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:21:23,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:21:23,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-10-27 12:21:23,979 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:23,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 12:21:23,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 12:21:23,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:21:23,980 INFO L87 Difference]: Start difference. First operand 3184 states and 4316 transitions. Second operand 10 states. [2018-10-27 12:21:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:30,571 INFO L93 Difference]: Finished difference Result 8078 states and 11255 transitions. [2018-10-27 12:21:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 12:21:30,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 216 [2018-10-27 12:21:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:30,591 INFO L225 Difference]: With dead ends: 8078 [2018-10-27 12:21:30,591 INFO L226 Difference]: Without dead ends: 5195 [2018-10-27 12:21:30,600 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:21:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5195 states. [2018-10-27 12:21:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5195 to 4921. [2018-10-27 12:21:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4921 states. [2018-10-27 12:21:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4921 states to 4921 states and 6365 transitions. [2018-10-27 12:21:30,736 INFO L78 Accepts]: Start accepts. Automaton has 4921 states and 6365 transitions. Word has length 216 [2018-10-27 12:21:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:30,737 INFO L481 AbstractCegarLoop]: Abstraction has 4921 states and 6365 transitions. [2018-10-27 12:21:30,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 12:21:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4921 states and 6365 transitions. [2018-10-27 12:21:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 12:21:30,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:30,755 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-27 12:21:30,755 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:30,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash -640796914, now seen corresponding path program 1 times [2018-10-27 12:21:30,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:30,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:30,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:30,757 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 85 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 12:21:31,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:31,664 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:21:31,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-10-27 12:21:31,665 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:21:31,668 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:21:31,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:21:32,260 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:21:32,261 INFO L272 AbstractInterpreter]: Visited 148 different actions 593 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:21:32,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:32,270 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:21:32,573 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 81.17% of their original sizes. [2018-10-27 12:21:32,574 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:21:32,879 INFO L415 sIntCurrentIteration]: We unified 229 AI predicates to 229 [2018-10-27 12:21:32,879 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:21:32,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:21:32,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-10-27 12:21:32,880 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:32,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 12:21:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 12:21:32,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:21:32,881 INFO L87 Difference]: Start difference. First operand 4921 states and 6365 transitions. Second operand 10 states. [2018-10-27 12:21:37,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:37,269 INFO L93 Difference]: Finished difference Result 10813 states and 14403 transitions. [2018-10-27 12:21:37,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 12:21:37,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2018-10-27 12:21:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:37,299 INFO L225 Difference]: With dead ends: 10813 [2018-10-27 12:21:37,299 INFO L226 Difference]: Without dead ends: 6193 [2018-10-27 12:21:37,315 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 238 GetRequests, 166 SyntacticMatches, 55 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:21:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6193 states. [2018-10-27 12:21:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6193 to 6136. [2018-10-27 12:21:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6136 states. [2018-10-27 12:21:37,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6136 states to 6136 states and 7852 transitions. [2018-10-27 12:21:37,502 INFO L78 Accepts]: Start accepts. Automaton has 6136 states and 7852 transitions. Word has length 230 [2018-10-27 12:21:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:37,503 INFO L481 AbstractCegarLoop]: Abstraction has 6136 states and 7852 transitions. [2018-10-27 12:21:37,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 12:21:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 6136 states and 7852 transitions. [2018-10-27 12:21:37,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-27 12:21:37,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:37,529 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 12:21:37,529 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:37,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1882991460, now seen corresponding path program 1 times [2018-10-27 12:21:37,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:37,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:37,531 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 104 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:21:38,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:38,253 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:21:38,253 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-10-27 12:21:38,253 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [207], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:21:38,255 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:21:38,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:21:39,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:21:39,002 INFO L272 AbstractInterpreter]: Visited 150 different actions 595 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 12:21:39,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:39,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:21:39,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:39,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:21:39,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:39,022 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:21:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:39,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:21:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 119 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:21:39,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:21:39,681 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 12:21:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 119 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:21:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:21:40,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 17 [2018-10-27 12:21:40,372 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:21:40,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 12:21:40,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 12:21:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-10-27 12:21:40,374 INFO L87 Difference]: Start difference. First operand 6136 states and 7852 transitions. Second operand 15 states. [2018-10-27 12:21:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:44,650 INFO L93 Difference]: Finished difference Result 14291 states and 18930 transitions. [2018-10-27 12:21:44,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 12:21:44,651 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 234 [2018-10-27 12:21:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:44,651 INFO L225 Difference]: With dead ends: 14291 [2018-10-27 12:21:44,651 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:21:44,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 475 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2018-10-27 12:21:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:21:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:21:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:21:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:21:44,703 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2018-10-27 12:21:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:44,704 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:21:44,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 12:21:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:21:44,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:21:44,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:21:44,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:21:45,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:21:45,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:21:45,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:21:45,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:21:45,437 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 174 [2018-10-27 12:21:45,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:21:45,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:21:45,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:21:45,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:21:45,740 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 211 [2018-10-27 12:21:46,423 WARN L179 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-10-27 12:21:46,733 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2018-10-27 12:21:48,159 WARN L179 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 303 DAG size of output: 82 [2018-10-27 12:21:49,043 WARN L179 SmtUtils]: Spent 875.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 86 [2018-10-27 12:21:50,580 WARN L179 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 235 DAG size of output: 86 [2018-10-27 12:21:50,583 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:21:50,583 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a25~0)| ~a25~0)) [2018-10-27 12:21:50,583 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:21:50,583 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,583 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,583 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,584 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,584 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,584 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 12:21:50,584 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 12:21:50,584 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 12:21:50,584 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 12:21:50,584 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 12:21:50,585 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 12:21:50,585 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 12:21:50,585 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 12:21:50,585 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 12:21:50,585 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 12:21:50,585 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:21:50,585 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:21:50,586 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 12:21:50,586 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,586 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,586 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,586 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,586 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 12:21:50,586 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,586 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 12:21:50,586 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 12:21:50,587 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 12:21:50,587 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 12:21:50,587 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 12:21:50,587 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 12:21:50,587 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 12:21:50,587 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:21:50,587 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:21:50,587 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 12:21:50,588 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 12:21:50,588 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 12:21:50,588 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:21:50,588 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:21:50,588 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 12:21:50,588 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,588 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,588 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,589 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,589 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,589 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:21:50,589 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 12:21:50,589 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:21:50,589 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 12:21:50,589 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 12:21:50,589 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 12:21:50,590 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 12:21:50,590 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 12:21:50,590 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 12:21:50,590 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 12:21:50,590 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 12:21:50,590 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,590 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,590 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,591 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,591 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,591 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 12:21:50,591 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 12:21:50,591 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 12:21:50,591 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 12:21:50,591 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 12:21:50,591 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 12:21:50,591 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 12:21:50,592 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 12:21:50,592 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 12:21:50,592 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 12:21:50,592 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 12:21:50,592 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 12:21:50,592 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 12:21:50,592 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,592 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,593 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,593 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,593 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,593 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 12:21:50,593 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 12:21:50,593 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 12:21:50,593 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 12:21:50,593 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:21:50,594 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 12:21:50,595 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:21:50,595 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,595 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,595 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,595 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,595 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 12:21:50,595 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,595 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:21:50,595 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,596 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:21:50,596 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:21:50,596 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:21:50,596 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,596 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,596 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 12:21:50,596 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 12:21:50,596 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 12:21:50,596 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,597 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,598 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,598 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,598 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,598 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 12:21:50,598 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 12:21:50,598 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 12:21:50,598 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 12:21:50,598 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 12:21:50,598 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 12:21:50,599 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 12:21:50,599 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 12:21:50,599 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 12:21:50,599 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 12:21:50,599 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 12:21:50,599 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,599 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,599 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,600 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,600 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,600 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 577) no Hoare annotation was computed. [2018-10-27 12:21:50,600 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,600 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 12:21:50,600 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 12:21:50,600 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 12:21:50,600 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 12:21:50,601 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 12:21:50,602 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,602 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,602 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,602 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse10 (= |old(~a28~0)| ~a28~0)) (.cse11 (= 7 ~a17~0)) (.cse15 (= |old(~a25~0)| ~a25~0))) (let ((.cse9 (= 1 |old(~a25~0)|)) (.cse14 (= |old(~a17~0)| |old(~a28~0)|)) (.cse13 (and .cse10 .cse11 .cse15)) (.cse12 (not (= 7 |old(~a17~0)|))) (.cse0 (< 6 |calculate_output_#in~input|)) (.cse3 (< |old(~a28~0)| 7)) (.cse1 (not (= 1 ~a21~0))) (.cse5 (< 1 |old(~a25~0)|)) (.cse6 (< 11 |old(~a28~0)|)) (.cse2 (< |old(~a25~0)| 0)) (.cse4 (not (= 1 |old(~a19~0)|))) (.cse7 (not (= |old(~a17~0)| 8))) (.cse8 (< |calculate_output_#in~input| 1))) (and (or .cse0 .cse1 (and (<= 0 ~a11~0) (<= ~a11~0 1) (= ~a19~0 1)) (< 1 |old(~a11~0)|) .cse2 .cse3 (< |old(~a11~0)| 0) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 (not (= 7 |old(~a28~0)|)) (not .cse9) .cse4 (not (= 1 |old(~a11~0)|)) (and .cse10 (= 1 ~a11~0) .cse11 (= 1 ~a25~0) (= 1 ~a19~0)) .cse12) (or .cse1 .cse13 .cse14 .cse9 .cse12) (or .cse1 (and .cse10 (= ~a17~0 |old(~a17~0)|) .cse15) .cse7) (or .cse1 (= 10 |old(~a28~0)|) .cse14 .cse13 .cse12) (or .cse0 (let ((.cse16 (not (= 0 |old(~a11~0)|)))) (and (or .cse1 .cse16 .cse6 .cse3 (not (= 0 |old(~a25~0)|))) (or .cse1 (< |old(~a28~0)| 8) .cse5 .cse16 .cse6))) .cse2 (= ~a11~0 0) .cse4 .cse7 .cse8)))) [2018-10-27 12:21:50,602 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,602 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 12:21:50,603 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 12:21:50,604 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 12:21:50,604 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 12:21:50,604 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 12:21:50,604 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 12:21:50,604 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,604 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,604 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,604 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 12:21:50,605 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,606 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 12:21:50,607 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:21:50,608 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 12:21:50,609 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 12:21:50,609 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:21:50,609 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-27 12:21:50,609 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:21:50,609 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:21:50,609 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-27 12:21:50,609 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 12:21:50,610 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse0 (not (= ~a28~0 ~a17~0))) (.cse1 (= 7 ~a17~0)) (.cse2 (not (= ~a28~0 10)))) (or (= |old(~a17~0)| ~a17~0) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 (not (= ~a25~0 1)) .cse1) (and (= 1 ~a11~0) .cse1 (= 1 ~a25~0) (= 1 ~a19~0) .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse1 .cse2) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-27 12:21:50,610 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:21:50,610 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:21:50,610 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse0 (not (= ~a28~0 ~a17~0))) (.cse1 (= 7 ~a17~0)) (.cse2 (not (= ~a28~0 10)))) (or (= |old(~a17~0)| ~a17~0) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 (not (= ~a25~0 1)) .cse1) (and (= 1 ~a11~0) .cse1 (= 1 ~a25~0) (= 1 ~a19~0) .cse2) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (and .cse0 .cse1 .cse2) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-27 12:21:50,610 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 12:21:50,610 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 12:21:50,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:21:50 BoogieIcfgContainer [2018-10-27 12:21:50,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:21:50,625 INFO L168 Benchmark]: Toolchain (without parser) took 91433.15 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -179.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-27 12:21:50,627 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:21:50,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:21:50,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 225.55 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:21:50,629 INFO L168 Benchmark]: Boogie Preprocessor took 109.70 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:21:50,629 INFO L168 Benchmark]: RCFGBuilder took 3338.93 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 109.0 MB). Peak memory consumption was 109.0 MB. Max. memory is 7.1 GB. [2018-10-27 12:21:50,630 INFO L168 Benchmark]: TraceAbstraction took 87013.50 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 482.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-27 12:21:50,635 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 225.55 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.2 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.70 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3338.93 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 109.0 MB). Peak memory consumption was 109.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87013.50 ms. Allocated memory was 2.2 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 482.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 577]: 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: (((((((((((((((((((\old(a17) == a17 || !(a21 == 1)) || !(y == 25)) || ((!(a28 == a17) && !(a25 == 1)) && 7 == a17)) || ((((1 == a11 && 7 == a17) && 1 == a25) && 1 == a19) && !(a28 == 10))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || ((!(a28 == a17) && 7 == a17) && !(a28 == 10))) || !(\old(a11) == 0)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 86.9s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 64.1s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1650 SDtfs, 9730 SDslu, 2762 SDs, 0 SdLazy, 13674 SolverSat, 2657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.6s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1652 GetRequests, 1427 SyntacticMatches, 62 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6136occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.6s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9977547173319221 AbsIntWeakeningRatio, 0.17803030303030304 AbsIntAvgWeakeningVarsNumRemoved, 22.09469696969697 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 715 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 173 PreInvPairs, 273 NumberOfFragments, 607 HoareAnnotationTreeSize, 173 FomulaSimplifications, 21811 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 19468 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2201 NumberOfCodeBlocks, 2201 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2423 ConstructedInterpolants, 0 QuantifiedInterpolants, 1481736 SizeOfPredicates, 1 NumberOfNonLiveVariables, 533 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 780/905 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...