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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label37_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:24:42,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:24:42,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:24:42,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:24:42,742 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:24:42,743 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:24:42,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:24:42,746 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:24:42,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:24:42,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:24:42,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:24:42,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:24:42,751 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:24:42,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:24:42,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:24:42,754 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:24:42,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:24:42,757 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:24:42,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:24:42,760 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:24:42,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:24:42,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:24:42,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:24:42,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:24:42,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:24:42,767 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:24:42,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:24:42,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:24:42,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:24:42,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:24:42,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:24:42,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:24:42,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:24:42,772 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:24:42,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:24:42,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:24:42,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 01:24:42,797 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:24:42,798 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:24:42,799 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:24:42,800 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:24:42,800 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:24:42,800 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:24:42,800 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:24:42,800 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:24:42,800 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:24:42,801 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:24:42,801 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:24:42,802 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:24:42,802 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:24:42,802 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:24:42,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:24:42,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:24:42,803 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:24:42,803 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:24:42,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:24:42,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:24:42,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:24:42,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:24:42,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:24:42,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:24:42,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:24:42,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:24:42,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:24:42,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:24:42,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:24:42,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:24:42,808 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:24:42,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:24:42,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:24:42,809 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:24:42,809 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:24:42,809 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:24:42,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:24:42,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:24:42,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:24:42,898 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:24:42,898 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:24:42,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label37_true-unreach-call.c [2018-10-25 01:24:42,969 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/52e847898/d3d57ad3fc254fb4bf5240dcc3fbdc59/FLAG45b1a4c48 [2018-10-25 01:24:43,583 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:24:43,587 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label37_true-unreach-call.c [2018-10-25 01:24:43,608 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/52e847898/d3d57ad3fc254fb4bf5240dcc3fbdc59/FLAG45b1a4c48 [2018-10-25 01:24:43,629 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/52e847898/d3d57ad3fc254fb4bf5240dcc3fbdc59 [2018-10-25 01:24:43,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:24:43,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:24:43,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:24:43,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:24:43,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:24:43,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:24:43" (1/1) ... [2018-10-25 01:24:43,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58cac14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:43, skipping insertion in model container [2018-10-25 01:24:43,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:24:43" (1/1) ... [2018-10-25 01:24:43,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:24:43,721 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:24:44,191 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:24:44,196 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:24:44,300 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:24:44,322 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:24:44,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44 WrapperNode [2018-10-25 01:24:44,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:24:44,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:24:44,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:24:44,324 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:24:44,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (1/1) ... [2018-10-25 01:24:44,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (1/1) ... [2018-10-25 01:24:44,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:24:44,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:24:44,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:24:44,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:24:44,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (1/1) ... [2018-10-25 01:24:44,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (1/1) ... [2018-10-25 01:24:44,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (1/1) ... [2018-10-25 01:24:44,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (1/1) ... [2018-10-25 01:24:44,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (1/1) ... [2018-10-25 01:24:44,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (1/1) ... [2018-10-25 01:24:44,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (1/1) ... [2018-10-25 01:24:44,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:24:44,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:24:44,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:24:44,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:24:44,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (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-25 01:24:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:24:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:24:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:24:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:24:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:24:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:24:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:24:44,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:24:48,192 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:24:48,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:24:48 BoogieIcfgContainer [2018-10-25 01:24:48,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:24:48,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:24:48,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:24:48,199 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:24:48,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:24:43" (1/3) ... [2018-10-25 01:24:48,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6df32c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:24:48, skipping insertion in model container [2018-10-25 01:24:48,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:24:44" (2/3) ... [2018-10-25 01:24:48,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6df32c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:24:48, skipping insertion in model container [2018-10-25 01:24:48,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:24:48" (3/3) ... [2018-10-25 01:24:48,203 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label37_true-unreach-call.c [2018-10-25 01:24:48,213 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:24:48,222 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:24:48,241 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:24:48,280 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:24:48,280 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:24:48,280 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:24:48,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:24:48,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:24:48,281 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:24:48,281 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:24:48,281 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:24:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-25 01:24:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-25 01:24:48,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:48,322 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] [2018-10-25 01:24:48,324 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:48,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash -890432215, now seen corresponding path program 1 times [2018-10-25 01:24:48,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:48,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:48,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:48,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:48,848 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-25 01:24:48,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:48,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:24:48,851 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:48,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:24:48,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:24:48,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:24:48,877 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2018-10-25 01:24:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:51,740 INFO L93 Difference]: Finished difference Result 737 states and 1298 transitions. [2018-10-25 01:24:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:24:51,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-10-25 01:24:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:51,764 INFO L225 Difference]: With dead ends: 737 [2018-10-25 01:24:51,765 INFO L226 Difference]: Without dead ends: 515 [2018-10-25 01:24:51,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:24:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-10-25 01:24:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 356. [2018-10-25 01:24:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-25 01:24:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 579 transitions. [2018-10-25 01:24:51,848 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 579 transitions. Word has length 61 [2018-10-25 01:24:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:51,849 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 579 transitions. [2018-10-25 01:24:51,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:24:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 579 transitions. [2018-10-25 01:24:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-25 01:24:51,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:51,858 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, 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] [2018-10-25 01:24:51,859 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:51,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:51,859 INFO L82 PathProgramCache]: Analyzing trace with hash 833383459, now seen corresponding path program 1 times [2018-10-25 01:24:51,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:51,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:51,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:51,861 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:52,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:52,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:24:52,164 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:52,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:52,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:52,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:52,167 INFO L87 Difference]: Start difference. First operand 356 states and 579 transitions. Second operand 6 states. [2018-10-25 01:24:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:54,773 INFO L93 Difference]: Finished difference Result 1259 states and 2162 transitions. [2018-10-25 01:24:54,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:24:54,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-10-25 01:24:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:54,791 INFO L225 Difference]: With dead ends: 1259 [2018-10-25 01:24:54,791 INFO L226 Difference]: Without dead ends: 909 [2018-10-25 01:24:54,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:24:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-10-25 01:24:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 895. [2018-10-25 01:24:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-10-25 01:24:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1370 transitions. [2018-10-25 01:24:54,879 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1370 transitions. Word has length 136 [2018-10-25 01:24:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:54,879 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1370 transitions. [2018-10-25 01:24:54,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:24:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1370 transitions. [2018-10-25 01:24:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-25 01:24:54,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:54,886 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, 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] [2018-10-25 01:24:54,886 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:54,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:54,887 INFO L82 PathProgramCache]: Analyzing trace with hash 487326791, now seen corresponding path program 1 times [2018-10-25 01:24:54,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:54,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:54,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:54,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:54,889 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:55,206 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:24:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:55,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:55,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:24:55,619 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:55,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:24:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:24:55,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:24:55,622 INFO L87 Difference]: Start difference. First operand 895 states and 1370 transitions. Second operand 6 states. [2018-10-25 01:24:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:24:59,001 INFO L93 Difference]: Finished difference Result 2358 states and 3764 transitions. [2018-10-25 01:24:59,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:24:59,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-10-25 01:24:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:24:59,018 INFO L225 Difference]: With dead ends: 2358 [2018-10-25 01:24:59,018 INFO L226 Difference]: Without dead ends: 1469 [2018-10-25 01:24:59,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:24:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2018-10-25 01:24:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1450. [2018-10-25 01:24:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2018-10-25 01:24:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 2107 transitions. [2018-10-25 01:24:59,088 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 2107 transitions. Word has length 138 [2018-10-25 01:24:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:24:59,089 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 2107 transitions. [2018-10-25 01:24:59,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:24:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 2107 transitions. [2018-10-25 01:24:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-25 01:24:59,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:24:59,095 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, 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] [2018-10-25 01:24:59,095 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:24:59,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:24:59,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1877603308, now seen corresponding path program 1 times [2018-10-25 01:24:59,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:24:59,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:59,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:24:59,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:24:59,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:24:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:24:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:24:59,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:24:59,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:24:59,310 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:24:59,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:24:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:24:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:24:59,312 INFO L87 Difference]: Start difference. First operand 1450 states and 2107 transitions. Second operand 4 states. [2018-10-25 01:25:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:00,657 INFO L93 Difference]: Finished difference Result 3188 states and 4711 transitions. [2018-10-25 01:25:00,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:25:00,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-10-25 01:25:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:00,671 INFO L225 Difference]: With dead ends: 3188 [2018-10-25 01:25:00,671 INFO L226 Difference]: Without dead ends: 1744 [2018-10-25 01:25:00,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:25:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2018-10-25 01:25:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1742. [2018-10-25 01:25:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2018-10-25 01:25:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2373 transitions. [2018-10-25 01:25:00,726 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2373 transitions. Word has length 141 [2018-10-25 01:25:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:00,727 INFO L481 AbstractCegarLoop]: Abstraction has 1742 states and 2373 transitions. [2018-10-25 01:25:00,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:25:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2373 transitions. [2018-10-25 01:25:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-25 01:25:00,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:00,732 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, 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] [2018-10-25 01:25:00,732 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:00,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash -497008844, now seen corresponding path program 1 times [2018-10-25 01:25:00,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:00,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:00,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:00,734 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:00,995 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:25:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:01,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:25:01,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:25:01,163 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:01,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:25:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:25:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:25:01,164 INFO L87 Difference]: Start difference. First operand 1742 states and 2373 transitions. Second operand 6 states. [2018-10-25 01:25:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:03,463 INFO L93 Difference]: Finished difference Result 3994 states and 5608 transitions. [2018-10-25 01:25:03,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:25:03,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2018-10-25 01:25:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:03,483 INFO L225 Difference]: With dead ends: 3994 [2018-10-25 01:25:03,483 INFO L226 Difference]: Without dead ends: 2258 [2018-10-25 01:25:03,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:25:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2018-10-25 01:25:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2208. [2018-10-25 01:25:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2018-10-25 01:25:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2886 transitions. [2018-10-25 01:25:03,596 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2886 transitions. Word has length 157 [2018-10-25 01:25:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:03,597 INFO L481 AbstractCegarLoop]: Abstraction has 2208 states and 2886 transitions. [2018-10-25 01:25:03,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:25:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2886 transitions. [2018-10-25 01:25:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-25 01:25:03,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:03,608 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-10-25 01:25:03,608 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:03,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:03,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1003336825, now seen corresponding path program 1 times [2018-10-25 01:25:03,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:03,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:03,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:03,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:03,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:03,949 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:25:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-10-25 01:25:04,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:04,325 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:25:04,327 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-10-25 01:25:04,329 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [538], [539], [543], [547], [551], [555], [559], [563], [567], [570], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:25:04,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:25:04,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:25:05,030 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:25:05,032 INFO L272 AbstractInterpreter]: Visited 94 different actions 94 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:25:05,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:05,082 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:25:05,698 INFO L232 lantSequenceWeakener]: Weakened 222 states. On average, predicates are now at 73.56% of their original sizes. [2018-10-25 01:25:05,698 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:25:05,957 INFO L413 sIntCurrentIteration]: We have 230 unified AI predicates [2018-10-25 01:25:05,957 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:25:05,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:25:05,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-25 01:25:05,959 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:05,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:25:05,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:25:05,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:25:05,960 INFO L87 Difference]: Start difference. First operand 2208 states and 2886 transitions. Second operand 6 states. [2018-10-25 01:25:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:45,503 INFO L93 Difference]: Finished difference Result 4556 states and 5962 transitions. [2018-10-25 01:25:45,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:25:45,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2018-10-25 01:25:45,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:45,513 INFO L225 Difference]: With dead ends: 4556 [2018-10-25 01:25:45,513 INFO L226 Difference]: Without dead ends: 2354 [2018-10-25 01:25:45,520 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 231 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 01:25:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2018-10-25 01:25:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2352. [2018-10-25 01:25:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2352 states. [2018-10-25 01:25:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3038 transitions. [2018-10-25 01:25:45,574 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3038 transitions. Word has length 231 [2018-10-25 01:25:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:45,574 INFO L481 AbstractCegarLoop]: Abstraction has 2352 states and 3038 transitions. [2018-10-25 01:25:45,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:25:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3038 transitions. [2018-10-25 01:25:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-25 01:25:45,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:45,585 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-10-25 01:25:45,585 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:45,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1827733875, now seen corresponding path program 1 times [2018-10-25 01:25:45,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:45,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:45,587 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-10-25 01:25:45,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:45,942 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:25:45,942 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-10-25 01:25:45,943 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [389], [391], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-10-25 01:25:45,950 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:25:45,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:25:46,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:25:46,311 INFO L272 AbstractInterpreter]: Visited 131 different actions 388 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 24 variables. [2018-10-25 01:25:46,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:46,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:25:46,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:25:46,352 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-25 01:25:46,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:46,363 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:25:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:46,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:25:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 186 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:46,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:25:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 186 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:25:47,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:25:47,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 01:25:47,971 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:25:47,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 01:25:47,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 01:25:47,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 01:25:47,972 INFO L87 Difference]: Start difference. First operand 2352 states and 3038 transitions. Second operand 11 states. [2018-10-25 01:25:53,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:53,455 INFO L93 Difference]: Finished difference Result 6999 states and 9468 transitions. [2018-10-25 01:25:53,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 01:25:53,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 263 [2018-10-25 01:25:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:53,470 INFO L225 Difference]: With dead ends: 6999 [2018-10-25 01:25:53,471 INFO L226 Difference]: Without dead ends: 2515 [2018-10-25 01:25:53,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 530 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-25 01:25:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2018-10-25 01:25:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2365. [2018-10-25 01:25:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2018-10-25 01:25:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 2714 transitions. [2018-10-25 01:25:53,562 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 2714 transitions. Word has length 263 [2018-10-25 01:25:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:53,563 INFO L481 AbstractCegarLoop]: Abstraction has 2365 states and 2714 transitions. [2018-10-25 01:25:53,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 01:25:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2714 transitions. [2018-10-25 01:25:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-25 01:25:53,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:25:53,572 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:25:53,572 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:25:53,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:25:53,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1518939421, now seen corresponding path program 1 times [2018-10-25 01:25:53,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:25:53,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:53,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:25:53,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:25:53,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:25:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:25:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-25 01:25:53,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:25:53,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:25:53,922 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:25:53,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:25:53,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:25:53,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:25:53,923 INFO L87 Difference]: Start difference. First operand 2365 states and 2714 transitions. Second operand 4 states. [2018-10-25 01:25:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:25:54,908 INFO L93 Difference]: Finished difference Result 2511 states and 2866 transitions. [2018-10-25 01:25:54,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:25:54,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2018-10-25 01:25:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:25:54,909 INFO L225 Difference]: With dead ends: 2511 [2018-10-25 01:25:54,909 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 01:25:54,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:25:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 01:25:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 01:25:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 01:25:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 01:25:54,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 319 [2018-10-25 01:25:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:25:54,915 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 01:25:54,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:25:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 01:25:54,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 01:25:54,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 01:25:54,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:25:55,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:25:55,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:25:55,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 01:25:55,519 WARN L179 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 15 [2018-10-25 01:25:56,374 WARN L179 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 27 [2018-10-25 01:25:57,432 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 138 DAG size of output: 61 [2018-10-25 01:25:57,810 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 51 [2018-10-25 01:25:58,240 WARN L179 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 51 [2018-10-25 01:25:58,243 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 01:25:58,243 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= |old(~a10~0)| ~a10~0)) [2018-10-25 01:25:58,243 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 01:25:58,243 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-10-25 01:25:58,243 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-25 01:25:58,244 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-25 01:25:58,245 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-25 01:25:58,245 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-25 01:25:58,245 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-25 01:25:58,245 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-10-25 01:25:58,245 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-10-25 01:25:58,245 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-10-25 01:25:58,246 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,246 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,246 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,246 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,246 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,246 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-10-25 01:25:58,246 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-10-25 01:25:58,246 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-10-25 01:25:58,247 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-10-25 01:25:58,247 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-25 01:25:58,247 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-25 01:25:58,247 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-25 01:25:58,247 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-25 01:25:58,247 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-25 01:25:58,247 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-10-25 01:25:58,247 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-10-25 01:25:58,248 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-10-25 01:25:58,248 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-10-25 01:25:58,248 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-10-25 01:25:58,248 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,248 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,248 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,248 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,248 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,249 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-10-25 01:25:58,249 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-25 01:25:58,249 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-25 01:25:58,249 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-25 01:25:58,249 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-25 01:25:58,249 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-25 01:25:58,249 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-10-25 01:25:58,249 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-10-25 01:25:58,250 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-10-25 01:25:58,250 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-10-25 01:25:58,250 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,250 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,250 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,250 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,250 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,251 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-10-25 01:25:58,251 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-10-25 01:25:58,251 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-10-25 01:25:58,251 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-25 01:25:58,251 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-25 01:25:58,251 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-25 01:25:58,251 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-25 01:25:58,251 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-25 01:25:58,252 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-10-25 01:25:58,252 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-10-25 01:25:58,252 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-10-25 01:25:58,252 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-10-25 01:25:58,252 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-10-25 01:25:58,252 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,252 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,252 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,253 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,253 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,253 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-25 01:25:58,253 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-25 01:25:58,253 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-25 01:25:58,253 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-25 01:25:58,253 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-25 01:25:58,253 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-10-25 01:25:58,254 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-10-25 01:25:58,254 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-10-25 01:25:58,254 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-10-25 01:25:58,254 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,254 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,254 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,254 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,254 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,255 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,255 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,255 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-10-25 01:25:58,255 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-10-25 01:25:58,255 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-10-25 01:25:58,255 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-10-25 01:25:58,255 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-25 01:25:58,255 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-25 01:25:58,256 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-25 01:25:58,256 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-25 01:25:58,256 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-25 01:25:58,256 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-10-25 01:25:58,256 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-10-25 01:25:58,256 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-10-25 01:25:58,256 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-10-25 01:25:58,256 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,256 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,257 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,257 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,257 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-25 01:25:58,257 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,257 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,257 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-10-25 01:25:58,257 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-10-25 01:25:58,257 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-10-25 01:25:58,258 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-10-25 01:25:58,259 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,259 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,259 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,259 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,259 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,259 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,259 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-10-25 01:25:58,259 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-10-25 01:25:58,260 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-10-25 01:25:58,260 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-25 01:25:58,260 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-25 01:25:58,260 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-25 01:25:58,260 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-25 01:25:58,260 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-25 01:25:58,260 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2018-10-25 01:25:58,261 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-25 01:25:58,261 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-10-25 01:25:58,261 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-10-25 01:25:58,261 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse8 (<= ~a1~0 38)) (.cse9 (= |old(~a19~0)| ~a19~0)) (.cse7 (= |old(~a10~0)| ~a10~0))) (let ((.cse5 (< 8 |old(~a19~0)|)) (.cse0 (not (= 9 |old(~a19~0)|))) (.cse1 (and .cse9 .cse7)) (.cse2 (= 3 |old(~a10~0)|)) (.cse4 (and .cse9 .cse8 .cse7)) (.cse6 (= 4 |old(~a10~0)|)) (.cse3 (< 38 |old(~a1~0)|))) (and (or (not (= 14 ~a4~0)) (not (= 23 |old(~a1~0)|)) (= |calculate_output_#in~input| 0) (= ~a1~0 23) (not (= 0 ~a12~0)) .cse0 (not (= 0 |old(~a10~0)|))) (or (not (= 1 |old(~a10~0)|)) .cse1) (or .cse2 .cse3 .cse4 .cse5) (or .cse2 .cse6 .cse5 .cse1) (or (and (<= ~a19~0 |old(~a19~0)|) .cse7 (<= 9 ~a19~0)) .cse0) (or .cse3 .cse5 .cse4 (= 8 |old(~a19~0)|)) (or .cse3 .cse0 .cse8) (or .cse2 (= 7 |old(~a19~0)|) (= 10 |old(~a19~0)|) .cse1) (or .cse2 .cse4 .cse6 .cse3)))) [2018-10-25 01:25:58,261 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-10-25 01:25:58,261 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-10-25 01:25:58,261 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-25 01:25:58,262 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,263 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-25 01:25:58,264 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-10-25 01:25:58,265 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 01:25:58,266 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a19~0 9) (= ~a10~0 0) (= ~a12~0 0) (= ~a1~0 23) (= ~a4~0 14)) [2018-10-25 01:25:58,267 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 01:25:58,267 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 01:25:58,267 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (not (= 14 ~a4~0)) (not (= 23 |old(~a1~0)|)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 0 |old(~a10~0)|)) (and (= |old(~a19~0)| ~a19~0) (= ~a1~0 23) (= |old(~a10~0)| ~a10~0))) [2018-10-25 01:25:58,267 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-10-25 01:25:58,267 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse1 (<= ~a1~0 38)) (.cse0 (not (= ~a10~0 3))) (.cse3 (not (= ~a19~0 10))) (.cse2 (not (= 4 ~a10~0)))) (or (= 1 ~a10~0) (and .cse0 .cse1 .cse2) (and (<= ~a19~0 |old(~a19~0)|) (<= 9 ~a19~0)) (not (= 23 |old(~a1~0)|)) (and (not (= 7 ~a19~0)) (and .cse0 .cse3)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 0 |old(~a10~0)|)) (not (= 14 ~a4~0)) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and .cse0 .cse3 .cse2))) [2018-10-25 01:25:58,267 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-10-25 01:25:58,267 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-10-25 01:25:58,267 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-10-25 01:25:58,267 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse1 (<= ~a1~0 38)) (.cse0 (not (= ~a10~0 3))) (.cse3 (not (= ~a19~0 10))) (.cse2 (not (= 4 ~a10~0)))) (or (= 1 ~a10~0) (and .cse0 .cse1 .cse2) (and (<= ~a19~0 |old(~a19~0)|) (<= 9 ~a19~0)) (not (= 23 |old(~a1~0)|)) (and (not (= 7 ~a19~0)) (and .cse0 .cse3)) (not (= 0 ~a12~0)) (not (= 9 |old(~a19~0)|)) (not (= 0 |old(~a10~0)|)) (not (= 14 ~a4~0)) (and .cse1 (not (= ~a19~0 8)) (<= ~a19~0 8)) (and .cse0 .cse3 .cse2))) [2018-10-25 01:25:58,267 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-10-25 01:25:58,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 01:25:58 BoogieIcfgContainer [2018-10-25 01:25:58,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 01:25:58,282 INFO L168 Benchmark]: Toolchain (without parser) took 74640.48 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -212.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-25 01:25:58,284 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:25:58,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.29 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-25 01:25:58,285 INFO L168 Benchmark]: Boogie Procedure Inliner took 214.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:25:58,286 INFO L168 Benchmark]: Boogie Preprocessor took 124.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:25:58,287 INFO L168 Benchmark]: RCFGBuilder took 3531.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.4 MB). Peak memory consumption was 130.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:25:58,290 INFO L168 Benchmark]: TraceAbstraction took 70086.51 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 437.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-10-25 01:25:58,301 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 678.29 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 214.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3531.17 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 130.4 MB). Peak memory consumption was 130.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70086.51 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 437.6 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 166]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((((((((1 == a10 || ((!(a10 == 3) && a1 <= 38) && !(4 == a10))) || (a19 <= \old(a19) && 9 <= a19)) || !(23 == \old(a1))) || (!(7 == a19) && !(a10 == 3) && !(a19 == 10))) || !(0 == a12)) || !(9 == \old(a19))) || !(0 == \old(a10))) || !(14 == a4)) || ((a1 <= 38 && !(a19 == 8)) && a19 <= 8)) || ((!(a10 == 3) && !(a19 == 10)) && !(4 == a10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 70.0s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 58.7s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 819 SDtfs, 5112 SDslu, 1080 SDs, 0 SdLazy, 9285 SolverSat, 1684 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.5s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 834 GetRequests, 772 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2365occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9975522303783176 AbsIntWeakeningRatio, 0.11304347826086956 AbsIntAvgWeakeningVarsNumRemoved, 15.495652173913044 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 396 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 81 PreInvPairs, 143 NumberOfFragments, 384 HoareAnnotationTreeSize, 81 FomulaSimplifications, 4222 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4246 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1962 ConstructedInterpolants, 0 QuantifiedInterpolants, 1274134 SizeOfPredicates, 1 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 1083/1193 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...