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/Problem15_label24_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:48:11,734 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:48:11,736 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:48:11,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:48:11,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:48:11,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:48:11,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:48:11,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:48:11,759 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:48:11,760 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:48:11,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:48:11,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:48:11,762 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:48:11,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:48:11,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:48:11,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:48:11,770 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:48:11,774 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:48:11,780 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:48:11,785 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:48:11,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:48:11,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:48:11,794 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:48:11,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:48:11,795 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:48:11,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:48:11,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:48:11,802 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:48:11,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:48:11,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:48:11,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:48:11,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:48:11,807 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:48:11,807 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:48:11,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:48:11,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:48:11,812 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:48:11,843 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:48:11,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:48:11,844 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:48:11,844 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:48:11,845 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:48:11,845 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:48:11,845 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:48:11,845 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:48:11,846 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:48:11,846 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:48:11,846 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:48:11,846 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:48:11,846 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:48:11,846 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:48:11,847 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:48:11,847 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:48:11,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:48:11,848 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:48:11,848 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:48:11,848 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:48:11,848 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:48:11,849 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:48:11,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:48:11,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:48:11,850 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:48:11,850 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:48:11,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:48:11,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:48:11,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:48:11,851 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:48:11,851 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:48:11,851 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:48:11,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:48:11,852 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:48:11,853 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:48:11,853 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:48:11,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:48:11,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:48:11,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:48:11,926 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:48:11,926 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:48:11,928 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label24_true-unreach-call.c [2018-10-25 01:48:11,986 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/03e34bf14/65738d89089d4df69121ce8ce95477ed/FLAG07861ee35 [2018-10-25 01:48:12,710 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:48:12,711 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label24_true-unreach-call.c [2018-10-25 01:48:12,736 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/03e34bf14/65738d89089d4df69121ce8ce95477ed/FLAG07861ee35 [2018-10-25 01:48:12,757 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/03e34bf14/65738d89089d4df69121ce8ce95477ed [2018-10-25 01:48:12,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:48:12,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:48:12,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:48:12,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:48:12,778 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:48:12,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:48:12" (1/1) ... [2018-10-25 01:48:12,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f158897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:12, skipping insertion in model container [2018-10-25 01:48:12,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:48:12" (1/1) ... [2018-10-25 01:48:12,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:48:12,910 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:48:13,876 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:48:13,881 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:48:14,174 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:48:14,198 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:48:14,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14 WrapperNode [2018-10-25 01:48:14,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:48:14,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:48:14,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:48:14,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:48:14,211 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:48:14" (1/1) ... [2018-10-25 01:48:14,269 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:48:14" (1/1) ... [2018-10-25 01:48:14,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:48:14,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:48:14,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:48:14,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:48:14,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14" (1/1) ... [2018-10-25 01:48:14,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14" (1/1) ... [2018-10-25 01:48:14,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14" (1/1) ... [2018-10-25 01:48:14,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14" (1/1) ... [2018-10-25 01:48:14,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14" (1/1) ... [2018-10-25 01:48:14,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14" (1/1) ... [2018-10-25 01:48:14,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14" (1/1) ... [2018-10-25 01:48:14,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:48:14,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:48:14,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:48:14,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:48:14,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14" (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:48:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:48:14,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:48:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:48:14,848 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:48:14,849 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:48:14,849 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:48:14,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:48:14,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:48:14,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:48:14,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:48:22,442 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:48:22,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:48:22 BoogieIcfgContainer [2018-10-25 01:48:22,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:48:22,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:48:22,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:48:22,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:48:22,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:48:12" (1/3) ... [2018-10-25 01:48:22,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14258f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:48:22, skipping insertion in model container [2018-10-25 01:48:22,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:48:14" (2/3) ... [2018-10-25 01:48:22,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14258f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:48:22, skipping insertion in model container [2018-10-25 01:48:22,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:48:22" (3/3) ... [2018-10-25 01:48:22,453 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label24_true-unreach-call.c [2018-10-25 01:48:22,462 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:48:22,471 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:48:22,490 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:48:22,532 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:48:22,532 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:48:22,532 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:48:22,532 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:48:22,532 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:48:22,533 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:48:22,533 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:48:22,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:48:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-10-25 01:48:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-25 01:48:22,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:48:22,585 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] [2018-10-25 01:48:22,587 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:48:22,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1425761551, now seen corresponding path program 1 times [2018-10-25 01:48:22,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:48:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:22,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:48:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:22,646 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:48:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:48:23,090 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:48:23,248 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:48:23,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:48:23,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:48:23,257 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:48:23,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:48:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:48:23,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:48:23,294 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 3 states. [2018-10-25 01:48:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:48:28,642 INFO L93 Difference]: Finished difference Result 1198 states and 2158 transitions. [2018-10-25 01:48:28,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:48:28,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-25 01:48:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:48:28,673 INFO L225 Difference]: With dead ends: 1198 [2018-10-25 01:48:28,673 INFO L226 Difference]: Without dead ends: 758 [2018-10-25 01:48:28,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:48:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-10-25 01:48:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2018-10-25 01:48:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-10-25 01:48:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1328 transitions. [2018-10-25 01:48:28,804 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1328 transitions. Word has length 45 [2018-10-25 01:48:28,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:48:28,804 INFO L481 AbstractCegarLoop]: Abstraction has 754 states and 1328 transitions. [2018-10-25 01:48:28,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:48:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1328 transitions. [2018-10-25 01:48:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-25 01:48:28,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:48:28,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:28,813 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:48:28,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash 146607380, now seen corresponding path program 1 times [2018-10-25 01:48:28,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:48:28,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:28,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:48:28,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:28,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:48:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:48:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:48:29,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:48:29,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:48:29,119 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:48:29,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:48:29,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:48:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:48:29,123 INFO L87 Difference]: Start difference. First operand 754 states and 1328 transitions. Second operand 5 states. [2018-10-25 01:48:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:48:36,870 INFO L93 Difference]: Finished difference Result 2229 states and 3961 transitions. [2018-10-25 01:48:36,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:48:36,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-10-25 01:48:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:48:36,883 INFO L225 Difference]: With dead ends: 2229 [2018-10-25 01:48:36,883 INFO L226 Difference]: Without dead ends: 1481 [2018-10-25 01:48:36,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:48:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2018-10-25 01:48:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1449. [2018-10-25 01:48:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2018-10-25 01:48:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2254 transitions. [2018-10-25 01:48:36,962 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2254 transitions. Word has length 119 [2018-10-25 01:48:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:48:36,963 INFO L481 AbstractCegarLoop]: Abstraction has 1449 states and 2254 transitions. [2018-10-25 01:48:36,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:48:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2254 transitions. [2018-10-25 01:48:36,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-25 01:48:36,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:48:36,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:36,980 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:48:36,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:36,981 INFO L82 PathProgramCache]: Analyzing trace with hash -762150644, now seen corresponding path program 1 times [2018-10-25 01:48:36,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:48:36,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:36,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:48:36,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:36,984 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:48:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:48:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:48:37,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:48:37,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:48:37,259 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:48:37,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:48:37,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:48:37,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:48:37,260 INFO L87 Difference]: Start difference. First operand 1449 states and 2254 transitions. Second operand 6 states. [2018-10-25 01:48:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:48:45,468 INFO L93 Difference]: Finished difference Result 4188 states and 6605 transitions. [2018-10-25 01:48:45,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:48:45,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-10-25 01:48:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:48:45,490 INFO L225 Difference]: With dead ends: 4188 [2018-10-25 01:48:45,490 INFO L226 Difference]: Without dead ends: 2745 [2018-10-25 01:48:45,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:48:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2018-10-25 01:48:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2711. [2018-10-25 01:48:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2018-10-25 01:48:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3819 transitions. [2018-10-25 01:48:45,588 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3819 transitions. Word has length 131 [2018-10-25 01:48:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:48:45,588 INFO L481 AbstractCegarLoop]: Abstraction has 2711 states and 3819 transitions. [2018-10-25 01:48:45,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:48:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3819 transitions. [2018-10-25 01:48:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 01:48:45,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:48:45,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,591 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:48:45,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash -131413768, now seen corresponding path program 1 times [2018-10-25 01:48:45,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:48:45,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:45,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:48:45,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:45,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:48:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:48:45,905 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:48:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:48:46,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:48:46,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:48:46,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:48:46,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:48:46,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:48:46,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:48:46,078 INFO L87 Difference]: Start difference. First operand 2711 states and 3819 transitions. Second operand 6 states. [2018-10-25 01:48:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:48:51,558 INFO L93 Difference]: Finished difference Result 6682 states and 9546 transitions. [2018-10-25 01:48:51,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:48:51,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-10-25 01:48:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:48:51,580 INFO L225 Difference]: With dead ends: 6682 [2018-10-25 01:48:51,580 INFO L226 Difference]: Without dead ends: 3977 [2018-10-25 01:48:51,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:48:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2018-10-25 01:48:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3953. [2018-10-25 01:48:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3953 states. [2018-10-25 01:48:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5247 transitions. [2018-10-25 01:48:51,701 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5247 transitions. Word has length 132 [2018-10-25 01:48:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:48:51,701 INFO L481 AbstractCegarLoop]: Abstraction has 3953 states and 5247 transitions. [2018-10-25 01:48:51,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:48:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5247 transitions. [2018-10-25 01:48:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-25 01:48:51,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:48:51,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:51,713 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:48:51,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:48:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 61536093, now seen corresponding path program 1 times [2018-10-25 01:48:51,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:48:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:51,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:48:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:48:51,715 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:48:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:48:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:48:52,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:48:52,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:48:52,323 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:48:52,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:48:52,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:48:52,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:48:52,325 INFO L87 Difference]: Start difference. First operand 3953 states and 5247 transitions. Second operand 6 states. [2018-10-25 01:49:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:49:07,556 INFO L93 Difference]: Finished difference Result 14092 states and 19045 transitions. [2018-10-25 01:49:07,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:49:07,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2018-10-25 01:49:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:49:07,602 INFO L225 Difference]: With dead ends: 14092 [2018-10-25 01:49:07,603 INFO L226 Difference]: Without dead ends: 10145 [2018-10-25 01:49:07,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:49:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10145 states. [2018-10-25 01:49:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10145 to 9934. [2018-10-25 01:49:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9934 states. [2018-10-25 01:49:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9934 states to 9934 states and 12579 transitions. [2018-10-25 01:49:07,886 INFO L78 Accepts]: Start accepts. Automaton has 9934 states and 12579 transitions. Word has length 172 [2018-10-25 01:49:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:49:07,887 INFO L481 AbstractCegarLoop]: Abstraction has 9934 states and 12579 transitions. [2018-10-25 01:49:07,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:49:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9934 states and 12579 transitions. [2018-10-25 01:49:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-25 01:49:07,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:49:07,896 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:49:07,896 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:49:07,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:49:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash 183841615, now seen corresponding path program 1 times [2018-10-25 01:49:07,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:49:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:49:07,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:49:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:49:07,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:49:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:49:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-25 01:49:08,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:49:08,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:49:08,212 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:49:08,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:49:08,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:49:08,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:49:08,214 INFO L87 Difference]: Start difference. First operand 9934 states and 12579 transitions. Second operand 4 states. [2018-10-25 01:49:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:49:14,056 INFO L93 Difference]: Finished difference Result 31159 states and 40874 transitions. [2018-10-25 01:49:14,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:49:14,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-10-25 01:49:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:49:14,160 INFO L225 Difference]: With dead ends: 31159 [2018-10-25 01:49:14,160 INFO L226 Difference]: Without dead ends: 21231 [2018-10-25 01:49:14,224 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:49:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21231 states. [2018-10-25 01:49:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21231 to 20903. [2018-10-25 01:49:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20903 states. [2018-10-25 01:49:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20903 states to 20903 states and 25690 transitions. [2018-10-25 01:49:14,723 INFO L78 Accepts]: Start accepts. Automaton has 20903 states and 25690 transitions. Word has length 200 [2018-10-25 01:49:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:49:14,723 INFO L481 AbstractCegarLoop]: Abstraction has 20903 states and 25690 transitions. [2018-10-25 01:49:14,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:49:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 20903 states and 25690 transitions. [2018-10-25 01:49:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-25 01:49:14,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:49:14,741 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:49:14,741 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:49:14,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:49:14,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1258150557, now seen corresponding path program 1 times [2018-10-25 01:49:14,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:49:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:49:14,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:49:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:49:14,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:49:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:49:14,994 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-10-25 01:49:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-25 01:49:15,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:49:15,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:49:15,017 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:49:15,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:49:15,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:49:15,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:49:15,018 INFO L87 Difference]: Start difference. First operand 20903 states and 25690 transitions. Second operand 3 states. [2018-10-25 01:49:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:49:18,882 INFO L93 Difference]: Finished difference Result 47534 states and 60369 transitions. [2018-10-25 01:49:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:49:18,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-10-25 01:49:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:49:19,013 INFO L225 Difference]: With dead ends: 47534 [2018-10-25 01:49:19,014 INFO L226 Difference]: Without dead ends: 26637 [2018-10-25 01:49:19,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:49:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26637 states. [2018-10-25 01:49:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26637 to 26543. [2018-10-25 01:49:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26543 states. [2018-10-25 01:49:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26543 states to 26543 states and 33539 transitions. [2018-10-25 01:49:20,058 INFO L78 Accepts]: Start accepts. Automaton has 26543 states and 33539 transitions. Word has length 213 [2018-10-25 01:49:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:49:20,058 INFO L481 AbstractCegarLoop]: Abstraction has 26543 states and 33539 transitions. [2018-10-25 01:49:20,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:49:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 26543 states and 33539 transitions. [2018-10-25 01:49:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-25 01:49:20,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:49:20,074 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:49:20,074 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:49:20,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:49:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash -79355213, now seen corresponding path program 1 times [2018-10-25 01:49:20,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:49:20,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:49:20,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:49:20,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:49:20,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:49:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:49:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:49:20,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:49:20,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:49:20,620 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-10-25 01:49:20,622 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [660], [663], [667], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-25 01:49:20,672 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:49:20,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:49:21,166 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:49:21,168 INFO L272 AbstractInterpreter]: Visited 95 different actions 95 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-25 01:49:21,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:49:21,211 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:49:21,700 INFO L232 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 77.9% of their original sizes. [2018-10-25 01:49:21,700 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:49:21,888 INFO L413 sIntCurrentIteration]: We have 217 unified AI predicates [2018-10-25 01:49:21,888 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:49:21,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:49:21,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 01:49:21,890 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:49:21,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:49:21,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:49:21,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:49:21,891 INFO L87 Difference]: Start difference. First operand 26543 states and 33539 transitions. Second operand 6 states. [2018-10-25 01:50:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:50:09,746 INFO L93 Difference]: Finished difference Result 53390 states and 67433 transitions. [2018-10-25 01:50:09,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:50:09,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2018-10-25 01:50:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:50:09,840 INFO L225 Difference]: With dead ends: 53390 [2018-10-25 01:50:09,840 INFO L226 Difference]: Without dead ends: 26853 [2018-10-25 01:50:09,921 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 218 GetRequests, 213 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:50:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26853 states. [2018-10-25 01:50:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26853 to 26851. [2018-10-25 01:50:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26851 states. [2018-10-25 01:50:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26851 states to 26851 states and 33856 transitions. [2018-10-25 01:50:10,430 INFO L78 Accepts]: Start accepts. Automaton has 26851 states and 33856 transitions. Word has length 218 [2018-10-25 01:50:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:50:10,430 INFO L481 AbstractCegarLoop]: Abstraction has 26851 states and 33856 transitions. [2018-10-25 01:50:10,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:50:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 26851 states and 33856 transitions. [2018-10-25 01:50:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-25 01:50:10,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:50:10,454 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:50:10,454 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:50:10,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:10,455 INFO L82 PathProgramCache]: Analyzing trace with hash -174466883, now seen corresponding path program 1 times [2018-10-25 01:50:10,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:50:10,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:10,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:50:10,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:50:10,456 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:50:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:50:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 286 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-25 01:50:11,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:50:11,100 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:50:11,101 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-10-25 01:50:11,101 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [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], [333], [335], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [660], [663], [667], [668], [672], [676], [680], [684], [688], [691], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-10-25 01:50:11,106 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:50:11,106 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:50:11,327 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:50:11,327 INFO L272 AbstractInterpreter]: Visited 105 different actions 302 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-10-25 01:50:11,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:50:11,332 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:50:11,867 INFO L232 lantSequenceWeakener]: Weakened 309 states. On average, predicates are now at 78.24% of their original sizes. [2018-10-25 01:50:11,867 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:50:12,140 INFO L413 sIntCurrentIteration]: We have 313 unified AI predicates [2018-10-25 01:50:12,141 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:50:12,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:50:12,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-10-25 01:50:12,141 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:50:12,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 01:50:12,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 01:50:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:50:12,142 INFO L87 Difference]: Start difference. First operand 26851 states and 33856 transitions. Second operand 9 states. Received shutdown request... [2018-10-25 01:52:11,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 01:52:11,735 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-25 01:52:11,741 WARN L205 ceAbstractionStarter]: Timeout [2018-10-25 01:52:11,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 01:52:11 BoogieIcfgContainer [2018-10-25 01:52:11,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 01:52:11,742 INFO L168 Benchmark]: Toolchain (without parser) took 238972.48 ms. Allocated memory was 1.6 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -549.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:52:11,744 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:52:11,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1426.78 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:11,745 INFO L168 Benchmark]: Boogie Procedure Inliner took 379.58 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -893.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:11,746 INFO L168 Benchmark]: Boogie Preprocessor took 196.84 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:52:11,747 INFO L168 Benchmark]: RCFGBuilder took 7666.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 309.6 MB). Peak memory consumption was 309.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:52:11,748 INFO L168 Benchmark]: TraceAbstraction took 229296.56 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: -84.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-25 01:52:11,753 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.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1426.78 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 379.58 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 774.9 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -893.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 196.84 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 7666.84 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 309.6 MB). Peak memory consumption was 309.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229296.56 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: -84.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 121). Cancelled while BasicCegarLoop was constructing difference of abstraction (26851states) and FLOYD_HOARE automaton (currently 12 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (30685 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 438 locations, 1 error locations. TIMEOUT Result, 229.2s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 219.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2342 SDtfs, 9739 SDslu, 2123 SDs, 0 SdLazy, 18430 SolverSat, 3459 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 181.7s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 589 GetRequests, 504 SyntacticMatches, 37 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26851occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.997109110684086 AbsIntWeakeningRatio, 0.11320754716981132 AbsIntAvgWeakeningVarsNumRemoved, 7.081132075471698 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 729 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1544 NumberOfCodeBlocks, 1544 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1535 ConstructedInterpolants, 0 QuantifiedInterpolants, 865398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 978/982 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown