java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:39:45,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:39:45,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:39:45,924 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:39:45,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:39:45,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:39:45,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:39:45,929 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:39:45,931 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:39:45,931 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:39:45,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:39:45,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:39:45,937 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:39:45,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:39:45,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:39:45,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:39:45,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:39:45,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:39:45,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:39:45,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:39:45,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:39:45,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:39:45,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:39:45,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:39:45,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:39:45,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:39:45,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:39:45,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:39:45,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:39:45,973 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:39:45,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:39:45,974 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:39:45,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:39:45,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:39:45,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:39:45,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:39:45,976 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-27 00:39:46,008 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:39:46,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:39:46,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:39:46,010 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:39:46,010 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:39:46,010 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:39:46,010 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:39:46,011 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:39:46,011 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 00:39:46,012 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:39:46,012 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:39:46,012 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:39:46,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:39:46,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:39:46,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:39:46,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:39:46,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:39:46,014 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:39:46,016 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:39:46,016 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:39:46,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:39:46,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:39:46,017 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:39:46,017 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:39:46,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:39:46,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:39:46,017 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:39:46,018 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:39:46,018 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:39:46,018 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:39:46,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:39:46,018 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:39:46,019 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 00:39:46,019 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 00:39:46,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:39:46,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:39:46,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:39:46,105 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:39:46,105 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:39:46,106 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-10-27 00:39:46,167 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0bcbbecba/760f6ed2d951485ba0eafe0d03f0f074/FLAG3c0835944 [2018-10-27 00:39:46,797 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:39:46,798 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2018-10-27 00:39:46,815 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0bcbbecba/760f6ed2d951485ba0eafe0d03f0f074/FLAG3c0835944 [2018-10-27 00:39:46,831 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0bcbbecba/760f6ed2d951485ba0eafe0d03f0f074 [2018-10-27 00:39:46,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:39:46,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:39:46,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:39:46,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:39:46,859 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:39:46,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:39:46" (1/1) ... [2018-10-27 00:39:46,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4aab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:46, skipping insertion in model container [2018-10-27 00:39:46,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:39:46" (1/1) ... [2018-10-27 00:39:46,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:39:46,931 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:39:47,340 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:39:47,351 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:39:47,494 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:39:47,514 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:39:47,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47 WrapperNode [2018-10-27 00:39:47,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:39:47,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:39:47,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:39:47,517 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:39:47,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... [2018-10-27 00:39:47,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... [2018-10-27 00:39:47,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:39:47,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:39:47,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:39:47,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:39:47,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... [2018-10-27 00:39:47,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... [2018-10-27 00:39:47,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... [2018-10-27 00:39:47,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... [2018-10-27 00:39:47,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... [2018-10-27 00:39:47,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... [2018-10-27 00:39:47,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... [2018-10-27 00:39:47,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:39:47,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:39:47,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:39:47,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:39:47,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:39:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:39:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:39:47,890 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 00:39:47,890 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 00:39:47,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:39:47,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:39:47,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:39:47,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:39:51,377 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:39:51,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:39:51 BoogieIcfgContainer [2018-10-27 00:39:51,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:39:51,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:39:51,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:39:51,390 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:39:51,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:39:46" (1/3) ... [2018-10-27 00:39:51,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23504f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:39:51, skipping insertion in model container [2018-10-27 00:39:51,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:39:47" (2/3) ... [2018-10-27 00:39:51,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23504f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:39:51, skipping insertion in model container [2018-10-27 00:39:51,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:39:51" (3/3) ... [2018-10-27 00:39:51,394 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label30_true-unreach-call_false-termination.c [2018-10-27 00:39:51,406 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:39:51,422 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:39:51,445 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:39:51,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:39:51,489 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:39:51,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:39:51,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:39:51,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:39:51,490 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:39:51,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:39:51,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:39:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 00:39:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-27 00:39:51,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:39:51,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:39:51,569 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:39:51,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:39:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2071841880, now seen corresponding path program 1 times [2018-10-27 00:39:51,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:39:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:39:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:51,646 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:39:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:52,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:39:52,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 00:39:52,481 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:39:52,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:39:52,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:39:52,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:39:52,510 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 4 states. [2018-10-27 00:39:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:39:55,052 INFO L93 Difference]: Finished difference Result 702 states and 1227 transitions. [2018-10-27 00:39:55,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:39:55,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2018-10-27 00:39:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:39:55,079 INFO L225 Difference]: With dead ends: 702 [2018-10-27 00:39:55,079 INFO L226 Difference]: Without dead ends: 488 [2018-10-27 00:39:55,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:39:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-27 00:39:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 340. [2018-10-27 00:39:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 00:39:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 571 transitions. [2018-10-27 00:39:55,164 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 571 transitions. Word has length 132 [2018-10-27 00:39:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:39:55,165 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 571 transitions. [2018-10-27 00:39:55,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:39:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 571 transitions. [2018-10-27 00:39:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-27 00:39:55,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:39:55,174 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 00:39:55,174 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:39:55,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:39:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1746853559, now seen corresponding path program 1 times [2018-10-27 00:39:55,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:39:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:55,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:39:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:55,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:39:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:55,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:39:55,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:39:55,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:39:55,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:39:55,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:39:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:39:55,424 INFO L87 Difference]: Start difference. First operand 340 states and 571 transitions. Second operand 6 states. [2018-10-27 00:39:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:39:56,931 INFO L93 Difference]: Finished difference Result 882 states and 1513 transitions. [2018-10-27 00:39:56,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:39:56,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-10-27 00:39:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:39:56,938 INFO L225 Difference]: With dead ends: 882 [2018-10-27 00:39:56,939 INFO L226 Difference]: Without dead ends: 548 [2018-10-27 00:39:56,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:39:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-10-27 00:39:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 531. [2018-10-27 00:39:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-10-27 00:39:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 836 transitions. [2018-10-27 00:39:56,999 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 836 transitions. Word has length 143 [2018-10-27 00:39:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:39:57,000 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 836 transitions. [2018-10-27 00:39:57,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:39:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 836 transitions. [2018-10-27 00:39:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 00:39:57,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:39:57,006 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 00:39:57,006 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:39:57,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:39:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1493139701, now seen corresponding path program 1 times [2018-10-27 00:39:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:39:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:57,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:39:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:57,008 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:39:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:57,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:39:57,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:39:57,409 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:39:57,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:39:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:39:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:39:57,410 INFO L87 Difference]: Start difference. First operand 531 states and 836 transitions. Second operand 5 states. [2018-10-27 00:39:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:39:59,289 INFO L93 Difference]: Finished difference Result 1192 states and 1911 transitions. [2018-10-27 00:39:59,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:39:59,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2018-10-27 00:39:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:39:59,300 INFO L225 Difference]: With dead ends: 1192 [2018-10-27 00:39:59,300 INFO L226 Difference]: Without dead ends: 528 [2018-10-27 00:39:59,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:39:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-27 00:39:59,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2018-10-27 00:39:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-27 00:39:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 782 transitions. [2018-10-27 00:39:59,335 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 782 transitions. Word has length 144 [2018-10-27 00:39:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:39:59,336 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 782 transitions. [2018-10-27 00:39:59,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:39:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 782 transitions. [2018-10-27 00:39:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-27 00:39:59,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:39:59,343 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 00:39:59,343 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:39:59,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:39:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1935386109, now seen corresponding path program 1 times [2018-10-27 00:39:59,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:39:59,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:59,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:39:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:39:59,348 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:39:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:39:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:39:59,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:39:59,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:39:59,591 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:39:59,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:39:59,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:39:59,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:39:59,592 INFO L87 Difference]: Start difference. First operand 528 states and 782 transitions. Second operand 3 states. [2018-10-27 00:40:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:40:01,057 INFO L93 Difference]: Finished difference Result 1493 states and 2284 transitions. [2018-10-27 00:40:01,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:40:01,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-27 00:40:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:40:01,071 INFO L225 Difference]: With dead ends: 1493 [2018-10-27 00:40:01,071 INFO L226 Difference]: Without dead ends: 971 [2018-10-27 00:40:01,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:40:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-10-27 00:40:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2018-10-27 00:40:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2018-10-27 00:40:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1393 transitions. [2018-10-27 00:40:01,129 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1393 transitions. Word has length 148 [2018-10-27 00:40:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:40:01,131 INFO L481 AbstractCegarLoop]: Abstraction has 971 states and 1393 transitions. [2018-10-27 00:40:01,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:40:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1393 transitions. [2018-10-27 00:40:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-27 00:40:01,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:40:01,136 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:40:01,137 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:40:01,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:40:01,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1185891811, now seen corresponding path program 1 times [2018-10-27 00:40:01,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:40:01,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:40:01,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:40:01,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:40:01,139 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:40:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:01,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:40:01,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 00:40:01,322 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:40:01,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:40:01,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:40:01,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:40:01,323 INFO L87 Difference]: Start difference. First operand 971 states and 1393 transitions. Second operand 6 states. [2018-10-27 00:40:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:40:03,068 INFO L93 Difference]: Finished difference Result 2867 states and 4269 transitions. [2018-10-27 00:40:03,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 00:40:03,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-27 00:40:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:40:03,080 INFO L225 Difference]: With dead ends: 2867 [2018-10-27 00:40:03,081 INFO L226 Difference]: Without dead ends: 1902 [2018-10-27 00:40:03,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:40:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2018-10-27 00:40:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1873. [2018-10-27 00:40:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2018-10-27 00:40:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2527 transitions. [2018-10-27 00:40:03,152 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2527 transitions. Word has length 164 [2018-10-27 00:40:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:40:03,153 INFO L481 AbstractCegarLoop]: Abstraction has 1873 states and 2527 transitions. [2018-10-27 00:40:03,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:40:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2527 transitions. [2018-10-27 00:40:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-27 00:40:03,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:40:03,162 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 00:40:03,162 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:40:03,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:40:03,163 INFO L82 PathProgramCache]: Analyzing trace with hash -151226562, now seen corresponding path program 1 times [2018-10-27 00:40:03,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:40:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:40:03,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:40:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:40:03,165 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:40:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:40:03,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:40:03,375 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:40:03,376 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-10-27 00:40:03,378 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 00:40:03,451 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:40:03,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:40:12,372 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:40:12,374 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 00:40:12,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:40:12,412 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:40:15,114 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 79.83% of their original sizes. [2018-10-27 00:40:15,115 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:40:16,471 INFO L415 sIntCurrentIteration]: We unified 176 AI predicates to 176 [2018-10-27 00:40:16,471 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:40:16,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:40:16,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-10-27 00:40:16,472 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:40:16,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 00:40:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 00:40:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-27 00:40:16,474 INFO L87 Difference]: Start difference. First operand 1873 states and 2527 transitions. Second operand 12 states. [2018-10-27 00:40:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:40:31,890 INFO L93 Difference]: Finished difference Result 3801 states and 5131 transitions. [2018-10-27 00:40:31,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 00:40:31,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 177 [2018-10-27 00:40:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:40:31,901 INFO L225 Difference]: With dead ends: 3801 [2018-10-27 00:40:31,902 INFO L226 Difference]: Without dead ends: 1934 [2018-10-27 00:40:31,909 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-10-27 00:40:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2018-10-27 00:40:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1934. [2018-10-27 00:40:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2018-10-27 00:40:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 2593 transitions. [2018-10-27 00:40:31,963 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 2593 transitions. Word has length 177 [2018-10-27 00:40:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:40:31,963 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 2593 transitions. [2018-10-27 00:40:31,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 00:40:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2593 transitions. [2018-10-27 00:40:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-27 00:40:31,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:40:31,972 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:40:31,972 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:40:31,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:40:31,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1836874565, now seen corresponding path program 1 times [2018-10-27 00:40:31,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:40:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:40:31,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:40:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:40:31,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:40:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:40:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:40:32,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:40:32,190 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 00:40:32,190 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-10-27 00:40:32,191 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [21], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [693], [695], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 00:40:32,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:40:32,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:40:55,227 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 00:40:55,227 INFO L272 AbstractInterpreter]: Visited 137 different actions 204 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 00:40:55,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:40:55,237 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 00:40:59,992 INFO L227 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 80.98% of their original sizes. [2018-10-27 00:40:59,993 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 00:42:55,932 INFO L415 sIntCurrentIteration]: We unified 185 AI predicates to 185 [2018-10-27 00:42:55,933 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 00:42:55,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:42:55,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-10-27 00:42:55,933 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:42:55,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 00:42:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 00:42:55,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-10-27 00:42:55,934 INFO L87 Difference]: Start difference. First operand 1934 states and 2593 transitions. Second operand 19 states. Received shutdown request... [2018-10-27 00:44:05,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 00:44:05,780 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 00:44:05,787 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 00:44:05,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:44:05 BoogieIcfgContainer [2018-10-27 00:44:05,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:44:05,788 INFO L168 Benchmark]: Toolchain (without parser) took 258943.26 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -437.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-27 00:44:05,789 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 00:44:05,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 00:44:05,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 192.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -772.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-27 00:44:05,792 INFO L168 Benchmark]: Boogie Preprocessor took 98.50 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-27 00:44:05,793 INFO L168 Benchmark]: RCFGBuilder took 3573.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. [2018-10-27 00:44:05,794 INFO L168 Benchmark]: TraceAbstraction took 254402.22 ms. Allocated memory was 2.2 GB in the beginning and 3.1 GB in the end (delta: 880.8 MB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 182.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-27 00:44:05,800 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 667.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 192.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 707.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -772.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.50 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3573.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 106.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254402.22 ms. Allocated memory was 2.2 GB in the beginning and 3.1 GB in the end (delta: 880.8 MB). Free memory was 2.0 GB in the beginning and 1.8 GB in the end (delta: 182.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (1934states) and FLOYD_HOARE automaton (currently 19 states, 19 states before enhancement),while ReachableStatesComputation was computing reachable states (40 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 254.3s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 94.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 698 SDtfs, 2594 SDslu, 688 SDs, 0 SdLazy, 3860 SolverSat, 858 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.9s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 415 GetRequests, 299 SyntacticMatches, 53 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 136.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1934occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 32.0s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9949633390279301 AbsIntWeakeningRatio, 0.21052631578947367 AbsIntAvgWeakeningVarsNumRemoved, 1937.6731301939058 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 194 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1094 NumberOfCodeBlocks, 1094 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1087 ConstructedInterpolants, 0 QuantifiedInterpolants, 731536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 173/187 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown