java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label17_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 19:03:35,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 19:03:35,818 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 19:03:35,833 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 19:03:35,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 19:03:35,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 19:03:35,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 19:03:35,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 19:03:35,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 19:03:35,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 19:03:35,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 19:03:35,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 19:03:35,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 19:03:35,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 19:03:35,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 19:03:35,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 19:03:35,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 19:03:35,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 19:03:35,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 19:03:35,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 19:03:35,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 19:03:35,869 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 19:03:35,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 19:03:35,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 19:03:35,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 19:03:35,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 19:03:35,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 19:03:35,884 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 19:03:35,885 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 19:03:35,886 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 19:03:35,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 19:03:35,889 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 19:03:35,889 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 19:03:35,889 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 19:03:35,892 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 19:03:35,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 19:03:35,893 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 19:03:35,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 19:03:35,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 19:03:35,914 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 19:03:35,914 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 19:03:35,914 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 19:03:35,915 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 19:03:35,915 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 19:03:35,915 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 19:03:35,915 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 19:03:35,915 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 19:03:35,915 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 19:03:35,916 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 19:03:35,916 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 19:03:35,916 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 19:03:35,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 19:03:35,917 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 19:03:35,917 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 19:03:35,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 19:03:35,917 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 19:03:35,918 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 19:03:35,918 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 19:03:35,918 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 19:03:35,918 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 19:03:35,918 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 19:03:35,920 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 19:03:35,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:03:35,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 19:03:35,920 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 19:03:35,920 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 19:03:35,921 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 19:03:35,921 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 19:03:35,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 19:03:35,921 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 19:03:35,921 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 19:03:35,922 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 19:03:35,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 19:03:35,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 19:03:36,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 19:03:36,003 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 19:03:36,003 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 19:03:36,004 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label17_true-unreach-call_false-termination.c [2018-11-12 19:03:36,073 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd654e88/d3803023456145d2a165ff6b1023a89a/FLAG394c48e83 [2018-11-12 19:03:36,673 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 19:03:36,679 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label17_true-unreach-call_false-termination.c [2018-11-12 19:03:36,708 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd654e88/d3803023456145d2a165ff6b1023a89a/FLAG394c48e83 [2018-11-12 19:03:36,725 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd654e88/d3803023456145d2a165ff6b1023a89a [2018-11-12 19:03:36,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 19:03:36,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 19:03:36,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 19:03:36,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 19:03:36,746 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 19:03:36,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:03:36" (1/1) ... [2018-11-12 19:03:36,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c7a8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:36, skipping insertion in model container [2018-11-12 19:03:36,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:03:36" (1/1) ... [2018-11-12 19:03:36,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 19:03:36,842 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 19:03:37,387 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:03:37,392 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 19:03:37,558 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:03:37,576 INFO L193 MainTranslator]: Completed translation [2018-11-12 19:03:37,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37 WrapperNode [2018-11-12 19:03:37,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 19:03:37,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 19:03:37,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 19:03:37,578 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 19:03:37,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... [2018-11-12 19:03:37,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... [2018-11-12 19:03:37,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 19:03:37,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 19:03:37,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 19:03:37,723 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 19:03:37,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... [2018-11-12 19:03:37,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... [2018-11-12 19:03:37,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... [2018-11-12 19:03:37,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... [2018-11-12 19:03:37,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... [2018-11-12 19:03:37,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... [2018-11-12 19:03:37,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... [2018-11-12 19:03:37,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 19:03:37,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 19:03:37,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 19:03:37,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 19:03:37,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:03:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 19:03:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 19:03:37,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 19:03:37,909 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 19:03:37,910 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 19:03:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 19:03:37,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 19:03:37,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 19:03:37,910 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 19:03:41,346 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 19:03:41,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:03:41 BoogieIcfgContainer [2018-11-12 19:03:41,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 19:03:41,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 19:03:41,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 19:03:41,353 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 19:03:41,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:03:36" (1/3) ... [2018-11-12 19:03:41,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f472c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:03:41, skipping insertion in model container [2018-11-12 19:03:41,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:03:37" (2/3) ... [2018-11-12 19:03:41,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f472c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:03:41, skipping insertion in model container [2018-11-12 19:03:41,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:03:41" (3/3) ... [2018-11-12 19:03:41,359 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label17_true-unreach-call_false-termination.c [2018-11-12 19:03:41,369 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 19:03:41,380 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 19:03:41,399 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 19:03:41,445 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 19:03:41,445 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 19:03:41,446 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 19:03:41,446 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 19:03:41,446 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 19:03:41,446 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 19:03:41,446 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 19:03:41,447 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 19:03:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-12 19:03:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-12 19:03:41,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:41,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:03:41,511 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:41,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1535437935, now seen corresponding path program 1 times [2018-11-12 19:03:41,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:41,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:41,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:41,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:41,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:42,023 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:03:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:42,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:03:42,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:03:42,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:42,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:03:42,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:03:42,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:03:42,163 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-12 19:03:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:43,737 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-12 19:03:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:03:43,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-12 19:03:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:43,760 INFO L225 Difference]: With dead ends: 691 [2018-11-12 19:03:43,761 INFO L226 Difference]: Without dead ends: 434 [2018-11-12 19:03:43,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:03:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-12 19:03:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-12 19:03:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-12 19:03:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 755 transitions. [2018-11-12 19:03:43,873 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 755 transitions. Word has length 63 [2018-11-12 19:03:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:43,874 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 755 transitions. [2018-11-12 19:03:43,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:03:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 755 transitions. [2018-11-12 19:03:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-12 19:03:43,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:43,891 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, 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] [2018-11-12 19:03:43,892 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:43,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1025550080, now seen corresponding path program 1 times [2018-11-12 19:03:43,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:43,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:43,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:43,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:43,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:44,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:03:44,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:03:44,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:44,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:03:44,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:03:44,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:03:44,243 INFO L87 Difference]: Start difference. First operand 434 states and 755 transitions. Second operand 6 states. [2018-11-12 19:03:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:46,481 INFO L93 Difference]: Finished difference Result 1254 states and 2256 transitions. [2018-11-12 19:03:46,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:03:46,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-11-12 19:03:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:46,497 INFO L225 Difference]: With dead ends: 1254 [2018-11-12 19:03:46,497 INFO L226 Difference]: Without dead ends: 826 [2018-11-12 19:03:46,500 INFO L604 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-11-12 19:03:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2018-11-12 19:03:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 812. [2018-11-12 19:03:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2018-11-12 19:03:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1377 transitions. [2018-11-12 19:03:46,584 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1377 transitions. Word has length 143 [2018-11-12 19:03:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:46,584 INFO L480 AbstractCegarLoop]: Abstraction has 812 states and 1377 transitions. [2018-11-12 19:03:46,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:03:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1377 transitions. [2018-11-12 19:03:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-12 19:03:46,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:46,590 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, 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] [2018-11-12 19:03:46,591 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:46,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1017512645, now seen corresponding path program 1 times [2018-11-12 19:03:46,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:46,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:46,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:46,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:03:46,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 19:03:46,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:46,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:03:46,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:03:46,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:03:46,849 INFO L87 Difference]: Start difference. First operand 812 states and 1377 transitions. Second operand 4 states. [2018-11-12 19:03:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:50,044 INFO L93 Difference]: Finished difference Result 1988 states and 3388 transitions. [2018-11-12 19:03:50,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:03:50,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-11-12 19:03:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:50,061 INFO L225 Difference]: With dead ends: 1988 [2018-11-12 19:03:50,061 INFO L226 Difference]: Without dead ends: 1182 [2018-11-12 19:03:50,067 INFO L604 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-11-12 19:03:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-11-12 19:03:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2018-11-12 19:03:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-11-12 19:03:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1751 transitions. [2018-11-12 19:03:50,118 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1751 transitions. Word has length 176 [2018-11-12 19:03:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:50,119 INFO L480 AbstractCegarLoop]: Abstraction has 1182 states and 1751 transitions. [2018-11-12 19:03:50,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:03:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1751 transitions. [2018-11-12 19:03:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-12 19:03:50,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:50,128 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:03:50,128 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:50,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:50,128 INFO L82 PathProgramCache]: Analyzing trace with hash -234886452, now seen corresponding path program 1 times [2018-11-12 19:03:50,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:50,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:50,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:50,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:50,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:03:50,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:03:50,648 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:03:50,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:03:50,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:03:50,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:03:50,650 INFO L87 Difference]: Start difference. First operand 1182 states and 1751 transitions. Second operand 6 states. [2018-11-12 19:03:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:03:54,480 INFO L93 Difference]: Finished difference Result 3270 states and 4972 transitions. [2018-11-12 19:03:54,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 19:03:54,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2018-11-12 19:03:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:03:54,496 INFO L225 Difference]: With dead ends: 3270 [2018-11-12 19:03:54,496 INFO L226 Difference]: Without dead ends: 2094 [2018-11-12 19:03:54,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:03:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-11-12 19:03:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2013. [2018-11-12 19:03:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2013 states. [2018-11-12 19:03:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2916 transitions. [2018-11-12 19:03:54,582 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2916 transitions. Word has length 229 [2018-11-12 19:03:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:03:54,583 INFO L480 AbstractCegarLoop]: Abstraction has 2013 states and 2916 transitions. [2018-11-12 19:03:54,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:03:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2916 transitions. [2018-11-12 19:03:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-12 19:03:54,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:03:54,595 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 19:03:54,595 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:03:54,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash -356461826, now seen corresponding path program 1 times [2018-11-12 19:03:54,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:03:54,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:54,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:03:54,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:03:54,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:03:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:03:55,218 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:03:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 195 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:03:56,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:03:56,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:03:56,037 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-11-12 19:03:56,039 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], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [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], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:03:56,098 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:03:56,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:03:57,435 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:03:57,442 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:03:57,444 INFO L272 AbstractInterpreter]: Visited 174 different actions 341 times. Merged at 4 different actions 4 times. Never widened. Performed 3613 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3613 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:03:57,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:03:57,488 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:03:58,650 INFO L227 lantSequenceWeakener]: Weakened 128 states. On average, predicates are now at 78.16% of their original sizes. [2018-11-12 19:03:58,651 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:01,263 INFO L415 sIntCurrentIteration]: We unified 313 AI predicates to 313 [2018-11-12 19:04:01,264 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:01,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:01,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [14] total 33 [2018-11-12 19:04:01,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:01,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 19:04:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 19:04:01,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-12 19:04:01,267 INFO L87 Difference]: Start difference. First operand 2013 states and 2916 transitions. Second operand 21 states. [2018-11-12 19:04:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:04:38,062 INFO L93 Difference]: Finished difference Result 6449 states and 9313 transitions. [2018-11-12 19:04:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 19:04:38,062 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 314 [2018-11-12 19:04:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:04:38,082 INFO L225 Difference]: With dead ends: 6449 [2018-11-12 19:04:38,082 INFO L226 Difference]: Without dead ends: 4442 [2018-11-12 19:04:38,094 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 324 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-12 19:04:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2018-11-12 19:04:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4183. [2018-11-12 19:04:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4183 states. [2018-11-12 19:04:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 5183 transitions. [2018-11-12 19:04:38,199 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 5183 transitions. Word has length 314 [2018-11-12 19:04:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:04:38,200 INFO L480 AbstractCegarLoop]: Abstraction has 4183 states and 5183 transitions. [2018-11-12 19:04:38,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 19:04:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 5183 transitions. [2018-11-12 19:04:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-12 19:04:38,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:04:38,214 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 19:04:38,215 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:04:38,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash 964371846, now seen corresponding path program 1 times [2018-11-12 19:04:38,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:04:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:38,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:04:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:04:38,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:04:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:04:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 231 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:04:39,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:04:39,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:04:39,201 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 351 with the following transitions: [2018-11-12 19:04:39,202 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], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [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], [698], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:04:39,208 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:04:39,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:04:39,454 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:04:39,457 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:04:39,457 INFO L272 AbstractInterpreter]: Visited 174 different actions 341 times. Merged at 4 different actions 4 times. Never widened. Performed 3613 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3613 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:04:39,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:04:39,461 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:04:40,582 INFO L227 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 78% of their original sizes. [2018-11-12 19:04:40,582 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:04:42,317 INFO L415 sIntCurrentIteration]: We unified 349 AI predicates to 349 [2018-11-12 19:04:42,318 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:04:42,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:04:42,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [13] total 35 [2018-11-12 19:04:42,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:04:42,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 19:04:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 19:04:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-11-12 19:04:42,321 INFO L87 Difference]: Start difference. First operand 4183 states and 5183 transitions. Second operand 24 states. [2018-11-12 19:05:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:16,117 INFO L93 Difference]: Finished difference Result 8072 states and 10964 transitions. [2018-11-12 19:05:16,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 19:05:16,118 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 350 [2018-11-12 19:05:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:16,144 INFO L225 Difference]: With dead ends: 8072 [2018-11-12 19:05:16,144 INFO L226 Difference]: Without dead ends: 6254 [2018-11-12 19:05:16,155 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 360 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 19:05:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2018-11-12 19:05:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 5109. [2018-11-12 19:05:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5109 states. [2018-11-12 19:05:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 6139 transitions. [2018-11-12 19:05:16,288 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 6139 transitions. Word has length 350 [2018-11-12 19:05:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:16,289 INFO L480 AbstractCegarLoop]: Abstraction has 5109 states and 6139 transitions. [2018-11-12 19:05:16,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 19:05:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 6139 transitions. [2018-11-12 19:05:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-11-12 19:05:16,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:16,308 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-11-12 19:05:16,308 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:16,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:16,310 INFO L82 PathProgramCache]: Analyzing trace with hash -277912097, now seen corresponding path program 1 times [2018-11-12 19:05:16,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:16,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:16,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:16,846 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:05:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 207 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:05:17,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:17,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:17,982 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 376 with the following transitions: [2018-11-12 19:05:17,982 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], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [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], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:17,988 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:17,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:18,247 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:18,250 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:18,250 INFO L272 AbstractInterpreter]: Visited 174 different actions 341 times. Merged at 4 different actions 4 times. Never widened. Performed 4613 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4613 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:05:18,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:18,256 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:18,757 INFO L227 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 78.17% of their original sizes. [2018-11-12 19:05:18,757 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:19,316 INFO L415 sIntCurrentIteration]: We unified 374 AI predicates to 374 [2018-11-12 19:05:19,316 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:19,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:19,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 31 [2018-11-12 19:05:19,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:19,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 19:05:19,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 19:05:19,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-12 19:05:19,319 INFO L87 Difference]: Start difference. First operand 5109 states and 6139 transitions. Second operand 20 states. [2018-11-12 19:05:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:05:41,422 INFO L93 Difference]: Finished difference Result 8873 states and 11740 transitions. [2018-11-12 19:05:41,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 19:05:41,422 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 375 [2018-11-12 19:05:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:05:41,450 INFO L225 Difference]: With dead ends: 8873 [2018-11-12 19:05:41,450 INFO L226 Difference]: Without dead ends: 7055 [2018-11-12 19:05:41,460 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 384 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-12 19:05:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7055 states. [2018-11-12 19:05:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7055 to 6031. [2018-11-12 19:05:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6031 states. [2018-11-12 19:05:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6031 states to 6031 states and 7093 transitions. [2018-11-12 19:05:41,609 INFO L78 Accepts]: Start accepts. Automaton has 6031 states and 7093 transitions. Word has length 375 [2018-11-12 19:05:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:05:41,610 INFO L480 AbstractCegarLoop]: Abstraction has 6031 states and 7093 transitions. [2018-11-12 19:05:41,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 19:05:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 6031 states and 7093 transitions. [2018-11-12 19:05:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-11-12 19:05:41,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:05:41,633 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:05:41,633 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:05:41,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:41,634 INFO L82 PathProgramCache]: Analyzing trace with hash 107396146, now seen corresponding path program 1 times [2018-11-12 19:05:41,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:05:41,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:41,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:05:41,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:05:41,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:05:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:05:42,185 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:05:42,354 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 19:05:42,561 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:05:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 194 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:05:43,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:05:43,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:05:43,250 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 389 with the following transitions: [2018-11-12 19:05:43,251 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], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [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], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:05:43,254 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:05:43,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:05:43,948 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:05:43,950 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:05:43,950 INFO L272 AbstractInterpreter]: Visited 174 different actions 341 times. Merged at 4 different actions 4 times. Never widened. Performed 4601 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4601 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:05:43,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:05:43,952 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:05:44,471 INFO L227 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 78.17% of their original sizes. [2018-11-12 19:05:44,471 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:05:45,151 INFO L415 sIntCurrentIteration]: We unified 387 AI predicates to 387 [2018-11-12 19:05:45,151 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:05:45,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:05:45,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [12] total 31 [2018-11-12 19:05:45,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:05:45,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 19:05:45,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 19:05:45,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-11-12 19:05:45,153 INFO L87 Difference]: Start difference. First operand 6031 states and 7093 transitions. Second operand 21 states. [2018-11-12 19:06:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:15,366 INFO L93 Difference]: Finished difference Result 9796 states and 12695 transitions. [2018-11-12 19:06:15,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 19:06:15,366 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 388 [2018-11-12 19:06:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:15,392 INFO L225 Difference]: With dead ends: 9796 [2018-11-12 19:06:15,392 INFO L226 Difference]: Without dead ends: 7978 [2018-11-12 19:06:15,401 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 397 GetRequests, 364 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2018-11-12 19:06:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7978 states. [2018-11-12 19:06:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7978 to 6953. [2018-11-12 19:06:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6953 states. [2018-11-12 19:06:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6953 states to 6953 states and 8047 transitions. [2018-11-12 19:06:15,530 INFO L78 Accepts]: Start accepts. Automaton has 6953 states and 8047 transitions. Word has length 388 [2018-11-12 19:06:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:15,531 INFO L480 AbstractCegarLoop]: Abstraction has 6953 states and 8047 transitions. [2018-11-12 19:06:15,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 19:06:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6953 states and 8047 transitions. [2018-11-12 19:06:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-11-12 19:06:15,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:15,555 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:06:15,555 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:15,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:15,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1887535862, now seen corresponding path program 1 times [2018-11-12 19:06:15,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:15,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:15,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:16,031 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 19:06:16,227 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 19:06:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 182 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:06:16,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:16,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:16,911 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 401 with the following transitions: [2018-11-12 19:06:16,911 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], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [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], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:16,913 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:16,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:17,201 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:17,212 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:17,212 INFO L272 AbstractInterpreter]: Visited 179 different actions 354 times. Merged at 5 different actions 7 times. Never widened. Performed 5271 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5271 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:06:17,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:17,219 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:17,656 INFO L227 lantSequenceWeakener]: Weakened 157 states. On average, predicates are now at 78% of their original sizes. [2018-11-12 19:06:17,657 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:18,213 INFO L415 sIntCurrentIteration]: We unified 399 AI predicates to 399 [2018-11-12 19:06:18,213 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:18,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:18,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [14] total 36 [2018-11-12 19:06:18,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:18,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 19:06:18,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 19:06:18,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2018-11-12 19:06:18,215 INFO L87 Difference]: Start difference. First operand 6953 states and 8047 transitions. Second operand 24 states. [2018-11-12 19:06:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:06:38,309 INFO L93 Difference]: Finished difference Result 10839 states and 13827 transitions. [2018-11-12 19:06:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 19:06:38,310 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 400 [2018-11-12 19:06:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:06:38,328 INFO L225 Difference]: With dead ends: 10839 [2018-11-12 19:06:38,329 INFO L226 Difference]: Without dead ends: 9021 [2018-11-12 19:06:38,339 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 410 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 19:06:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9021 states. [2018-11-12 19:06:38,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9021 to 7875. [2018-11-12 19:06:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7875 states. [2018-11-12 19:06:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 9001 transitions. [2018-11-12 19:06:38,479 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 9001 transitions. Word has length 400 [2018-11-12 19:06:38,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:06:38,480 INFO L480 AbstractCegarLoop]: Abstraction has 7875 states and 9001 transitions. [2018-11-12 19:06:38,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 19:06:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 9001 transitions. [2018-11-12 19:06:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-11-12 19:06:38,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:06:38,504 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, 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, 2, 2, 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] [2018-11-12 19:06:38,505 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:06:38,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:38,505 INFO L82 PathProgramCache]: Analyzing trace with hash 519519840, now seen corresponding path program 1 times [2018-11-12 19:06:38,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:06:38,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:38,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:06:38,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:06:38,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:06:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:06:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 256 proven. 110 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-12 19:06:39,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:06:39,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:06:39,195 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 426 with the following transitions: [2018-11-12 19:06:39,195 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], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [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], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:06:39,198 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:06:39,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:06:39,657 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:06:39,692 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:06:39,692 INFO L272 AbstractInterpreter]: Visited 175 different actions 523 times. Merged at 7 different actions 20 times. Never widened. Performed 6350 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6350 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 19:06:39,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:06:39,698 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:06:40,390 INFO L227 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 77.38% of their original sizes. [2018-11-12 19:06:40,390 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:06:42,197 INFO L415 sIntCurrentIteration]: We unified 424 AI predicates to 424 [2018-11-12 19:06:42,197 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:06:42,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:06:42,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-12 19:06:42,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:06:42,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 19:06:42,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 19:06:42,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-12 19:06:42,200 INFO L87 Difference]: Start difference. First operand 7875 states and 9001 transitions. Second operand 17 states. [2018-11-12 19:07:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:07:01,751 INFO L93 Difference]: Finished difference Result 11623 states and 14335 transitions. [2018-11-12 19:07:01,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 19:07:01,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 425 [2018-11-12 19:07:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:07:01,768 INFO L225 Difference]: With dead ends: 11623 [2018-11-12 19:07:01,769 INFO L226 Difference]: Without dead ends: 8576 [2018-11-12 19:07:01,779 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 436 GetRequests, 353 SyntacticMatches, 56 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-11-12 19:07:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2018-11-12 19:07:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 7706. [2018-11-12 19:07:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7706 states. [2018-11-12 19:07:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7706 states to 7706 states and 8892 transitions. [2018-11-12 19:07:01,914 INFO L78 Accepts]: Start accepts. Automaton has 7706 states and 8892 transitions. Word has length 425 [2018-11-12 19:07:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:07:01,915 INFO L480 AbstractCegarLoop]: Abstraction has 7706 states and 8892 transitions. [2018-11-12 19:07:01,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 19:07:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7706 states and 8892 transitions. [2018-11-12 19:07:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-11-12 19:07:01,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:07:01,933 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 19:07:01,934 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:07:01,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash -576713123, now seen corresponding path program 1 times [2018-11-12 19:07:01,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:07:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:01,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:01,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:07:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:02,572 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-11-12 19:07:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 375 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:07:03,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:03,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:07:03,520 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 451 with the following transitions: [2018-11-12 19:07:03,520 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], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [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], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:07:03,522 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:07:03,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:07:03,683 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:07:04,358 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:07:04,359 INFO L272 AbstractInterpreter]: Visited 175 different actions 519 times. Merged at 7 different actions 16 times. Never widened. Performed 6232 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:07:04,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:04,368 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:07:04,753 INFO L227 lantSequenceWeakener]: Weakened 447 states. On average, predicates are now at 80.4% of their original sizes. [2018-11-12 19:07:04,754 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:07:04,876 INFO L415 sIntCurrentIteration]: We unified 449 AI predicates to 449 [2018-11-12 19:07:04,876 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:07:04,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:07:04,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-11-12 19:07:04,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:07:04,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 19:07:04,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 19:07:04,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-12 19:07:04,877 INFO L87 Difference]: Start difference. First operand 7706 states and 8892 transitions. Second operand 10 states. [2018-11-12 19:07:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:07:08,920 INFO L93 Difference]: Finished difference Result 11976 states and 14479 transitions. [2018-11-12 19:07:08,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 19:07:08,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 450 [2018-11-12 19:07:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:07:08,946 INFO L225 Difference]: With dead ends: 11976 [2018-11-12 19:07:08,946 INFO L226 Difference]: Without dead ends: 8450 [2018-11-12 19:07:08,960 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 457 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-12 19:07:08,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8450 states. [2018-11-12 19:07:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8450 to 8430. [2018-11-12 19:07:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8430 states. [2018-11-12 19:07:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8430 states to 8430 states and 9754 transitions. [2018-11-12 19:07:09,103 INFO L78 Accepts]: Start accepts. Automaton has 8430 states and 9754 transitions. Word has length 450 [2018-11-12 19:07:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:07:09,104 INFO L480 AbstractCegarLoop]: Abstraction has 8430 states and 9754 transitions. [2018-11-12 19:07:09,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 19:07:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 8430 states and 9754 transitions. [2018-11-12 19:07:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-11-12 19:07:09,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:07:09,123 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 19:07:09,123 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:07:09,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:09,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2047477323, now seen corresponding path program 1 times [2018-11-12 19:07:09,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:07:09,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:09,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:09,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:07:09,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:07:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 528 proven. 175 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-12 19:07:11,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:11,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:07:11,448 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 524 with the following transitions: [2018-11-12 19:07:11,448 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], [393], [401], [405], [407], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [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], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [878], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-12 19:07:11,451 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:07:11,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:07:11,663 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:07:12,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:07:12,268 INFO L272 AbstractInterpreter]: Visited 177 different actions 880 times. Merged at 9 different actions 42 times. Widened at 1 different actions 1 times. Performed 10630 root evaluator evaluations with a maximum evaluation depth of 6. Performed 10630 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 9 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 19:07:12,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:07:12,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:07:12,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:07:12,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:07:12,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:07:12,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:07:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:07:12,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:07:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 522 proven. 2 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-12 19:07:13,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:07:13,278 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 19:07:13,384 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-12 19:07:13,712 WARN L179 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-12 19:07:13,898 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-12 19:07:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 522 proven. 2 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-12 19:07:15,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:07:15,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-11-12 19:07:15,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:07:15,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 19:07:15,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 19:07:15,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:07:15,054 INFO L87 Difference]: Start difference. First operand 8430 states and 9754 transitions. Second operand 17 states. Received shutdown request... [2018-11-12 19:07:19,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 19:07:19,973 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 19:07:19,978 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 19:07:19,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:07:19 BoogieIcfgContainer [2018-11-12 19:07:19,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 19:07:19,979 INFO L168 Benchmark]: Toolchain (without parser) took 223240.12 ms. Allocated memory was 1.5 GB in the beginning and 5.0 GB in the end (delta: 3.5 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,981 INFO L168 Benchmark]: CDTParser took 0.24 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-11-12 19:07:19,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.95 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,983 INFO L168 Benchmark]: Boogie Preprocessor took 110.28 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:07:19,984 INFO L168 Benchmark]: RCFGBuilder took 3514.07 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: 128.6 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,985 INFO L168 Benchmark]: TraceAbstraction took 218629.85 ms. Allocated memory was 2.3 GB in the beginning and 5.0 GB in the end (delta: 2.7 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -834.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-12 19:07:19,989 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.24 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 834.95 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 145.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -853.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.28 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3514.07 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: 128.6 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218629.85 ms. Allocated memory was 2.3 GB in the beginning and 5.0 GB in the end (delta: 2.7 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -834.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 172]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 172). Cancelled while BasicCegarLoop was constructing difference of abstraction (8430states) and FLOYD_HOARE automaton (currently 21 states, 17 states before enhancement),while ReachableStatesComputation was computing reachable states (8634 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. TIMEOUT Result, 218.5s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 182.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2139 SDtfs, 31192 SDslu, 1961 SDs, 0 SdLazy, 33286 SolverSat, 5067 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 67.4s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 3889 GetRequests, 3572 SyntacticMatches, 70 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2322 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8430occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.1s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9978838598840044 AbsIntWeakeningRatio, 0.07198515769944341 AbsIntAvgWeakeningVarsNumRemoved, 13.56103896103896 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 5584 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 4359 NumberOfCodeBlocks, 4359 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4868 ConstructedInterpolants, 0 QuantifiedInterpolants, 20642633 SizeOfPredicates, 6 NumberOfNonLiveVariables, 781 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 4034/4675 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown