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/Problem15_label25_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 16:36:24,707 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 16:36:24,711 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 16:36:24,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 16:36:24,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 16:36:24,728 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 16:36:24,729 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 16:36:24,731 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 16:36:24,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 16:36:24,733 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 16:36:24,734 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 16:36:24,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 16:36:24,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 16:36:24,737 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 16:36:24,742 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 16:36:24,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 16:36:24,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 16:36:24,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 16:36:24,748 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 16:36:24,756 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 16:36:24,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 16:36:24,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 16:36:24,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 16:36:24,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 16:36:24,764 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 16:36:24,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 16:36:24,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 16:36:24,767 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 16:36:24,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 16:36:24,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 16:36:24,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 16:36:24,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 16:36:24,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 16:36:24,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 16:36:24,775 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 16:36:24,776 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 16:36:24,776 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 16:36:24,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 16:36:24,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 16:36:24,796 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 16:36:24,796 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 16:36:24,796 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 16:36:24,796 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 16:36:24,796 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 16:36:24,796 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 16:36:24,797 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 16:36:24,797 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 16:36:24,797 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 16:36:24,797 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 16:36:24,797 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 16:36:24,798 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 16:36:24,798 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 16:36:24,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 16:36:24,799 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 16:36:24,799 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 16:36:24,799 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 16:36:24,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 16:36:24,799 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 16:36:24,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 16:36:24,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 16:36:24,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 16:36:24,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 16:36:24,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:36:24,800 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 16:36:24,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 16:36:24,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 16:36:24,801 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 16:36:24,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 16:36:24,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 16:36:24,802 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 16:36:24,802 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 16:36:24,802 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 16:36:24,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 16:36:24,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 16:36:24,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 16:36:24,861 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 16:36:24,861 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 16:36:24,862 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label25_false-unreach-call.c [2018-11-12 16:36:24,923 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824490027/94f0a49b8275474c831c9927097aabfd/FLAG868b9cee2 [2018-11-12 16:36:25,592 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 16:36:25,593 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label25_false-unreach-call.c [2018-11-12 16:36:25,612 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824490027/94f0a49b8275474c831c9927097aabfd/FLAG868b9cee2 [2018-11-12 16:36:25,629 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/824490027/94f0a49b8275474c831c9927097aabfd [2018-11-12 16:36:25,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 16:36:25,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 16:36:25,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 16:36:25,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 16:36:25,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 16:36:25,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:36:25" (1/1) ... [2018-11-12 16:36:25,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0f503e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:25, skipping insertion in model container [2018-11-12 16:36:25,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:36:25" (1/1) ... [2018-11-12 16:36:25,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 16:36:25,744 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 16:36:26,592 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:36:26,597 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 16:36:27,002 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:36:27,026 INFO L193 MainTranslator]: Completed translation [2018-11-12 16:36:27,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27 WrapperNode [2018-11-12 16:36:27,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 16:36:27,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 16:36:27,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 16:36:27,029 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 16:36:27,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (1/1) ... [2018-11-12 16:36:27,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (1/1) ... [2018-11-12 16:36:27,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 16:36:27,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 16:36:27,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 16:36:27,260 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 16:36:27,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (1/1) ... [2018-11-12 16:36:27,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (1/1) ... [2018-11-12 16:36:27,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (1/1) ... [2018-11-12 16:36:27,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (1/1) ... [2018-11-12 16:36:27,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (1/1) ... [2018-11-12 16:36:27,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (1/1) ... [2018-11-12 16:36:27,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (1/1) ... [2018-11-12 16:36:27,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 16:36:27,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 16:36:27,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 16:36:27,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 16:36:27,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (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 16:36:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 16:36:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 16:36:27,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 16:36:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-12 16:36:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-12 16:36:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 16:36:27,499 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 16:36:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 16:36:27,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 16:36:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 16:36:27,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 16:36:33,776 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 16:36:33,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:36:33 BoogieIcfgContainer [2018-11-12 16:36:33,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 16:36:33,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 16:36:33,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 16:36:33,781 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 16:36:33,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:36:25" (1/3) ... [2018-11-12 16:36:33,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1663e9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:36:33, skipping insertion in model container [2018-11-12 16:36:33,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:36:27" (2/3) ... [2018-11-12 16:36:33,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1663e9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:36:33, skipping insertion in model container [2018-11-12 16:36:33,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:36:33" (3/3) ... [2018-11-12 16:36:33,785 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label25_false-unreach-call.c [2018-11-12 16:36:33,795 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 16:36:33,804 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 16:36:33,822 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 16:36:33,866 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 16:36:33,866 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 16:36:33,866 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 16:36:33,866 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 16:36:33,866 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 16:36:33,867 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 16:36:33,867 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 16:36:33,867 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 16:36:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-11-12 16:36:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 16:36:33,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:36:33,922 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] [2018-11-12 16:36:33,926 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:36:33,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:36:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash 480203289, now seen corresponding path program 1 times [2018-11-12 16:36:33,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:36:33,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:33,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:36:34,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:34,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:36:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:36:34,490 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-11-12 16:36:34,507 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 16:36:34,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:36:34,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:36:34,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:36:34,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:36:34,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:36:34,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:36:34,537 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 4 states. [2018-11-12 16:36:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:36:40,679 INFO L93 Difference]: Finished difference Result 1550 states and 2835 transitions. [2018-11-12 16:36:40,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:36:40,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-12 16:36:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:36:40,708 INFO L225 Difference]: With dead ends: 1550 [2018-11-12 16:36:40,708 INFO L226 Difference]: Without dead ends: 1106 [2018-11-12 16:36:40,720 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:36:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-11-12 16:36:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 762. [2018-11-12 16:36:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-12 16:36:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1263 transitions. [2018-11-12 16:36:40,842 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1263 transitions. Word has length 31 [2018-11-12 16:36:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:36:40,843 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 1263 transitions. [2018-11-12 16:36:40,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:36:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1263 transitions. [2018-11-12 16:36:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-12 16:36:40,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:36:40,855 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:36:40,855 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:36:40,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:36:40,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1889968228, now seen corresponding path program 1 times [2018-11-12 16:36:40,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:36:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:40,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:36:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:40,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:36:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:36:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:36:41,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:36:41,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 16:36:41,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:36:41,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 16:36:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 16:36:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 16:36:41,164 INFO L87 Difference]: Start difference. First operand 762 states and 1263 transitions. Second operand 5 states. [2018-11-12 16:36:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:36:46,467 INFO L93 Difference]: Finished difference Result 2248 states and 3762 transitions. [2018-11-12 16:36:46,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 16:36:46,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-12 16:36:46,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:36:46,484 INFO L225 Difference]: With dead ends: 2248 [2018-11-12 16:36:46,484 INFO L226 Difference]: Without dead ends: 1492 [2018-11-12 16:36:46,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 16:36:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2018-11-12 16:36:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1457. [2018-11-12 16:36:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2018-11-12 16:36:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2152 transitions. [2018-11-12 16:36:46,576 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2152 transitions. Word has length 104 [2018-11-12 16:36:46,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:36:46,577 INFO L480 AbstractCegarLoop]: Abstraction has 1457 states and 2152 transitions. [2018-11-12 16:36:46,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 16:36:46,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2152 transitions. [2018-11-12 16:36:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-12 16:36:46,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:36:46,583 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:36:46,584 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:36:46,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:36:46,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1891777420, now seen corresponding path program 1 times [2018-11-12 16:36:46,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:36:46,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:46,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:36:46,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:46,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:36:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:36:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:36:46,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:36:46,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:36:46,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:36:46,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:36:46,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:36:46,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:36:46,843 INFO L87 Difference]: Start difference. First operand 1457 states and 2152 transitions. Second operand 4 states. [2018-11-12 16:36:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:36:51,416 INFO L93 Difference]: Finished difference Result 5409 states and 8321 transitions. [2018-11-12 16:36:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:36:51,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-11-12 16:36:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:36:51,454 INFO L225 Difference]: With dead ends: 5409 [2018-11-12 16:36:51,455 INFO L226 Difference]: Without dead ends: 3958 [2018-11-12 16:36:51,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:36:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2018-11-12 16:36:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3953. [2018-11-12 16:36:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3953 states. [2018-11-12 16:36:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5491 transitions. [2018-11-12 16:36:51,590 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5491 transitions. Word has length 112 [2018-11-12 16:36:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:36:51,591 INFO L480 AbstractCegarLoop]: Abstraction has 3953 states and 5491 transitions. [2018-11-12 16:36:51,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:36:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5491 transitions. [2018-11-12 16:36:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-12 16:36:51,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:36:51,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:36:51,596 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:36:51,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:36:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash -105933602, now seen corresponding path program 1 times [2018-11-12 16:36:51,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:36:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:51,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:36:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:51,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:36:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:36:51,844 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:36:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:36:51,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:36:51,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:36:51,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:36:51,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:36:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:36:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:36:51,904 INFO L87 Difference]: Start difference. First operand 3953 states and 5491 transitions. Second operand 6 states. [2018-11-12 16:36:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:36:55,873 INFO L93 Difference]: Finished difference Result 9154 states and 12486 transitions. [2018-11-12 16:36:55,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:36:55,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-11-12 16:36:55,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:36:55,902 INFO L225 Difference]: With dead ends: 9154 [2018-11-12 16:36:55,902 INFO L226 Difference]: Without dead ends: 5207 [2018-11-12 16:36:55,927 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 16:36:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2018-11-12 16:36:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 5144. [2018-11-12 16:36:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5144 states. [2018-11-12 16:36:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5144 states to 5144 states and 6621 transitions. [2018-11-12 16:36:56,057 INFO L78 Accepts]: Start accepts. Automaton has 5144 states and 6621 transitions. Word has length 131 [2018-11-12 16:36:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:36:56,057 INFO L480 AbstractCegarLoop]: Abstraction has 5144 states and 6621 transitions. [2018-11-12 16:36:56,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:36:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 5144 states and 6621 transitions. [2018-11-12 16:36:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-12 16:36:56,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:36:56,062 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 16:36:56,062 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:36:56,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:36:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1626579703, now seen corresponding path program 1 times [2018-11-12 16:36:56,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:36:56,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:56,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:36:56,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:36:56,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:36:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:36:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-12 16:36:56,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:36:56,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:36:56,337 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:36:56,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:36:56,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:36:56,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:36:56,341 INFO L87 Difference]: Start difference. First operand 5144 states and 6621 transitions. Second operand 4 states. [2018-11-12 16:37:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:37:00,601 INFO L93 Difference]: Finished difference Result 16880 states and 22267 transitions. [2018-11-12 16:37:00,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:37:00,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-12 16:37:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:37:00,660 INFO L225 Difference]: With dead ends: 16880 [2018-11-12 16:37:00,661 INFO L226 Difference]: Without dead ends: 11742 [2018-11-12 16:37:00,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:37:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11742 states. [2018-11-12 16:37:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11742 to 11382. [2018-11-12 16:37:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11382 states. [2018-11-12 16:37:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11382 states to 11382 states and 13996 transitions. [2018-11-12 16:37:00,983 INFO L78 Accepts]: Start accepts. Automaton has 11382 states and 13996 transitions. Word has length 186 [2018-11-12 16:37:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:37:00,983 INFO L480 AbstractCegarLoop]: Abstraction has 11382 states and 13996 transitions. [2018-11-12 16:37:00,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:37:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 11382 states and 13996 transitions. [2018-11-12 16:37:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-12 16:37:00,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:37:00,990 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:37:00,990 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:37:00,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:00,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1918161605, now seen corresponding path program 1 times [2018-11-12 16:37:00,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:37:00,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:00,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:37:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:00,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:37:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:37:01,222 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-11-12 16:37:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 16:37:01,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:37:01,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:37:01,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:37:01,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:37:01,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:37:01,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:37:01,241 INFO L87 Difference]: Start difference. First operand 11382 states and 13996 transitions. Second operand 3 states. [2018-11-12 16:37:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:37:04,167 INFO L93 Difference]: Finished difference Result 27453 states and 34715 transitions. [2018-11-12 16:37:04,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:37:04,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2018-11-12 16:37:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:37:04,237 INFO L225 Difference]: With dead ends: 27453 [2018-11-12 16:37:04,238 INFO L226 Difference]: Without dead ends: 16077 [2018-11-12 16:37:04,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:37:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16077 states. [2018-11-12 16:37:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16077 to 16063. [2018-11-12 16:37:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16063 states. [2018-11-12 16:37:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16063 states to 16063 states and 20013 transitions. [2018-11-12 16:37:04,751 INFO L78 Accepts]: Start accepts. Automaton has 16063 states and 20013 transitions. Word has length 199 [2018-11-12 16:37:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:37:04,753 INFO L480 AbstractCegarLoop]: Abstraction has 16063 states and 20013 transitions. [2018-11-12 16:37:04,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:37:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 16063 states and 20013 transitions. [2018-11-12 16:37:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-12 16:37:04,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:37:04,762 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:37:04,762 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:37:04,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1276060231, now seen corresponding path program 1 times [2018-11-12 16:37:04,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:37:04,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:04,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:37:04,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:04,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:37:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:37:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-12 16:37:05,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:37:05,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:37:05,421 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-11-12 16:37:05,424 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [714], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:37:05,473 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:37:05,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:37:06,014 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:37:06,016 INFO L272 AbstractInterpreter]: Visited 105 different actions 105 times. Never merged. Never widened. Performed 990 root evaluator evaluations with a maximum evaluation depth of 4. Performed 990 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 24 variables. [2018-11-12 16:37:06,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:06,060 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:37:06,662 INFO L227 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 77.55% of their original sizes. [2018-11-12 16:37:06,662 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:37:07,149 INFO L415 sIntCurrentIteration]: We unified 211 AI predicates to 211 [2018-11-12 16:37:07,149 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:37:07,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:37:07,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-11-12 16:37:07,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:37:07,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 16:37:07,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 16:37:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-12 16:37:07,152 INFO L87 Difference]: Start difference. First operand 16063 states and 20013 transitions. Second operand 8 states. [2018-11-12 16:37:10,491 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:37:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:37:36,241 INFO L93 Difference]: Finished difference Result 32430 states and 40382 transitions. [2018-11-12 16:37:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 16:37:36,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2018-11-12 16:37:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:37:36,298 INFO L225 Difference]: With dead ends: 32430 [2018-11-12 16:37:36,298 INFO L226 Difference]: Without dead ends: 16373 [2018-11-12 16:37:36,343 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-12 16:37:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16373 states. [2018-11-12 16:37:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16373 to 16371. [2018-11-12 16:37:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16371 states. [2018-11-12 16:37:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16371 states to 16371 states and 20330 transitions. [2018-11-12 16:37:37,271 INFO L78 Accepts]: Start accepts. Automaton has 16371 states and 20330 transitions. Word has length 212 [2018-11-12 16:37:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:37:37,272 INFO L480 AbstractCegarLoop]: Abstraction has 16371 states and 20330 transitions. [2018-11-12 16:37:37,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 16:37:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 16371 states and 20330 transitions. [2018-11-12 16:37:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-12 16:37:37,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:37:37,285 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:37:37,285 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:37:37,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:37,286 INFO L82 PathProgramCache]: Analyzing trace with hash 725845603, now seen corresponding path program 1 times [2018-11-12 16:37:37,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:37:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:37,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:37:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:37:37,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:37:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:37:38,378 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-12 16:37:38,824 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-12 16:37:39,148 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-12 16:37:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 156 proven. 169 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 16:37:39,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:37:39,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:37:39,542 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-11-12 16:37:39,542 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [691], [692], [696], [707], [711], [714], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:37:39,559 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:37:39,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:37:39,708 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:37:40,608 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:37:40,608 INFO L272 AbstractInterpreter]: Visited 109 different actions 727 times. Merged at 5 different actions 30 times. Widened at 1 different actions 2 times. Performed 11722 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11722 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 16:37:40,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:37:40,652 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:37:41,605 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 78.01% of their original sizes. [2018-11-12 16:37:41,605 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:37:47,784 INFO L415 sIntCurrentIteration]: We unified 307 AI predicates to 307 [2018-11-12 16:37:47,785 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:37:47,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:37:47,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2018-11-12 16:37:47,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:37:47,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 16:37:47,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 16:37:47,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-12 16:37:47,788 INFO L87 Difference]: Start difference. First operand 16371 states and 20330 transitions. Second operand 15 states. [2018-11-12 16:38:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:38:25,951 INFO L93 Difference]: Finished difference Result 34460 states and 42685 transitions. [2018-11-12 16:38:25,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 16:38:25,951 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 308 [2018-11-12 16:38:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:38:26,030 INFO L225 Difference]: With dead ends: 34460 [2018-11-12 16:38:26,030 INFO L226 Difference]: Without dead ends: 18403 [2018-11-12 16:38:26,093 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 313 GetRequests, 128 SyntacticMatches, 166 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-11-12 16:38:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18403 states. [2018-11-12 16:38:26,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18403 to 17896. [2018-11-12 16:38:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17896 states. [2018-11-12 16:38:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17896 states to 17896 states and 21921 transitions. [2018-11-12 16:38:26,516 INFO L78 Accepts]: Start accepts. Automaton has 17896 states and 21921 transitions. Word has length 308 [2018-11-12 16:38:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:38:26,517 INFO L480 AbstractCegarLoop]: Abstraction has 17896 states and 21921 transitions. [2018-11-12 16:38:26,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 16:38:26,517 INFO L276 IsEmpty]: Start isEmpty. Operand 17896 states and 21921 transitions. [2018-11-12 16:38:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-11-12 16:38:26,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:38:26,530 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:38:26,531 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:38:26,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:38:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash -454445057, now seen corresponding path program 1 times [2018-11-12 16:38:26,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:38:26,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:38:26,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:38:26,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:38:26,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:38:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:38:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:38:27,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:38:27,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:38:27,209 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 405 with the following transitions: [2018-11-12 16:38:27,211 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [644], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1562], [1566], [1570], [1581], [1585], [1589], [1593], [1597], [1601], [1612], [1616], [1620], [1623], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:38:27,228 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:38:27,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:38:27,763 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:38:27,763 INFO L272 AbstractInterpreter]: Visited 295 different actions 584 times. Merged at 5 different actions 5 times. Never widened. Performed 8340 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8340 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 16:38:27,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:38:27,775 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:38:29,066 INFO L227 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 79.8% of their original sizes. [2018-11-12 16:38:29,066 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:38:29,388 INFO L415 sIntCurrentIteration]: We unified 403 AI predicates to 403 [2018-11-12 16:38:29,390 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:38:29,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:38:29,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-12 16:38:29,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:38:29,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 16:38:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 16:38:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-11-12 16:38:29,392 INFO L87 Difference]: Start difference. First operand 17896 states and 21921 transitions. Second operand 20 states. [2018-11-12 16:38:31,873 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:39:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:39:34,161 INFO L93 Difference]: Finished difference Result 34874 states and 43108 transitions. [2018-11-12 16:39:34,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 16:39:34,161 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 404 [2018-11-12 16:39:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:39:34,231 INFO L225 Difference]: With dead ends: 34874 [2018-11-12 16:39:34,231 INFO L226 Difference]: Without dead ends: 18817 [2018-11-12 16:39:34,270 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 419 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=1017, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 16:39:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18817 states. [2018-11-12 16:39:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18817 to 18811. [2018-11-12 16:39:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18811 states. [2018-11-12 16:39:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18811 states to 18811 states and 22916 transitions. [2018-11-12 16:39:34,594 INFO L78 Accepts]: Start accepts. Automaton has 18811 states and 22916 transitions. Word has length 404 [2018-11-12 16:39:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:39:34,595 INFO L480 AbstractCegarLoop]: Abstraction has 18811 states and 22916 transitions. [2018-11-12 16:39:34,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 16:39:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18811 states and 22916 transitions. [2018-11-12 16:39:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-11-12 16:39:34,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:39:34,617 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:39:34,617 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:39:34,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:39:34,618 INFO L82 PathProgramCache]: Analyzing trace with hash -784857709, now seen corresponding path program 1 times [2018-11-12 16:39:34,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:39:34,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:39:34,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:39:34,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:39:34,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:39:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:39:35,140 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:39:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 144 proven. 148 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 16:39:36,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:39:36,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:39:36,277 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 475 with the following transitions: [2018-11-12 16:39:36,278 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [566], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [644], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1562], [1566], [1570], [1581], [1585], [1589], [1593], [1597], [1601], [1612], [1616], [1620], [1623], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:39:36,283 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:39:36,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:39:36,509 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:39:37,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:39:37,020 INFO L272 AbstractInterpreter]: Visited 297 different actions 888 times. Merged at 7 different actions 21 times. Never widened. Performed 13048 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13048 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 16:39:37,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:39:37,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:39:37,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:39:37,029 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 16:39:37,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:39:37,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:39:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:39:37,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:39:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 229 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-12 16:39:37,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:39:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 229 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-12 16:39:38,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:39:38,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-12 16:39:38,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:39:38,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 16:39:38,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 16:39:38,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-12 16:39:38,785 INFO L87 Difference]: Start difference. First operand 18811 states and 22916 transitions. Second operand 12 states. [2018-11-12 16:39:39,080 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-11-12 16:39:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:39:47,920 INFO L93 Difference]: Finished difference Result 46426 states and 60275 transitions. [2018-11-12 16:39:47,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 16:39:47,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 474 [2018-11-12 16:39:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:39:48,038 INFO L225 Difference]: With dead ends: 46426 [2018-11-12 16:39:48,039 INFO L226 Difference]: Without dead ends: 30369 [2018-11-12 16:39:48,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 954 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-11-12 16:39:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30369 states. [2018-11-12 16:39:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30369 to 30349. [2018-11-12 16:39:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30349 states. [2018-11-12 16:39:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30349 states to 30349 states and 36925 transitions. [2018-11-12 16:39:48,671 INFO L78 Accepts]: Start accepts. Automaton has 30349 states and 36925 transitions. Word has length 474 [2018-11-12 16:39:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:39:48,671 INFO L480 AbstractCegarLoop]: Abstraction has 30349 states and 36925 transitions. [2018-11-12 16:39:48,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 16:39:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 30349 states and 36925 transitions. [2018-11-12 16:39:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-11-12 16:39:48,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:39:48,700 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:39:48,701 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:39:48,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:39:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1572610096, now seen corresponding path program 1 times [2018-11-12 16:39:48,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:39:48,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:39:48,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:39:48,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:39:48,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:39:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:39:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-12 16:39:49,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:39:49,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 16:39:49,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:39:49,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 16:39:49,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 16:39:49,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:39:49,103 INFO L87 Difference]: Start difference. First operand 30349 states and 36925 transitions. Second operand 3 states. [2018-11-12 16:39:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:39:51,950 INFO L93 Difference]: Finished difference Result 65694 states and 83167 transitions. [2018-11-12 16:39:51,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 16:39:51,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2018-11-12 16:39:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:39:52,084 INFO L225 Difference]: With dead ends: 65694 [2018-11-12 16:39:52,084 INFO L226 Difference]: Without dead ends: 38099 [2018-11-12 16:39:52,191 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 16:39:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38099 states. [2018-11-12 16:39:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38099 to 38099. [2018-11-12 16:39:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38099 states. [2018-11-12 16:39:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38099 states to 38099 states and 46985 transitions. [2018-11-12 16:39:52,879 INFO L78 Accepts]: Start accepts. Automaton has 38099 states and 46985 transitions. Word has length 510 [2018-11-12 16:39:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:39:52,880 INFO L480 AbstractCegarLoop]: Abstraction has 38099 states and 46985 transitions. [2018-11-12 16:39:52,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 16:39:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 38099 states and 46985 transitions. [2018-11-12 16:39:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-11-12 16:39:52,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:39:52,923 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:39:52,923 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:39:52,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:39:52,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1889968895, now seen corresponding path program 1 times [2018-11-12 16:39:52,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:39:52,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:39:52,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:39:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:39:52,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:39:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:39:53,371 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 16:39:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 184 proven. 117 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-12 16:39:53,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:39:53,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:39:53,776 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 570 with the following transitions: [2018-11-12 16:39:53,777 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [221], [223], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [974], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1379], [1383], [1394], [1398], [1402], [1406], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1452], [1456], [1460], [1471], [1475], [1486], [1490], [1494], [1498], [1502], [1506], [1510], [1514], [1518], [1522], [1526], [1530], [1534], [1538], [1542], [1546], [1550], [1554], [1558], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 16:39:53,781 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:39:53,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:39:53,928 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-11-12 16:39:56,285 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-11-12 16:39:56,286 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-11-12 16:39:56,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 16:39:56,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:39:56,287 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:39:56,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:39:56,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:39:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:39:56,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:39:56,527 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-12 16:39:56,728 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:39:56,728 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 16:39:56,732 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 16:39:56,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:39:56 BoogieIcfgContainer [2018-11-12 16:39:56,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 16:39:56,733 INFO L168 Benchmark]: Toolchain (without parser) took 211092.58 ms. Allocated memory was 1.5 GB in the beginning and 4.7 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 4.3 GB in the end (delta: -2.9 GB). Peak memory consumption was 290.9 MB. Max. memory is 7.1 GB. [2018-11-12 16:39:56,734 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 16:39:56,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1384.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-11-12 16:39:56,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 231.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -907.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2018-11-12 16:39:56,737 INFO L168 Benchmark]: Boogie Preprocessor took 161.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-12 16:39:56,737 INFO L168 Benchmark]: RCFGBuilder took 6354.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 291.6 MB). Peak memory consumption was 291.6 MB. Max. memory is 7.1 GB. [2018-11-12 16:39:56,738 INFO L168 Benchmark]: TraceAbstraction took 202954.88 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 1.9 GB in the beginning and 4.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-11-12 16:39:56,744 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 1384.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 231.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -907.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.97 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6354.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 291.6 MB). Peak memory consumption was 291.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 202954.88 ms. Allocated memory was 2.3 GB in the beginning and 4.7 GB in the end (delta: 2.4 GB). Free memory was 1.9 GB in the beginning and 4.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 79). Cancelled while BasicCegarLoop was analyzing trace of length 570 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 8 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 438 locations, 1 error locations. TIMEOUT Result, 202.8s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 172.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3786 SDtfs, 19064 SDslu, 3409 SDs, 0 SdLazy, 31857 SolverSat, 4774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1966 GetRequests, 1692 SyntacticMatches, 171 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38099occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.5s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9974550786892863 AbsIntWeakeningRatio, 0.09120521172638436 AbsIntAvgWeakeningVarsNumRemoved, 12.778501628664495 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1356 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 3145 NumberOfCodeBlocks, 3145 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3606 ConstructedInterpolants, 0 QuantifiedInterpolants, 3899731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 695 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 1849/2174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown