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/Problem13_label29_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 17:54:57,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 17:54:57,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 17:54:57,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 17:54:57,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 17:54:57,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 17:54:57,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 17:54:57,130 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 17:54:57,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 17:54:57,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 17:54:57,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 17:54:57,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 17:54:57,137 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 17:54:57,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 17:54:57,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 17:54:57,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 17:54:57,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 17:54:57,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 17:54:57,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 17:54:57,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 17:54:57,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 17:54:57,168 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 17:54:57,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 17:54:57,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 17:54:57,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 17:54:57,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 17:54:57,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 17:54:57,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 17:54:57,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 17:54:57,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 17:54:57,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 17:54:57,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 17:54:57,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 17:54:57,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 17:54:57,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 17:54:57,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 17:54:57,181 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-07 17:54:57,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 17:54:57,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 17:54:57,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 17:54:57,204 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 17:54:57,205 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 17:54:57,208 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 17:54:57,208 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 17:54:57,208 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 17:54:57,208 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 17:54:57,209 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 17:54:57,209 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 17:54:57,209 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 17:54:57,209 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 17:54:57,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 17:54:57,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 17:54:57,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 17:54:57,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 17:54:57,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 17:54:57,211 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 17:54:57,211 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 17:54:57,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 17:54:57,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 17:54:57,212 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 17:54:57,212 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 17:54:57,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 17:54:57,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 17:54:57,214 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 17:54:57,214 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 17:54:57,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 17:54:57,215 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 17:54:57,215 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 17:54:57,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 17:54:57,215 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 17:54:57,216 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 17:54:57,216 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 17:54:57,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 17:54:57,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 17:54:57,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 17:54:57,304 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 17:54:57,304 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 17:54:57,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label29_false-unreach-call.c [2018-11-07 17:54:57,375 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420e9651d/a0156aab601f4f32bb1bdad3055c4ed1/FLAG129597a19 [2018-11-07 17:54:58,185 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 17:54:58,188 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label29_false-unreach-call.c [2018-11-07 17:54:58,236 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420e9651d/a0156aab601f4f32bb1bdad3055c4ed1/FLAG129597a19 [2018-11-07 17:54:58,254 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/420e9651d/a0156aab601f4f32bb1bdad3055c4ed1 [2018-11-07 17:54:58,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 17:54:58,267 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 17:54:58,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 17:54:58,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 17:54:58,273 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 17:54:58,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:54:58" (1/1) ... [2018-11-07 17:54:58,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f118590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:54:58, skipping insertion in model container [2018-11-07 17:54:58,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:54:58" (1/1) ... [2018-11-07 17:54:58,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 17:54:58,476 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 17:54:59,981 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:54:59,987 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 17:55:00,756 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:55:00,796 INFO L193 MainTranslator]: Completed translation [2018-11-07 17:55:00,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00 WrapperNode [2018-11-07 17:55:00,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 17:55:00,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 17:55:00,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 17:55:00,798 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 17:55:00,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (1/1) ... [2018-11-07 17:55:01,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (1/1) ... [2018-11-07 17:55:01,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 17:55:01,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 17:55:01,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 17:55:01,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 17:55:01,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (1/1) ... [2018-11-07 17:55:01,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (1/1) ... [2018-11-07 17:55:01,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (1/1) ... [2018-11-07 17:55:01,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (1/1) ... [2018-11-07 17:55:01,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (1/1) ... [2018-11-07 17:55:01,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (1/1) ... [2018-11-07 17:55:01,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (1/1) ... [2018-11-07 17:55:01,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 17:55:01,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 17:55:01,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 17:55:01,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 17:55:01,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (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-07 17:55:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 17:55:01,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 17:55:01,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 17:55:01,559 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-11-07 17:55:01,560 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-11-07 17:55:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 17:55:01,560 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 17:55:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 17:55:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 17:55:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 17:55:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 17:55:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 17:55:01,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 17:55:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 17:55:01,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 17:55:13,229 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 17:55:13,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:55:13 BoogieIcfgContainer [2018-11-07 17:55:13,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 17:55:13,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 17:55:13,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 17:55:13,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 17:55:13,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:54:58" (1/3) ... [2018-11-07 17:55:13,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51456d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:55:13, skipping insertion in model container [2018-11-07 17:55:13,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:55:00" (2/3) ... [2018-11-07 17:55:13,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51456d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:55:13, skipping insertion in model container [2018-11-07 17:55:13,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:55:13" (3/3) ... [2018-11-07 17:55:13,238 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label29_false-unreach-call.c [2018-11-07 17:55:13,248 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 17:55:13,258 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 17:55:13,276 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 17:55:13,325 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 17:55:13,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 17:55:13,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 17:55:13,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 17:55:13,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 17:55:13,326 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 17:55:13,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 17:55:13,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 17:55:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-11-07 17:55:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 17:55:13,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:55:13,379 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] [2018-11-07 17:55:13,381 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:55:13,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:55:13,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1714801547, now seen corresponding path program 1 times [2018-11-07 17:55:13,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:55:13,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:13,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:55:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:13,444 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:55:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:55:13,844 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-07 17:55:13,850 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-07 17:55:13,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:55:13,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 17:55:13,853 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:55:13,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 17:55:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 17:55:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:55:13,880 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-11-07 17:55:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:55:26,536 INFO L93 Difference]: Finished difference Result 3968 states and 7392 transitions. [2018-11-07 17:55:26,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 17:55:26,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-07 17:55:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:55:26,584 INFO L225 Difference]: With dead ends: 3968 [2018-11-07 17:55:26,585 INFO L226 Difference]: Without dead ends: 2842 [2018-11-07 17:55:26,598 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:55:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-11-07 17:55:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1981. [2018-11-07 17:55:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2018-11-07 17:55:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3456 transitions. [2018-11-07 17:55:26,783 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3456 transitions. Word has length 21 [2018-11-07 17:55:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:55:26,784 INFO L480 AbstractCegarLoop]: Abstraction has 1981 states and 3456 transitions. [2018-11-07 17:55:26,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 17:55:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3456 transitions. [2018-11-07 17:55:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 17:55:26,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:55:26,789 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:55:26,790 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:55:26,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:55:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1914103630, now seen corresponding path program 1 times [2018-11-07 17:55:26,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:55:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:26,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:55:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:26,792 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:55:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:55:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:55:27,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:55:27,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 17:55:27,124 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:55:27,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 17:55:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 17:55:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 17:55:27,126 INFO L87 Difference]: Start difference. First operand 1981 states and 3456 transitions. Second operand 5 states. [2018-11-07 17:55:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:55:39,096 INFO L93 Difference]: Finished difference Result 5673 states and 10081 transitions. [2018-11-07 17:55:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:55:39,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-11-07 17:55:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:55:39,121 INFO L225 Difference]: With dead ends: 5673 [2018-11-07 17:55:39,121 INFO L226 Difference]: Without dead ends: 3698 [2018-11-07 17:55:39,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 17:55:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2018-11-07 17:55:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3687. [2018-11-07 17:55:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2018-11-07 17:55:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 5870 transitions. [2018-11-07 17:55:39,248 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 5870 transitions. Word has length 91 [2018-11-07 17:55:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:55:39,249 INFO L480 AbstractCegarLoop]: Abstraction has 3687 states and 5870 transitions. [2018-11-07 17:55:39,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 17:55:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 5870 transitions. [2018-11-07 17:55:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 17:55:39,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:55:39,255 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:55:39,255 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:55:39,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:55:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash 688522610, now seen corresponding path program 1 times [2018-11-07 17:55:39,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:55:39,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:39,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:55:39,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:39,258 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:55:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:55:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:55:39,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:55:39,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 17:55:39,441 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:55:39,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 17:55:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 17:55:39,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 17:55:39,442 INFO L87 Difference]: Start difference. First operand 3687 states and 5870 transitions. Second operand 5 states. [2018-11-07 17:55:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:55:48,896 INFO L93 Difference]: Finished difference Result 10955 states and 17866 transitions. [2018-11-07 17:55:48,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 17:55:48,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-07 17:55:48,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:55:48,942 INFO L225 Difference]: With dead ends: 10955 [2018-11-07 17:55:48,943 INFO L226 Difference]: Without dead ends: 7274 [2018-11-07 17:55:48,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 17:55:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7274 states. [2018-11-07 17:55:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7274 to 7167. [2018-11-07 17:55:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7167 states. [2018-11-07 17:55:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7167 states to 7167 states and 10519 transitions. [2018-11-07 17:55:49,148 INFO L78 Accepts]: Start accepts. Automaton has 7167 states and 10519 transitions. Word has length 93 [2018-11-07 17:55:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:55:49,149 INFO L480 AbstractCegarLoop]: Abstraction has 7167 states and 10519 transitions. [2018-11-07 17:55:49,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 17:55:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7167 states and 10519 transitions. [2018-11-07 17:55:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-07 17:55:49,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:55:49,153 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:55:49,153 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:55:49,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:55:49,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1754078826, now seen corresponding path program 1 times [2018-11-07 17:55:49,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:55:49,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:49,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:55:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:49,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:55:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:55:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:55:49,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:55:49,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 17:55:49,332 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:55:49,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 17:55:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 17:55:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:55:49,334 INFO L87 Difference]: Start difference. First operand 7167 states and 10519 transitions. Second operand 3 states. [2018-11-07 17:55:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:55:55,230 INFO L93 Difference]: Finished difference Result 20996 states and 32087 transitions. [2018-11-07 17:55:55,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 17:55:55,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-11-07 17:55:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:55:55,299 INFO L225 Difference]: With dead ends: 20996 [2018-11-07 17:55:55,299 INFO L226 Difference]: Without dead ends: 13835 [2018-11-07 17:55:55,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:55:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2018-11-07 17:55:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 13826. [2018-11-07 17:55:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13826 states. [2018-11-07 17:55:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13826 states to 13826 states and 19425 transitions. [2018-11-07 17:55:55,669 INFO L78 Accepts]: Start accepts. Automaton has 13826 states and 19425 transitions. Word has length 137 [2018-11-07 17:55:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:55:55,670 INFO L480 AbstractCegarLoop]: Abstraction has 13826 states and 19425 transitions. [2018-11-07 17:55:55,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 17:55:55,670 INFO L276 IsEmpty]: Start isEmpty. Operand 13826 states and 19425 transitions. [2018-11-07 17:55:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 17:55:55,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:55:55,677 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:55:55,678 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:55:55,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:55:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1376680716, now seen corresponding path program 1 times [2018-11-07 17:55:55,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:55:55,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:55,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:55:55,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:55:55,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:55:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:55:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:55:55,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:55:55,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 17:55:55,933 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:55:55,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 17:55:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 17:55:55,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:55:55,938 INFO L87 Difference]: Start difference. First operand 13826 states and 19425 transitions. Second operand 4 states. [2018-11-07 17:56:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:56:05,205 INFO L93 Difference]: Finished difference Result 53948 states and 81258 transitions. [2018-11-07 17:56:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 17:56:05,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-11-07 17:56:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:56:05,387 INFO L225 Difference]: With dead ends: 53948 [2018-11-07 17:56:05,387 INFO L226 Difference]: Without dead ends: 39315 [2018-11-07 17:56:05,479 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-07 17:56:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39315 states. [2018-11-07 17:56:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39315 to 39279. [2018-11-07 17:56:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39279 states. [2018-11-07 17:56:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39279 states to 39279 states and 54337 transitions. [2018-11-07 17:56:06,415 INFO L78 Accepts]: Start accepts. Automaton has 39279 states and 54337 transitions. Word has length 142 [2018-11-07 17:56:06,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:56:06,416 INFO L480 AbstractCegarLoop]: Abstraction has 39279 states and 54337 transitions. [2018-11-07 17:56:06,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 17:56:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 39279 states and 54337 transitions. [2018-11-07 17:56:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-07 17:56:06,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:56:06,426 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-07 17:56:06,426 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:56:06,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:56:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1914147908, now seen corresponding path program 1 times [2018-11-07 17:56:06,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:56:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:56:06,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:56:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:56:06,428 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:56:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:56:06,754 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:56:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 17:56:07,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:56:07,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:56:07,137 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 181 with the following transitions: [2018-11-07 17:56:07,139 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2695], [2697], [2700], [2708], [2716], [2724], [2732], [2740], [2748], [2756], [2764], [2772], [2780], [2788], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3128], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3202], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 17:56:07,188 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:56:07,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:56:07,956 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:56:07,958 INFO L272 AbstractInterpreter]: Visited 92 different actions 92 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 17:56:08,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:56:08,010 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:56:08,666 INFO L227 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 71.05% of their original sizes. [2018-11-07 17:56:08,666 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:56:09,404 INFO L415 sIntCurrentIteration]: We unified 179 AI predicates to 179 [2018-11-07 17:56:09,405 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:56:09,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:56:09,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-07 17:56:09,406 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:56:09,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 17:56:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 17:56:09,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-07 17:56:09,407 INFO L87 Difference]: Start difference. First operand 39279 states and 54337 transitions. Second operand 10 states. [2018-11-07 17:56:27,072 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:57:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:57:47,259 INFO L93 Difference]: Finished difference Result 79361 states and 109611 transitions. [2018-11-07 17:57:47,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 17:57:47,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 180 [2018-11-07 17:57:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:57:47,413 INFO L225 Difference]: With dead ends: 79361 [2018-11-07 17:57:47,413 INFO L226 Difference]: Without dead ends: 40088 [2018-11-07 17:57:47,515 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-11-07 17:57:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40088 states. [2018-11-07 17:57:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40088 to 40083. [2018-11-07 17:57:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40083 states. [2018-11-07 17:57:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40083 states to 40083 states and 55152 transitions. [2018-11-07 17:57:48,302 INFO L78 Accepts]: Start accepts. Automaton has 40083 states and 55152 transitions. Word has length 180 [2018-11-07 17:57:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:57:48,302 INFO L480 AbstractCegarLoop]: Abstraction has 40083 states and 55152 transitions. [2018-11-07 17:57:48,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 17:57:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 40083 states and 55152 transitions. [2018-11-07 17:57:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-07 17:57:48,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:57:48,318 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 17:57:48,318 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:57:48,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:57:48,318 INFO L82 PathProgramCache]: Analyzing trace with hash 454812367, now seen corresponding path program 1 times [2018-11-07 17:57:48,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:57:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:57:48,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:57:48,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:57:48,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:57:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:57:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-07 17:57:48,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:57:48,764 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:57:48,764 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 343 with the following transitions: [2018-11-07 17:57:48,765 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2695], [2697], [2700], [2708], [2716], [2724], [2732], [2740], [2748], [2756], [2764], [2772], [2780], [2788], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3120], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3358], [3361], [3365], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3409], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-11-07 17:57:48,771 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:57:48,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:57:49,384 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:57:49,384 INFO L272 AbstractInterpreter]: Visited 139 different actions 404 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 17:57:49,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:57:49,423 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:57:50,073 INFO L227 lantSequenceWeakener]: Weakened 337 states. On average, predicates are now at 70.84% of their original sizes. [2018-11-07 17:57:50,074 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:57:50,786 INFO L415 sIntCurrentIteration]: We unified 341 AI predicates to 341 [2018-11-07 17:57:50,786 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:57:50,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:57:50,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 17:57:50,787 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:57:50,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 17:57:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 17:57:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 17:57:50,789 INFO L87 Difference]: Start difference. First operand 40083 states and 55152 transitions. Second operand 11 states. [2018-11-07 17:57:56,070 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-11-07 17:58:19,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 17:58:19,171 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 17:58:19,177 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 17:58:19,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:58:19 BoogieIcfgContainer [2018-11-07 17:58:19,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 17:58:19,178 INFO L168 Benchmark]: Toolchain (without parser) took 200911.84 ms. Allocated memory was 1.5 GB in the beginning and 5.7 GB in the end (delta: 4.2 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -924.9 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2018-11-07 17:58:19,180 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 17:58:19,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2529.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-07 17:58:19,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 370.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 792.2 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-07 17:58:19,182 INFO L168 Benchmark]: Boogie Preprocessor took 314.36 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: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. [2018-11-07 17:58:19,183 INFO L168 Benchmark]: RCFGBuilder took 11746.70 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 668.9 MB. Max. memory is 7.1 GB. [2018-11-07 17:58:19,184 INFO L168 Benchmark]: TraceAbstraction took 185946.63 ms. Allocated memory was 2.5 GB in the beginning and 5.7 GB in the end (delta: 3.2 GB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -132.9 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-11-07 17:58:19,190 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2529.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 370.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 792.2 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 314.36 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: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11746.70 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 163.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 11.1 MB). Peak memory consumption was 668.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 185946.63 ms. Allocated memory was 2.5 GB in the beginning and 5.7 GB in the end (delta: 3.2 GB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -132.9 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (40083states) and FLOYD_HOARE automaton (currently 14 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (19952 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. TIMEOUT Result, 185.8s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 176.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5623 SDtfs, 16433 SDslu, 3716 SDs, 0 SdLazy, 32714 SolverSat, 6237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 94.8s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 566 GetRequests, 518 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40083occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9973255928853753 AbsIntWeakeningRatio, 0.12115384615384615 AbsIntAvgWeakeningVarsNumRemoved, 13.898076923076923 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 1029 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1006 NumberOfCodeBlocks, 1006 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 999 ConstructedInterpolants, 0 QuantifiedInterpolants, 501062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 388/457 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown