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_label46_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 19:14:46,061 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 19:14:46,063 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 19:14:46,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 19:14:46,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 19:14:46,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 19:14:46,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 19:14:46,088 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 19:14:46,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 19:14:46,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 19:14:46,094 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 19:14:46,094 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 19:14:46,095 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 19:14:46,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 19:14:46,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 19:14:46,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 19:14:46,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 19:14:46,114 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 19:14:46,119 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 19:14:46,124 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 19:14:46,125 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 19:14:46,126 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 19:14:46,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 19:14:46,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 19:14:46,130 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 19:14:46,130 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 19:14:46,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 19:14:46,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 19:14:46,134 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 19:14:46,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 19:14:46,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 19:14:46,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 19:14:46,138 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 19:14:46,138 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 19:14:46,140 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 19:14:46,140 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 19:14:46,141 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 19:14:46,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 19:14:46,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 19:14:46,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 19:14:46,173 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 19:14:46,173 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 19:14:46,173 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 19:14:46,173 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 19:14:46,173 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 19:14:46,174 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 19:14:46,174 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 19:14:46,174 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 19:14:46,174 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 19:14:46,174 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 19:14:46,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 19:14:46,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 19:14:46,176 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 19:14:46,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 19:14:46,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 19:14:46,176 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 19:14:46,176 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 19:14:46,177 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 19:14:46,177 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 19:14:46,177 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 19:14:46,177 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 19:14:46,177 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 19:14:46,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:14:46,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 19:14:46,178 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 19:14:46,178 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 19:14:46,178 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 19:14:46,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 19:14:46,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 19:14:46,179 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 19:14:46,179 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 19:14:46,179 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 19:14:46,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 19:14:46,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 19:14:46,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 19:14:46,253 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 19:14:46,253 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 19:14:46,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c [2018-11-12 19:14:46,327 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96ed99f8/809afae3617a4500a9380860603b30d5/FLAG90c9956ff [2018-11-12 19:14:47,046 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 19:14:47,047 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label46_true-unreach-call.c [2018-11-12 19:14:47,071 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96ed99f8/809afae3617a4500a9380860603b30d5/FLAG90c9956ff [2018-11-12 19:14:47,089 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b96ed99f8/809afae3617a4500a9380860603b30d5 [2018-11-12 19:14:47,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 19:14:47,102 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 19:14:47,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 19:14:47,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 19:14:47,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 19:14:47,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:14:47" (1/1) ... [2018-11-12 19:14:47,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2b0430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:47, skipping insertion in model container [2018-11-12 19:14:47,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:14:47" (1/1) ... [2018-11-12 19:14:47,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 19:14:47,210 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 19:14:48,119 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:14:48,124 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 19:14:48,481 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:14:48,505 INFO L193 MainTranslator]: Completed translation [2018-11-12 19:14:48,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48 WrapperNode [2018-11-12 19:14:48,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 19:14:48,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 19:14:48,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 19:14:48,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 19:14:48,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... [2018-11-12 19:14:48,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... [2018-11-12 19:14:48,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 19:14:48,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 19:14:48,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 19:14:48,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 19:14:48,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... [2018-11-12 19:14:48,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... [2018-11-12 19:14:48,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... [2018-11-12 19:14:48,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... [2018-11-12 19:14:48,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... [2018-11-12 19:14:48,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... [2018-11-12 19:14:48,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... [2018-11-12 19:14:48,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 19:14:48,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 19:14:48,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 19:14:48,914 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 19:14:48,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:14:48,985 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 19:14:48,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 19:14:48,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 19:14:48,986 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-12 19:14:48,986 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-12 19:14:48,987 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 19:14:48,987 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 19:14:48,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 19:14:48,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 19:14:48,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 19:14:48,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 19:14:56,169 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 19:14:56,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:14:56 BoogieIcfgContainer [2018-11-12 19:14:56,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 19:14:56,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 19:14:56,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 19:14:56,176 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 19:14:56,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:14:47" (1/3) ... [2018-11-12 19:14:56,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519419b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:14:56, skipping insertion in model container [2018-11-12 19:14:56,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:48" (2/3) ... [2018-11-12 19:14:56,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519419b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:14:56, skipping insertion in model container [2018-11-12 19:14:56,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:14:56" (3/3) ... [2018-11-12 19:14:56,180 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label46_true-unreach-call.c [2018-11-12 19:14:56,191 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 19:14:56,201 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 19:14:56,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 19:14:56,271 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 19:14:56,271 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 19:14:56,271 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 19:14:56,271 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 19:14:56,272 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 19:14:56,272 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 19:14:56,272 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 19:14:56,272 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 19:14:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states. [2018-11-12 19:14:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-12 19:14:56,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:14:56,340 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] [2018-11-12 19:14:56,342 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:14:56,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:14:56,351 INFO L82 PathProgramCache]: Analyzing trace with hash -171109996, now seen corresponding path program 1 times [2018-11-12 19:14:56,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:14:56,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:14:56,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:14:56,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:14:56,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:14:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:14:56,847 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:14:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:14:56,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:14:56,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:14:56,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:14:56,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:14:56,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:14:56,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:14:56,965 INFO L87 Difference]: Start difference. First operand 438 states. Second operand 3 states. [2018-11-12 19:15:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:15:00,444 INFO L93 Difference]: Finished difference Result 1198 states and 2158 transitions. [2018-11-12 19:15:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:15:00,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-12 19:15:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:15:00,472 INFO L225 Difference]: With dead ends: 1198 [2018-11-12 19:15:00,472 INFO L226 Difference]: Without dead ends: 758 [2018-11-12 19:15:00,484 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:15:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-11-12 19:15:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2018-11-12 19:15:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-11-12 19:15:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1328 transitions. [2018-11-12 19:15:00,609 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1328 transitions. Word has length 50 [2018-11-12 19:15:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:15:00,610 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 1328 transitions. [2018-11-12 19:15:00,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:15:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1328 transitions. [2018-11-12 19:15:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-12 19:15:00,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:15:00,619 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:15:00,619 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:15:00,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:15:00,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1340083984, now seen corresponding path program 1 times [2018-11-12 19:15:00,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:15:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:15:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:00,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:15:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:15:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:15:00,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:15:00,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 19:15:00,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:15:00,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 19:15:00,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 19:15:00,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 19:15:00,985 INFO L87 Difference]: Start difference. First operand 754 states and 1328 transitions. Second operand 5 states. [2018-11-12 19:15:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:15:07,018 INFO L93 Difference]: Finished difference Result 2231 states and 3964 transitions. [2018-11-12 19:15:07,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:15:07,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-11-12 19:15:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:15:07,036 INFO L225 Difference]: With dead ends: 2231 [2018-11-12 19:15:07,036 INFO L226 Difference]: Without dead ends: 1483 [2018-11-12 19:15:07,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:15:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2018-11-12 19:15:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1449. [2018-11-12 19:15:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2018-11-12 19:15:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2254 transitions. [2018-11-12 19:15:07,136 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2254 transitions. Word has length 124 [2018-11-12 19:15:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:15:07,136 INFO L480 AbstractCegarLoop]: Abstraction has 1449 states and 2254 transitions. [2018-11-12 19:15:07,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 19:15:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2254 transitions. [2018-11-12 19:15:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-12 19:15:07,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:15:07,146 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:15:07,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:15:07,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:15:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1528606616, now seen corresponding path program 1 times [2018-11-12 19:15:07,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:15:07,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:07,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:15:07,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:07,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:15:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:15:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:15:07,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:15:07,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:15:07,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:15:07,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:15:07,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:15:07,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:15:07,442 INFO L87 Difference]: Start difference. First operand 1449 states and 2254 transitions. Second operand 6 states. [2018-11-12 19:15:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:15:13,066 INFO L93 Difference]: Finished difference Result 4188 states and 6605 transitions. [2018-11-12 19:15:13,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:15:13,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-11-12 19:15:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:15:13,082 INFO L225 Difference]: With dead ends: 4188 [2018-11-12 19:15:13,082 INFO L226 Difference]: Without dead ends: 2745 [2018-11-12 19:15:13,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:15:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2018-11-12 19:15:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2711. [2018-11-12 19:15:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2711 states. [2018-11-12 19:15:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3819 transitions. [2018-11-12 19:15:13,178 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3819 transitions. Word has length 136 [2018-11-12 19:15:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:15:13,179 INFO L480 AbstractCegarLoop]: Abstraction has 2711 states and 3819 transitions. [2018-11-12 19:15:13,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:15:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3819 transitions. [2018-11-12 19:15:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-12 19:15:13,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:15:13,182 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:15:13,183 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:15:13,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:15:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash -929559410, now seen corresponding path program 1 times [2018-11-12 19:15:13,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:15:13,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:13,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:15:13,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:13,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:15:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:15:13,450 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:15:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:15:13,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:15:13,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:15:13,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:15:13,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:15:13,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:15:13,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:15:13,506 INFO L87 Difference]: Start difference. First operand 2711 states and 3819 transitions. Second operand 6 states. [2018-11-12 19:15:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:15:17,969 INFO L93 Difference]: Finished difference Result 6679 states and 9540 transitions. [2018-11-12 19:15:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:15:17,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-11-12 19:15:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:15:18,004 INFO L225 Difference]: With dead ends: 6679 [2018-11-12 19:15:18,004 INFO L226 Difference]: Without dead ends: 3974 [2018-11-12 19:15:18,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:15:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2018-11-12 19:15:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3953. [2018-11-12 19:15:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3953 states. [2018-11-12 19:15:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5247 transitions. [2018-11-12 19:15:18,128 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5247 transitions. Word has length 137 [2018-11-12 19:15:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:15:18,129 INFO L480 AbstractCegarLoop]: Abstraction has 3953 states and 5247 transitions. [2018-11-12 19:15:18,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:15:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5247 transitions. [2018-11-12 19:15:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-12 19:15:18,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:15:18,133 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:15:18,133 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:15:18,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:15:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash -470998967, now seen corresponding path program 1 times [2018-11-12 19:15:18,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:15:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:15:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:18,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:15:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:15:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:15:18,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:15:18,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 19:15:18,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:15:18,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:15:18,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:15:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:15:18,669 INFO L87 Difference]: Start difference. First operand 3953 states and 5247 transitions. Second operand 6 states. [2018-11-12 19:15:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:15:25,883 INFO L93 Difference]: Finished difference Result 14030 states and 18946 transitions. [2018-11-12 19:15:25,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:15:25,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2018-11-12 19:15:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:15:25,941 INFO L225 Difference]: With dead ends: 14030 [2018-11-12 19:15:25,941 INFO L226 Difference]: Without dead ends: 10083 [2018-11-12 19:15:25,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:15:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10083 states. [2018-11-12 19:15:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10083 to 9881. [2018-11-12 19:15:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9881 states. [2018-11-12 19:15:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9881 states to 9881 states and 12497 transitions. [2018-11-12 19:15:26,221 INFO L78 Accepts]: Start accepts. Automaton has 9881 states and 12497 transitions. Word has length 177 [2018-11-12 19:15:26,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:15:26,222 INFO L480 AbstractCegarLoop]: Abstraction has 9881 states and 12497 transitions. [2018-11-12 19:15:26,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:15:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 9881 states and 12497 transitions. [2018-11-12 19:15:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-12 19:15:26,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:15:26,232 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:15:26,232 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:15:26,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:15:26,232 INFO L82 PathProgramCache]: Analyzing trace with hash 933056982, now seen corresponding path program 1 times [2018-11-12 19:15:26,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:15:26,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:26,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:15:26,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:26,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:15:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:15:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-12 19:15:26,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:15:26,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 19:15:26,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:15:26,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:15:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:15:26,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 19:15:26,579 INFO L87 Difference]: Start difference. First operand 9881 states and 12497 transitions. Second operand 4 states. [2018-11-12 19:15:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:15:32,201 INFO L93 Difference]: Finished difference Result 27823 states and 37308 transitions. [2018-11-12 19:15:32,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:15:32,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-11-12 19:15:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:15:32,288 INFO L225 Difference]: With dead ends: 27823 [2018-11-12 19:15:32,288 INFO L226 Difference]: Without dead ends: 17948 [2018-11-12 19:15:32,349 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 19:15:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17948 states. [2018-11-12 19:15:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17948 to 17323. [2018-11-12 19:15:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2018-11-12 19:15:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 21277 transitions. [2018-11-12 19:15:32,796 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 21277 transitions. Word has length 205 [2018-11-12 19:15:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:15:32,797 INFO L480 AbstractCegarLoop]: Abstraction has 17323 states and 21277 transitions. [2018-11-12 19:15:32,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:15:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 21277 transitions. [2018-11-12 19:15:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-12 19:15:32,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:15:32,810 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:15:32,811 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:15:32,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:15:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash -75498616, now seen corresponding path program 1 times [2018-11-12 19:15:32,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:15:32,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:32,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:15:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:32,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:15:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:15:33,060 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-11-12 19:15:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-12 19:15:33,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:15:33,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:15:33,084 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:15:33,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:15:33,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:15:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:15:33,085 INFO L87 Difference]: Start difference. First operand 17323 states and 21277 transitions. Second operand 3 states. [2018-11-12 19:15:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:15:36,593 INFO L93 Difference]: Finished difference Result 40319 states and 50745 transitions. [2018-11-12 19:15:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:15:36,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-11-12 19:15:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:15:36,692 INFO L225 Difference]: With dead ends: 40319 [2018-11-12 19:15:36,692 INFO L226 Difference]: Without dead ends: 23002 [2018-11-12 19:15:36,746 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 19:15:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23002 states. [2018-11-12 19:15:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23002 to 22945. [2018-11-12 19:15:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22945 states. [2018-11-12 19:15:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22945 states to 22945 states and 28701 transitions. [2018-11-12 19:15:37,275 INFO L78 Accepts]: Start accepts. Automaton has 22945 states and 28701 transitions. Word has length 218 [2018-11-12 19:15:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:15:37,276 INFO L480 AbstractCegarLoop]: Abstraction has 22945 states and 28701 transitions. [2018-11-12 19:15:37,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:15:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 22945 states and 28701 transitions. [2018-11-12 19:15:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-12 19:15:37,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:15:37,292 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:15:37,292 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:15:37,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:15:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash 976466900, now seen corresponding path program 1 times [2018-11-12 19:15:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:15:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:37,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:15:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:15:37,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:15:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:15:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-12 19:15:38,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:15:38,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:15:38,004 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-11-12 19:15:38,008 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [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 19:15:38,074 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:15:38,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:15:38,656 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:15:38,658 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 19:15:38,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:15:38,701 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:15:39,661 INFO L227 lantSequenceWeakener]: Weakened 222 states. On average, predicates are now at 77.91% of their original sizes. [2018-11-12 19:15:39,662 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:15:40,155 INFO L415 sIntCurrentIteration]: We unified 230 AI predicates to 230 [2018-11-12 19:15:40,155 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:15:40,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:15:40,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-11-12 19:15:40,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:15:40,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 19:15:40,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 19:15:40,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-12 19:15:40,162 INFO L87 Difference]: Start difference. First operand 22945 states and 28701 transitions. Second operand 8 states. [2018-11-12 19:15:44,124 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:16:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:16:21,554 INFO L93 Difference]: Finished difference Result 46194 states and 57754 transitions. [2018-11-12 19:16:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:16:21,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 231 [2018-11-12 19:16:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:16:21,632 INFO L225 Difference]: With dead ends: 46194 [2018-11-12 19:16:21,633 INFO L226 Difference]: Without dead ends: 23255 [2018-11-12 19:16:21,690 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 232 GetRequests, 224 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 19:16:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23255 states. [2018-11-12 19:16:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23255 to 23253. [2018-11-12 19:16:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23253 states. [2018-11-12 19:16:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23253 states to 23253 states and 29018 transitions. [2018-11-12 19:16:22,187 INFO L78 Accepts]: Start accepts. Automaton has 23253 states and 29018 transitions. Word has length 231 [2018-11-12 19:16:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:16:22,188 INFO L480 AbstractCegarLoop]: Abstraction has 23253 states and 29018 transitions. [2018-11-12 19:16:22,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 19:16:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 23253 states and 29018 transitions. [2018-11-12 19:16:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-12 19:16:22,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:16:22,209 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 19:16:22,209 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:16:22,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:16:22,210 INFO L82 PathProgramCache]: Analyzing trace with hash 198522603, now seen corresponding path program 1 times [2018-11-12 19:16:22,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:16:22,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:16:22,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:16:22,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:16:22,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:16:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:16:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 213 proven. 169 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:16:23,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:16:23,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:16:23,234 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 328 with the following transitions: [2018-11-12 19:16:23,235 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [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 19:16:23,240 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:16:23,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:16:23,317 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:16:24,376 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:16:24,376 INFO L272 AbstractInterpreter]: Visited 109 different actions 727 times. Merged at 5 different actions 30 times. Widened at 1 different actions 2 times. Performed 10995 root evaluator evaluations with a maximum evaluation depth of 6. Performed 10995 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:16:24,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:16:24,417 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:16:25,662 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 77.76% of their original sizes. [2018-11-12 19:16:25,663 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:16:31,773 INFO L415 sIntCurrentIteration]: We unified 326 AI predicates to 326 [2018-11-12 19:16:31,773 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:16:31,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:16:31,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [11] total 25 [2018-11-12 19:16:31,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:16:31,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 19:16:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 19:16:31,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-12 19:16:31,775 INFO L87 Difference]: Start difference. First operand 23253 states and 29018 transitions. Second operand 16 states. [2018-11-12 19:17:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:17:00,639 INFO L93 Difference]: Finished difference Result 48517 states and 60390 transitions. [2018-11-12 19:17:00,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 19:17:00,639 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 327 [2018-11-12 19:17:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:17:00,748 INFO L225 Difference]: With dead ends: 48517 [2018-11-12 19:17:00,748 INFO L226 Difference]: Without dead ends: 25578 [2018-11-12 19:17:00,826 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 333 GetRequests, 132 SyntacticMatches, 180 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-11-12 19:17:00,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25578 states. [2018-11-12 19:17:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25578 to 25298. [2018-11-12 19:17:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25298 states. [2018-11-12 19:17:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25298 states to 25298 states and 31152 transitions. [2018-11-12 19:17:01,478 INFO L78 Accepts]: Start accepts. Automaton has 25298 states and 31152 transitions. Word has length 327 [2018-11-12 19:17:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:17:01,479 INFO L480 AbstractCegarLoop]: Abstraction has 25298 states and 31152 transitions. [2018-11-12 19:17:01,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 19:17:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 25298 states and 31152 transitions. [2018-11-12 19:17:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-11-12 19:17:01,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:17:01,510 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:17:01,510 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:17:01,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:17:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1071336678, now seen corresponding path program 1 times [2018-11-12 19:17:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:17:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:17:01,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:17:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:17:01,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:17:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:17:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 140 proven. 169 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-12 19:17:02,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:17:02,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:17:02,891 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 507 with the following transitions: [2018-11-12 19:17:02,892 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [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], [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], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 19:17:02,901 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:17:02,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:17:03,076 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:17:09,160 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 19:17:09,161 INFO L272 AbstractInterpreter]: Visited 284 different actions 562 times. Merged at 5 different actions 5 times. Never widened. Performed 8034 root evaluator evaluations with a maximum evaluation depth of 6. Performed 8034 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:17:09,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:17:09,167 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 19:17:10,072 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 79.5% of their original sizes. [2018-11-12 19:17:10,072 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 19:17:10,670 INFO L415 sIntCurrentIteration]: We unified 505 AI predicates to 505 [2018-11-12 19:17:10,670 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 19:17:10,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:17:10,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [8] total 27 [2018-11-12 19:17:10,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:17:10,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 19:17:10,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 19:17:10,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-12 19:17:10,673 INFO L87 Difference]: Start difference. First operand 25298 states and 31152 transitions. Second operand 21 states. [2018-11-12 19:17:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:17:44,826 INFO L93 Difference]: Finished difference Result 49701 states and 61560 transitions. [2018-11-12 19:17:44,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 19:17:44,826 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 506 [2018-11-12 19:17:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:17:44,903 INFO L225 Difference]: With dead ends: 49701 [2018-11-12 19:17:44,903 INFO L226 Difference]: Without dead ends: 26762 [2018-11-12 19:17:44,945 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 523 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 19:17:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26762 states. [2018-11-12 19:17:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26762 to 26522. [2018-11-12 19:17:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26522 states. [2018-11-12 19:17:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26522 states to 26522 states and 32489 transitions. [2018-11-12 19:17:45,391 INFO L78 Accepts]: Start accepts. Automaton has 26522 states and 32489 transitions. Word has length 506 [2018-11-12 19:17:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:17:45,392 INFO L480 AbstractCegarLoop]: Abstraction has 26522 states and 32489 transitions. [2018-11-12 19:17:45,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 19:17:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 26522 states and 32489 transitions. [2018-11-12 19:17:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-11-12 19:17:45,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:17:45,435 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:17:45,435 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:17:45,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:17:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1712952443, now seen corresponding path program 1 times [2018-11-12 19:17:45,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:17:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:17:45,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:17:45,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:17:45,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:17:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:17:46,760 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-12 19:17:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 241 proven. 117 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-12 19:17:47,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:17:47,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:17:47,588 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 573 with the following transitions: [2018-11-12 19:17:47,589 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [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], [888], [891], [895], [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], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 19:17:47,594 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:17:47,594 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:17:47,738 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:17:48,554 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:17:48,554 INFO L272 AbstractInterpreter]: Visited 285 different actions 1125 times. Merged at 7 different actions 20 times. Never widened. Performed 17933 root evaluator evaluations with a maximum evaluation depth of 6. Performed 17933 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-12 19:17:48,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:17:48,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:17:48,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:17:48,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:17:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:17:48,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:17:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:17:48,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:17:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 375 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-12 19:17:49,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:17:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 375 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-12 19:17:50,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:17:50,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 19:17:50,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:17:50,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 19:17:50,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 19:17:50,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-12 19:17:50,812 INFO L87 Difference]: Start difference. First operand 26522 states and 32489 transitions. Second operand 11 states. [2018-11-12 19:18:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:18:00,638 INFO L93 Difference]: Finished difference Result 53355 states and 67692 transitions. [2018-11-12 19:18:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 19:18:00,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 572 [2018-11-12 19:18:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:18:00,720 INFO L225 Difference]: With dead ends: 53355 [2018-11-12 19:18:00,720 INFO L226 Difference]: Without dead ends: 29192 [2018-11-12 19:18:00,788 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1184 GetRequests, 1153 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2018-11-12 19:18:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29192 states. [2018-11-12 19:18:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29192 to 27746. [2018-11-12 19:18:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27746 states. [2018-11-12 19:18:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27746 states to 27746 states and 31399 transitions. [2018-11-12 19:18:01,250 INFO L78 Accepts]: Start accepts. Automaton has 27746 states and 31399 transitions. Word has length 572 [2018-11-12 19:18:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:18:01,251 INFO L480 AbstractCegarLoop]: Abstraction has 27746 states and 31399 transitions. [2018-11-12 19:18:01,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 19:18:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 27746 states and 31399 transitions. [2018-11-12 19:18:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-11-12 19:18:01,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:18:01,294 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-12 19:18:01,294 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:18:01,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:18:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2139288709, now seen corresponding path program 1 times [2018-11-12 19:18:01,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:18:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:18:01,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:18:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:18:01,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:18:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:18:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 189 proven. 234 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-11-12 19:18:02,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:18:02,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:18:02,883 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 577 with the following transitions: [2018-11-12 19:18:02,884 INFO L202 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [373], [375], [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], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [714], [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], [1561], [1635], [1639], [1643], [1649], [1653], [1655], [1662], [1663], [1664], [1666], [1667] [2018-11-12 19:18:02,889 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:18:02,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:18:03,058 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:18:03,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:18:03,598 INFO L272 AbstractInterpreter]: Visited 286 different actions 855 times. Merged at 7 different actions 21 times. Never widened. Performed 12928 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12928 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 19:18:03,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:18:03,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:18:03,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:18:03,604 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 19:18:03,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:18:03,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:18:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:18:03,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:18:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 531 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-12 19:18:04,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:18:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 334 proven. 80 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-11-12 19:18:04,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:18:04,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-12 19:18:04,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:18:04,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 19:18:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 19:18:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-12 19:18:04,981 INFO L87 Difference]: Start difference. First operand 27746 states and 31399 transitions. Second operand 11 states. Received shutdown request... [2018-11-12 19:18:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 19:18:08,638 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 19:18:08,643 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 19:18:08,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:18:08 BoogieIcfgContainer [2018-11-12 19:18:08,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 19:18:08,645 INFO L168 Benchmark]: Toolchain (without parser) took 201543.29 ms. Allocated memory was 1.5 GB in the beginning and 5.0 GB in the end (delta: 3.5 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-12 19:18:08,646 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:18:08,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1403.76 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 19:18:08,647 INFO L168 Benchmark]: Boogie Procedure Inliner took 236.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -870.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2018-11-12 19:18:08,648 INFO L168 Benchmark]: Boogie Preprocessor took 168.71 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-11-12 19:18:08,649 INFO L168 Benchmark]: RCFGBuilder took 7257.69 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: 292.5 MB). Peak memory consumption was 292.5 MB. Max. memory is 7.1 GB. [2018-11-12 19:18:08,649 INFO L168 Benchmark]: TraceAbstraction took 192471.73 ms. Allocated memory was 2.3 GB in the beginning and 5.0 GB in the end (delta: 2.8 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-12 19:18:08,654 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 1403.76 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 236.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -870.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 168.71 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7257.69 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: 292.5 MB). Peak memory consumption was 292.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192471.73 ms. Allocated memory was 2.3 GB in the beginning and 5.0 GB in the end (delta: 2.8 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 136]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 136). Cancelled while BasicCegarLoop was constructing difference of abstraction (27746states) and FLOYD_HOARE automaton (currently 21 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (5353 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 438 locations, 1 error locations. TIMEOUT Result, 192.3s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 154.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3318 SDtfs, 25225 SDslu, 3796 SDs, 0 SdLazy, 36391 SolverSat, 4999 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 77.6s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 3517 GetRequests, 3175 SyntacticMatches, 192 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27746occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.8s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9975304157096953 AbsIntWeakeningRatio, 0.08482563619227144 AbsIntAvgWeakeningVarsNumRemoved, 13.003770028275213 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 2945 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 4407 NumberOfCodeBlocks, 4407 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 5539 ConstructedInterpolants, 0 QuantifiedInterpolants, 8030634 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1625 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 4057/4834 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown