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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 03:50:55,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 03:50:55,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 03:50:55,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 03:50:55,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 03:50:55,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 03:50:55,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 03:50:55,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 03:50:55,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 03:50:55,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 03:50:55,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 03:50:55,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 03:50:55,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 03:50:55,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 03:50:55,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 03:50:55,215 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 03:50:55,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 03:50:55,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 03:50:55,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 03:50:55,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 03:50:55,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 03:50:55,231 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 03:50:55,237 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 03:50:55,237 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 03:50:55,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 03:50:55,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 03:50:55,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 03:50:55,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 03:50:55,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 03:50:55,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 03:50:55,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 03:50:55,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 03:50:55,247 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 03:50:55,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 03:50:55,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 03:50:55,250 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 03:50:55,250 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 03:50:55,277 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 03:50:55,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 03:50:55,278 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 03:50:55,279 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 03:50:55,279 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 03:50:55,279 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 03:50:55,279 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 03:50:55,279 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 03:50:55,280 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 03:50:55,280 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 03:50:55,280 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 03:50:55,280 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 03:50:55,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 03:50:55,281 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 03:50:55,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 03:50:55,282 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 03:50:55,282 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 03:50:55,282 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 03:50:55,282 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 03:50:55,282 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 03:50:55,283 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 03:50:55,283 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 03:50:55,283 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 03:50:55,283 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 03:50:55,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 03:50:55,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 03:50:55,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 03:50:55,284 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 03:50:55,284 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 03:50:55,284 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 03:50:55,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 03:50:55,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 03:50:55,285 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 03:50:55,285 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 03:50:55,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 03:50:55,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 03:50:55,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 03:50:55,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 03:50:55,352 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 03:50:55,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label59_true-unreach-call.c [2018-11-07 03:50:55,412 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5da4f96/ddf7d891977d4d3eb1dce469f5ef1b47/FLAG5e63eb857 [2018-11-07 03:50:56,153 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 03:50:56,154 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label59_true-unreach-call.c [2018-11-07 03:50:56,182 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5da4f96/ddf7d891977d4d3eb1dce469f5ef1b47/FLAG5e63eb857 [2018-11-07 03:50:56,203 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e5da4f96/ddf7d891977d4d3eb1dce469f5ef1b47 [2018-11-07 03:50:56,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 03:50:56,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 03:50:56,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 03:50:56,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 03:50:56,224 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 03:50:56,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:50:56" (1/1) ... [2018-11-07 03:50:56,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193d11b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:56, skipping insertion in model container [2018-11-07 03:50:56,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:50:56" (1/1) ... [2018-11-07 03:50:56,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 03:50:56,338 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 03:50:57,082 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:50:57,087 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 03:50:57,339 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:50:57,362 INFO L193 MainTranslator]: Completed translation [2018-11-07 03:50:57,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57 WrapperNode [2018-11-07 03:50:57,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 03:50:57,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 03:50:57,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 03:50:57,364 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 03:50:57,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (1/1) ... [2018-11-07 03:50:57,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (1/1) ... [2018-11-07 03:50:57,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 03:50:57,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 03:50:57,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 03:50:57,560 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 03:50:57,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (1/1) ... [2018-11-07 03:50:57,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (1/1) ... [2018-11-07 03:50:57,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (1/1) ... [2018-11-07 03:50:57,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (1/1) ... [2018-11-07 03:50:57,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (1/1) ... [2018-11-07 03:50:57,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (1/1) ... [2018-11-07 03:50:57,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (1/1) ... [2018-11-07 03:50:57,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 03:50:57,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 03:50:57,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 03:50:57,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 03:50:57,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (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 03:50:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 03:50:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 03:50:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 03:50:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 03:50:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 03:50:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 03:50:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 03:50:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 03:50:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 03:50:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 03:50:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 03:51:05,505 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 03:51:05,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:51:05 BoogieIcfgContainer [2018-11-07 03:51:05,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 03:51:05,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 03:51:05,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 03:51:05,512 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 03:51:05,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:50:56" (1/3) ... [2018-11-07 03:51:05,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dae5924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:51:05, skipping insertion in model container [2018-11-07 03:51:05,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:57" (2/3) ... [2018-11-07 03:51:05,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dae5924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:51:05, skipping insertion in model container [2018-11-07 03:51:05,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:51:05" (3/3) ... [2018-11-07 03:51:05,515 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label59_true-unreach-call.c [2018-11-07 03:51:05,526 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 03:51:05,535 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 03:51:05,554 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 03:51:05,598 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 03:51:05,599 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 03:51:05,599 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 03:51:05,599 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 03:51:05,599 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 03:51:05,599 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 03:51:05,599 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 03:51:05,600 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 03:51:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2018-11-07 03:51:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 03:51:05,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:51:05,659 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:51:05,662 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:51:05,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash 371317715, now seen corresponding path program 1 times [2018-11-07 03:51:05,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:51:05,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:05,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:05,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:05,721 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:51:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:06,256 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 03:51:06,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:51:06,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 03:51:06,259 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:51:06,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 03:51:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 03:51:06,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:51:06,288 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 4 states. [2018-11-07 03:51:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:51:11,572 INFO L93 Difference]: Finished difference Result 1513 states and 2838 transitions. [2018-11-07 03:51:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 03:51:11,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-07 03:51:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:51:11,607 INFO L225 Difference]: With dead ends: 1513 [2018-11-07 03:51:11,608 INFO L226 Difference]: Without dead ends: 1097 [2018-11-07 03:51:11,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:51:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-11-07 03:51:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 744. [2018-11-07 03:51:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-07 03:51:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1357 transitions. [2018-11-07 03:51:11,797 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1357 transitions. Word has length 51 [2018-11-07 03:51:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:51:11,798 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1357 transitions. [2018-11-07 03:51:11,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 03:51:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1357 transitions. [2018-11-07 03:51:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 03:51:11,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:51:11,808 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:11,808 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:51:11,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1405398300, now seen corresponding path program 1 times [2018-11-07 03:51:11,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:51:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:11,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:11,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:51:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:51:12,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:51:12,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:51:12,027 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:51:12,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:51:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:51:12,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:51:12,030 INFO L87 Difference]: Start difference. First operand 744 states and 1357 transitions. Second operand 5 states. [2018-11-07 03:51:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:51:16,709 INFO L93 Difference]: Finished difference Result 2196 states and 4092 transitions. [2018-11-07 03:51:16,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:51:16,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-07 03:51:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:51:16,732 INFO L225 Difference]: With dead ends: 2196 [2018-11-07 03:51:16,733 INFO L226 Difference]: Without dead ends: 1458 [2018-11-07 03:51:16,737 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:51:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-11-07 03:51:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1438. [2018-11-07 03:51:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-11-07 03:51:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2551 transitions. [2018-11-07 03:51:16,832 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2551 transitions. Word has length 121 [2018-11-07 03:51:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:51:16,832 INFO L480 AbstractCegarLoop]: Abstraction has 1438 states and 2551 transitions. [2018-11-07 03:51:16,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:51:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2551 transitions. [2018-11-07 03:51:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-07 03:51:16,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:51:16,845 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:16,845 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:51:16,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1847072879, now seen corresponding path program 1 times [2018-11-07 03:51:16,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:51:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:16,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:16,848 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:51:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:51:17,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:51:17,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:51:17,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:51:17,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:51:17,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:51:17,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:51:17,109 INFO L87 Difference]: Start difference. First operand 1438 states and 2551 transitions. Second operand 6 states. [2018-11-07 03:51:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:51:21,831 INFO L93 Difference]: Finished difference Result 4237 states and 7540 transitions. [2018-11-07 03:51:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:51:21,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-11-07 03:51:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:51:21,851 INFO L225 Difference]: With dead ends: 4237 [2018-11-07 03:51:21,851 INFO L226 Difference]: Without dead ends: 2805 [2018-11-07 03:51:21,862 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-07 03:51:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2018-11-07 03:51:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2785. [2018-11-07 03:51:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2018-11-07 03:51:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4352 transitions. [2018-11-07 03:51:21,948 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4352 transitions. Word has length 124 [2018-11-07 03:51:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:51:21,949 INFO L480 AbstractCegarLoop]: Abstraction has 2785 states and 4352 transitions. [2018-11-07 03:51:21,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:51:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4352 transitions. [2018-11-07 03:51:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-07 03:51:21,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:51:21,952 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:21,952 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:51:21,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash -674317012, now seen corresponding path program 1 times [2018-11-07 03:51:21,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:51:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:21,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:21,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:51:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:51:22,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:51:22,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:51:22,166 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:51:22,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:51:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:51:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:51:22,168 INFO L87 Difference]: Start difference. First operand 2785 states and 4352 transitions. Second operand 6 states. [2018-11-07 03:51:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:51:26,033 INFO L93 Difference]: Finished difference Result 6952 states and 11048 transitions. [2018-11-07 03:51:26,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:51:26,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-11-07 03:51:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:51:26,068 INFO L225 Difference]: With dead ends: 6952 [2018-11-07 03:51:26,068 INFO L226 Difference]: Without dead ends: 4173 [2018-11-07 03:51:26,085 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-07 03:51:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2018-11-07 03:51:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4153. [2018-11-07 03:51:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4153 states. [2018-11-07 03:51:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 5896 transitions. [2018-11-07 03:51:26,216 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 5896 transitions. Word has length 125 [2018-11-07 03:51:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:51:26,216 INFO L480 AbstractCegarLoop]: Abstraction has 4153 states and 5896 transitions. [2018-11-07 03:51:26,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:51:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 5896 transitions. [2018-11-07 03:51:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 03:51:26,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:51:26,223 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:26,223 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:51:26,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:26,223 INFO L82 PathProgramCache]: Analyzing trace with hash -710224295, now seen corresponding path program 1 times [2018-11-07 03:51:26,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:51:26,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:26,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:26,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:51:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:51:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:51:26,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:51:26,476 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:51:26,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:51:26,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:51:26,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:51:26,477 INFO L87 Difference]: Start difference. First operand 4153 states and 5896 transitions. Second operand 6 states. [2018-11-07 03:51:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:51:31,023 INFO L93 Difference]: Finished difference Result 11374 states and 16767 transitions. [2018-11-07 03:51:31,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:51:31,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-07 03:51:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:51:31,077 INFO L225 Difference]: With dead ends: 11374 [2018-11-07 03:51:31,078 INFO L226 Difference]: Without dead ends: 7227 [2018-11-07 03:51:31,109 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-07 03:51:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2018-11-07 03:51:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7152. [2018-11-07 03:51:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7152 states. [2018-11-07 03:51:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7152 states to 7152 states and 9826 transitions. [2018-11-07 03:51:31,300 INFO L78 Accepts]: Start accepts. Automaton has 7152 states and 9826 transitions. Word has length 128 [2018-11-07 03:51:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:51:31,300 INFO L480 AbstractCegarLoop]: Abstraction has 7152 states and 9826 transitions. [2018-11-07 03:51:31,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:51:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7152 states and 9826 transitions. [2018-11-07 03:51:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-07 03:51:31,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:51:31,303 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:31,304 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:51:31,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash -727624727, now seen corresponding path program 1 times [2018-11-07 03:51:31,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:51:31,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:31,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:31,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:51:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:31,560 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 03:51:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:51:31,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:51:31,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:51:31,938 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:51:31,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:51:31,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:51:31,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:51:31,939 INFO L87 Difference]: Start difference. First operand 7152 states and 9826 transitions. Second operand 6 states. [2018-11-07 03:51:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:51:35,165 INFO L93 Difference]: Finished difference Result 17771 states and 25546 transitions. [2018-11-07 03:51:35,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:51:35,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2018-11-07 03:51:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:51:35,219 INFO L225 Difference]: With dead ends: 17771 [2018-11-07 03:51:35,219 INFO L226 Difference]: Without dead ends: 10625 [2018-11-07 03:51:35,248 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 03:51:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10625 states. [2018-11-07 03:51:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10625 to 10585. [2018-11-07 03:51:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10585 states. [2018-11-07 03:51:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10585 states to 10585 states and 13819 transitions. [2018-11-07 03:51:35,604 INFO L78 Accepts]: Start accepts. Automaton has 10585 states and 13819 transitions. Word has length 136 [2018-11-07 03:51:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:51:35,605 INFO L480 AbstractCegarLoop]: Abstraction has 10585 states and 13819 transitions. [2018-11-07 03:51:35,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:51:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 10585 states and 13819 transitions. [2018-11-07 03:51:35,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 03:51:35,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:51:35,609 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:35,610 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:51:35,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:35,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2054227824, now seen corresponding path program 1 times [2018-11-07 03:51:35,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:51:35,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:35,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:35,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:35,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:51:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:35,867 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-07 03:51:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:51:35,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:51:35,993 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:51:35,994 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-11-07 03:51:36,002 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [487], [489], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [760], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-07 03:51:36,080 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:51:36,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:51:38,007 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 03:51:44,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 03:51:44,142 INFO L272 AbstractInterpreter]: Visited 100 different actions 290 times. Merged at 5 different actions 13 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 03:51:44,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:44,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 03:51:44,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:51:44,158 INFO L194 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-07 03:51:44,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:44,170 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 03:51:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:44,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 03:51:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:51:44,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 03:51:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:51:44,739 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 03:51:44,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2018-11-07 03:51:44,740 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:51:44,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 03:51:44,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 03:51:44,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:51:44,741 INFO L87 Difference]: Start difference. First operand 10585 states and 13819 transitions. Second operand 3 states. [2018-11-07 03:51:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:51:48,972 INFO L93 Difference]: Finished difference Result 21164 states and 27640 transitions. [2018-11-07 03:51:48,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 03:51:48,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-11-07 03:51:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:51:49,012 INFO L225 Difference]: With dead ends: 21164 [2018-11-07 03:51:49,013 INFO L226 Difference]: Without dead ends: 7903 [2018-11-07 03:51:49,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:51:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7903 states. [2018-11-07 03:51:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7903 to 7903. [2018-11-07 03:51:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7903 states. [2018-11-07 03:51:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7903 states to 7903 states and 8996 transitions. [2018-11-07 03:51:49,292 INFO L78 Accepts]: Start accepts. Automaton has 7903 states and 8996 transitions. Word has length 143 [2018-11-07 03:51:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:51:49,292 INFO L480 AbstractCegarLoop]: Abstraction has 7903 states and 8996 transitions. [2018-11-07 03:51:49,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 03:51:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7903 states and 8996 transitions. [2018-11-07 03:51:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 03:51:49,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:51:49,297 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:51:49,297 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:51:49,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1721939931, now seen corresponding path program 1 times [2018-11-07 03:51:49,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:51:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:49,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:49,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:51:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:49,539 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:51:49,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:51:49,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 03:51:49,540 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:51:49,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 03:51:49,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 03:51:49,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:51:49,541 INFO L87 Difference]: Start difference. First operand 7903 states and 8996 transitions. Second operand 4 states. [2018-11-07 03:51:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:51:51,881 INFO L93 Difference]: Finished difference Result 23776 states and 27470 transitions. [2018-11-07 03:51:51,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 03:51:51,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-11-07 03:51:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:51:51,942 INFO L225 Difference]: With dead ends: 23776 [2018-11-07 03:51:51,943 INFO L226 Difference]: Without dead ends: 15879 [2018-11-07 03:51:51,973 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 03:51:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15879 states. [2018-11-07 03:51:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15877. [2018-11-07 03:51:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15877 states. [2018-11-07 03:51:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 17767 transitions. [2018-11-07 03:51:52,287 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 17767 transitions. Word has length 214 [2018-11-07 03:51:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:51:52,288 INFO L480 AbstractCegarLoop]: Abstraction has 15877 states and 17767 transitions. [2018-11-07 03:51:52,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 03:51:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 17767 transitions. [2018-11-07 03:51:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-11-07 03:51:52,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:51:52,358 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-11-07 03:51:52,358 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:51:52,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:51:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1257154816, now seen corresponding path program 1 times [2018-11-07 03:51:52,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:51:52,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:52,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:51:52,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:51:52,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:51:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:51:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 300 proven. 223 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-11-07 03:51:53,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:51:53,369 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:51:53,370 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 675 with the following transitions: [2018-11-07 03:51:53,371 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [487], [489], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [836], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1445], [1449], [1453], [1456], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-07 03:51:53,390 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:51:53,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:52:00,473 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 03:52:00,473 INFO L272 AbstractInterpreter]: Visited 273 different actions 273 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 03:52:00,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:52:00,483 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 03:52:05,026 INFO L227 lantSequenceWeakener]: Weakened 660 states. On average, predicates are now at 77.55% of their original sizes. [2018-11-07 03:52:05,027 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 03:52:05,622 INFO L415 sIntCurrentIteration]: We unified 673 AI predicates to 673 [2018-11-07 03:52:05,622 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 03:52:05,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 03:52:05,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-07 03:52:05,623 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:52:05,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 03:52:05,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 03:52:05,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-07 03:52:05,625 INFO L87 Difference]: Start difference. First operand 15877 states and 17767 transitions. Second operand 9 states. [2018-11-07 03:52:11,392 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 03:52:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:52:42,890 INFO L93 Difference]: Finished difference Result 32088 states and 35905 transitions. [2018-11-07 03:52:42,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 03:52:42,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 674 [2018-11-07 03:52:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:52:42,952 INFO L225 Difference]: With dead ends: 32088 [2018-11-07 03:52:42,952 INFO L226 Difference]: Without dead ends: 16217 [2018-11-07 03:52:42,987 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 676 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 03:52:43,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16217 states. [2018-11-07 03:52:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16217 to 16215. [2018-11-07 03:52:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16215 states. [2018-11-07 03:52:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16215 states to 16215 states and 18109 transitions. [2018-11-07 03:52:43,292 INFO L78 Accepts]: Start accepts. Automaton has 16215 states and 18109 transitions. Word has length 674 [2018-11-07 03:52:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:52:43,293 INFO L480 AbstractCegarLoop]: Abstraction has 16215 states and 18109 transitions. [2018-11-07 03:52:43,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 03:52:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 16215 states and 18109 transitions. [2018-11-07 03:52:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2018-11-07 03:52:43,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:52:43,377 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:52:43,377 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:52:43,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:52:43,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1767722917, now seen corresponding path program 1 times [2018-11-07 03:52:43,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:52:43,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:52:43,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:52:43,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:52:43,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:52:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:52:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 473 proven. 223 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2018-11-07 03:52:44,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:52:44,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:52:44,582 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 915 with the following transitions: [2018-11-07 03:52:44,583 INFO L202 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [487], [489], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [836], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1421], [1425], [1429], [1433], [1437], [1441], [1445], [1449], [1453], [1456], [1552], [1556], [1560], [1566], [1570], [1572], [1579], [1580], [1581], [1583], [1584] [2018-11-07 03:52:44,592 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:52:44,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:53:02,057 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 03:53:02,058 INFO L272 AbstractInterpreter]: Visited 277 different actions 548 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 03:53:02,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:53:02,065 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 03:53:07,947 INFO L227 lantSequenceWeakener]: Weakened 415 states. On average, predicates are now at 77.82% of their original sizes. [2018-11-07 03:53:07,948 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 03:53:16,640 INFO L415 sIntCurrentIteration]: We unified 913 AI predicates to 913 [2018-11-07 03:53:16,640 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 03:53:16,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 03:53:16,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-07 03:53:16,641 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:53:16,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 03:53:16,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 03:53:16,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-11-07 03:53:16,643 INFO L87 Difference]: Start difference. First operand 16215 states and 18109 transitions. Second operand 25 states. Received shutdown request... [2018-11-07 03:54:39,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 03:54:39,787 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 03:54:39,794 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 03:54:39,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:54:39 BoogieIcfgContainer [2018-11-07 03:54:39,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 03:54:39,795 INFO L168 Benchmark]: Toolchain (without parser) took 223578.76 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 324.5 MB. Max. memory is 7.1 GB. [2018-11-07 03:54:39,796 INFO L168 Benchmark]: CDTParser took 0.21 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-07 03:54:39,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1143.65 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-11-07 03:54:39,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 195.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -877.6 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2018-11-07 03:54:39,804 INFO L168 Benchmark]: Boogie Preprocessor took 209.38 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 03:54:39,805 INFO L168 Benchmark]: RCFGBuilder took 7737.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.9 MB). Peak memory consumption was 254.9 MB. Max. memory is 7.1 GB. [2018-11-07 03:54:39,806 INFO L168 Benchmark]: TraceAbstraction took 214286.60 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 3.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. [2018-11-07 03:54:39,814 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.21 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 1143.65 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 195.93 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -877.6 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 209.38 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 7737.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 254.9 MB). Peak memory consumption was 254.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 214286.60 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 3.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 139]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 139). Cancelled while BasicCegarLoop was constructing difference of abstraction (16215states) and FLOYD_HOARE automaton (currently 17 states, 25 states before enhancement),while ReachableStatesComputation was computing reachable states (350 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 410 locations, 1 error locations. TIMEOUT Result, 214.2s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 153.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1924 SDtfs, 13227 SDslu, 1004 SDs, 0 SdLazy, 17851 SolverSat, 4148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1947 GetRequests, 1859 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16215occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 32.7s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.997922263647495 AbsIntWeakeningRatio, 0.05170239596469105 AbsIntAvgWeakeningVarsNumRemoved, 789.5359394703657 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 532 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2773 NumberOfCodeBlocks, 2773 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2904 ConstructedInterpolants, 0 QuantifiedInterpolants, 3074173 SizeOfPredicates, 2 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 2310/2779 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown