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/Problem03_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 01:27:17,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 01:27:17,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 01:27:17,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 01:27:17,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 01:27:17,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 01:27:17,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 01:27:17,107 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 01:27:17,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 01:27:17,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 01:27:17,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 01:27:17,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 01:27:17,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 01:27:17,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 01:27:17,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 01:27:17,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 01:27:17,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 01:27:17,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 01:27:17,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 01:27:17,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 01:27:17,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 01:27:17,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 01:27:17,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 01:27:17,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 01:27:17,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 01:27:17,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 01:27:17,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 01:27:17,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 01:27:17,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 01:27:17,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 01:27:17,152 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 01:27:17,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 01:27:17,154 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 01:27:17,154 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 01:27:17,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 01:27:17,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 01:27:17,157 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 01:27:17,185 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 01:27:17,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 01:27:17,186 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 01:27:17,186 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 01:27:17,186 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 01:27:17,186 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 01:27:17,187 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 01:27:17,187 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 01:27:17,187 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 01:27:17,187 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 01:27:17,188 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 01:27:17,188 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 01:27:17,188 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 01:27:17,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 01:27:17,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 01:27:17,189 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 01:27:17,189 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 01:27:17,189 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 01:27:17,190 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 01:27:17,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 01:27:17,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 01:27:17,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 01:27:17,192 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 01:27:17,192 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 01:27:17,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 01:27:17,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 01:27:17,192 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 01:27:17,193 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 01:27:17,193 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 01:27:17,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 01:27:17,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 01:27:17,193 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 01:27:17,194 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 01:27:17,195 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 01:27:17,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 01:27:17,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 01:27:17,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 01:27:17,269 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 01:27:17,270 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 01:27:17,270 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-11-07 01:27:17,332 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e99cb58/df1ebc39082c43708edb237b2d05a9b3/FLAGa08fbc65f [2018-11-07 01:27:17,987 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 01:27:17,989 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-11-07 01:27:18,009 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e99cb58/df1ebc39082c43708edb237b2d05a9b3/FLAGa08fbc65f [2018-11-07 01:27:18,025 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e99cb58/df1ebc39082c43708edb237b2d05a9b3 [2018-11-07 01:27:18,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 01:27:18,038 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 01:27:18,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 01:27:18,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 01:27:18,046 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 01:27:18,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:27:18" (1/1) ... [2018-11-07 01:27:18,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b5474c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:18, skipping insertion in model container [2018-11-07 01:27:18,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:27:18" (1/1) ... [2018-11-07 01:27:18,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 01:27:18,171 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 01:27:18,881 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:27:18,887 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 01:27:19,145 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 01:27:19,166 INFO L193 MainTranslator]: Completed translation [2018-11-07 01:27:19,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19 WrapperNode [2018-11-07 01:27:19,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 01:27:19,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 01:27:19,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 01:27:19,169 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 01:27:19,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (1/1) ... [2018-11-07 01:27:19,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (1/1) ... [2018-11-07 01:27:19,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 01:27:19,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 01:27:19,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 01:27:19,383 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 01:27:19,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (1/1) ... [2018-11-07 01:27:19,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (1/1) ... [2018-11-07 01:27:19,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (1/1) ... [2018-11-07 01:27:19,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (1/1) ... [2018-11-07 01:27:19,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (1/1) ... [2018-11-07 01:27:19,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (1/1) ... [2018-11-07 01:27:19,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (1/1) ... [2018-11-07 01:27:19,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 01:27:19,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 01:27:19,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 01:27:19,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 01:27:19,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (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 01:27:19,609 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 01:27:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 01:27:19,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 01:27:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 01:27:19,610 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 01:27:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 01:27:19,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 01:27:19,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 01:27:19,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 01:27:24,268 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 01:27:24,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:27:24 BoogieIcfgContainer [2018-11-07 01:27:24,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 01:27:24,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 01:27:24,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 01:27:24,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 01:27:24,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:27:18" (1/3) ... [2018-11-07 01:27:24,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3569d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:27:24, skipping insertion in model container [2018-11-07 01:27:24,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:27:19" (2/3) ... [2018-11-07 01:27:24,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3569d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:27:24, skipping insertion in model container [2018-11-07 01:27:24,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:27:24" (3/3) ... [2018-11-07 01:27:24,280 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label17_true-unreach-call.c [2018-11-07 01:27:24,290 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 01:27:24,300 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 01:27:24,319 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 01:27:24,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 01:27:24,361 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 01:27:24,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 01:27:24,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 01:27:24,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 01:27:24,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 01:27:24,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 01:27:24,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 01:27:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-11-07 01:27:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 01:27:24,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:27:24,416 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:24,419 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:27:24,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:27:24,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1877378719, now seen corresponding path program 1 times [2018-11-07 01:27:24,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:27:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:24,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:27:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:24,489 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:27:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:27:25,582 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 01:27:25,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:27:25,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 01:27:25,585 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:27:25,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 01:27:25,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 01:27:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 01:27:25,614 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-11-07 01:27:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:27:28,779 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-11-07 01:27:28,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 01:27:28,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-11-07 01:27:28,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:27:28,807 INFO L225 Difference]: With dead ends: 1066 [2018-11-07 01:27:28,807 INFO L226 Difference]: Without dead ends: 748 [2018-11-07 01:27:28,816 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 01:27:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-07 01:27:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-11-07 01:27:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-07 01:27:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-11-07 01:27:28,972 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 206 [2018-11-07 01:27:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:27:28,973 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-11-07 01:27:28,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 01:27:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-11-07 01:27:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 01:27:28,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:27:28,995 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:27:28,999 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:27:28,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:27:28,999 INFO L82 PathProgramCache]: Analyzing trace with hash -360788856, now seen corresponding path program 1 times [2018-11-07 01:27:29,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:27:29,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:29,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:27:29,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:29,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:27:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:27:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:27:29,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:27:29,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:27:29,362 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:27:29,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:27:29,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:27:29,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:27:29,365 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-11-07 01:27:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:27:32,687 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-11-07 01:27:32,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 01:27:32,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2018-11-07 01:27:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:27:32,698 INFO L225 Difference]: With dead ends: 1590 [2018-11-07 01:27:32,699 INFO L226 Difference]: Without dead ends: 1069 [2018-11-07 01:27:32,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:27:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-11-07 01:27:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-11-07 01:27:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-11-07 01:27:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-11-07 01:27:32,773 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 216 [2018-11-07 01:27:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:27:32,773 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-11-07 01:27:32,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:27:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-11-07 01:27:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-07 01:27:32,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:27:32,779 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:27:32,781 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:27:32,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:27:32,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1375336592, now seen corresponding path program 1 times [2018-11-07 01:27:32,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:27:32,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:32,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:27:32,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:32,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:27:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:27:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:27:32,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:27:32,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 01:27:32,986 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:27:32,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 01:27:32,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 01:27:32,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 01:27:32,988 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-11-07 01:27:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:27:37,242 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-11-07 01:27:37,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:27:37,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-11-07 01:27:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:27:37,269 INFO L225 Difference]: With dead ends: 3166 [2018-11-07 01:27:37,269 INFO L226 Difference]: Without dead ends: 2148 [2018-11-07 01:27:37,280 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 01:27:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-11-07 01:27:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-11-07 01:27:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-11-07 01:27:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-11-07 01:27:37,390 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 217 [2018-11-07 01:27:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:27:37,390 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-11-07 01:27:37,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 01:27:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-11-07 01:27:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 01:27:37,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:27:37,401 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:27:37,401 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:27:37,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:27:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 809544677, now seen corresponding path program 1 times [2018-11-07 01:27:37,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:27:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:37,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:27:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:37,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:27:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:27:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:27:37,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:27:37,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 01:27:37,829 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:27:37,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 01:27:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 01:27:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:27:37,831 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-11-07 01:27:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:27:40,505 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-11-07 01:27:40,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 01:27:40,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-11-07 01:27:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:27:40,535 INFO L225 Difference]: With dead ends: 6108 [2018-11-07 01:27:40,535 INFO L226 Difference]: Without dead ends: 4009 [2018-11-07 01:27:40,546 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 01:27:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-11-07 01:27:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-11-07 01:27:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-11-07 01:27:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-11-07 01:27:40,683 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 219 [2018-11-07 01:27:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:27:40,683 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-11-07 01:27:40,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 01:27:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-11-07 01:27:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-07 01:27:40,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:27:40,699 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:27:40,700 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:27:40,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:27:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash -703936903, now seen corresponding path program 1 times [2018-11-07 01:27:40,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:27:40,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:40,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:27:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:40,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:27:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:27:41,152 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 01:27:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:27:41,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:27:41,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 01:27:41,478 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:27:41,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 01:27:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 01:27:41,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 01:27:41,479 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-11-07 01:27:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:27:43,594 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-11-07 01:27:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:27:43,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-11-07 01:27:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:27:43,657 INFO L225 Difference]: With dead ends: 12096 [2018-11-07 01:27:43,658 INFO L226 Difference]: Without dead ends: 8129 [2018-11-07 01:27:43,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:27:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-11-07 01:27:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-11-07 01:27:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-11-07 01:27:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-11-07 01:27:44,000 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 225 [2018-11-07 01:27:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:27:44,000 INFO L480 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-11-07 01:27:44,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 01:27:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-11-07 01:27:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 01:27:44,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:27:44,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:44,036 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:27:44,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:27:44,036 INFO L82 PathProgramCache]: Analyzing trace with hash -520261908, now seen corresponding path program 1 times [2018-11-07 01:27:44,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:27:44,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:44,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:27:44,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:44,038 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:27:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:27:44,323 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 01:27:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:27:44,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:27:44,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:27:44,567 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:27:44,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:27:44,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:27:44,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:27:44,568 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-11-07 01:27:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:27:47,167 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-11-07 01:27:47,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 01:27:47,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-11-07 01:27:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:27:47,266 INFO L225 Difference]: With dead ends: 22960 [2018-11-07 01:27:47,266 INFO L226 Difference]: Without dead ends: 15024 [2018-11-07 01:27:47,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 01:27:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-11-07 01:27:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-11-07 01:27:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-11-07 01:27:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-11-07 01:27:47,807 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 230 [2018-11-07 01:27:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:27:47,807 INFO L480 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-11-07 01:27:47,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:27:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-11-07 01:27:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-07 01:27:47,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:27:47,867 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:47,867 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:27:47,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:27:47,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2136033641, now seen corresponding path program 1 times [2018-11-07 01:27:47,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:27:47,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:47,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:27:47,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:47,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:27:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:27:48,570 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 01:27:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 01:27:48,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:27:48,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 01:27:48,875 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:27:48,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 01:27:48,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 01:27:48,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:27:48,876 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-11-07 01:27:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:27:53,657 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-11-07 01:27:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 01:27:53,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2018-11-07 01:27:53,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:27:53,726 INFO L225 Difference]: With dead ends: 31818 [2018-11-07 01:27:53,726 INFO L226 Difference]: Without dead ends: 16918 [2018-11-07 01:27:53,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 01:27:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-11-07 01:27:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-11-07 01:27:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-11-07 01:27:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-11-07 01:27:54,157 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 254 [2018-11-07 01:27:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:27:54,158 INFO L480 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-11-07 01:27:54,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 01:27:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-11-07 01:27:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-07 01:27:54,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:27:54,225 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:27:54,225 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:27:54,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:27:54,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1208828973, now seen corresponding path program 1 times [2018-11-07 01:27:54,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:27:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:54,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:27:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:54,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:27:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:27:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 01:27:54,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 01:27:54,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 01:27:54,579 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:27:54,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 01:27:54,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 01:27:54,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 01:27:54,580 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 3 states. [2018-11-07 01:27:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:27:56,336 INFO L93 Difference]: Finished difference Result 46520 states and 75721 transitions. [2018-11-07 01:27:56,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 01:27:56,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-11-07 01:27:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:27:56,443 INFO L225 Difference]: With dead ends: 46520 [2018-11-07 01:27:56,443 INFO L226 Difference]: Without dead ends: 29610 [2018-11-07 01:27:56,497 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 01:27:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29610 states. [2018-11-07 01:27:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29610 to 29560. [2018-11-07 01:27:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29560 states. [2018-11-07 01:27:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29560 states to 29560 states and 45643 transitions. [2018-11-07 01:27:57,232 INFO L78 Accepts]: Start accepts. Automaton has 29560 states and 45643 transitions. Word has length 285 [2018-11-07 01:27:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:27:57,233 INFO L480 AbstractCegarLoop]: Abstraction has 29560 states and 45643 transitions. [2018-11-07 01:27:57,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 01:27:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 29560 states and 45643 transitions. [2018-11-07 01:27:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 01:27:57,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:27:57,639 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:27:57,640 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:27:57,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:27:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1586453435, now seen corresponding path program 1 times [2018-11-07 01:27:57,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:27:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:57,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:27:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:27:57,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:27:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:27:58,009 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 01:27:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 01:27:58,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 01:27:58,227 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 01:27:58,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 297 with the following transitions: [2018-11-07 01:27:58,231 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [174], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 01:27:58,333 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 01:27:58,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-11-07 01:31:41,284 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-11-07 01:31:41,285 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-11-07 01:31:41,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 01:31:41,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 01:31:41,286 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 01:31:41,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:31:41,297 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 01:31:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:31:41,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 01:31:41,592 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 01:31:41,793 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 01:31:41,794 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 01:31:41,799 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 01:31:41,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:31:41 BoogieIcfgContainer [2018-11-07 01:31:41,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 01:31:41,800 INFO L168 Benchmark]: Toolchain (without parser) took 263763.07 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -686.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 01:31:41,801 INFO L168 Benchmark]: CDTParser took 0.18 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 01:31:41,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1128.43 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 01:31:41,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 214.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -884.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2018-11-07 01:31:41,804 INFO L168 Benchmark]: Boogie Preprocessor took 149.21 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 01:31:41,804 INFO L168 Benchmark]: RCFGBuilder took 4737.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.5 MB). Peak memory consumption was 272.5 MB. Max. memory is 7.1 GB. [2018-11-07 01:31:41,805 INFO L168 Benchmark]: TraceAbstraction took 257528.87 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 1.9 GB in the beginning and 2.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 935.6 MB. Max. memory is 7.1 GB. [2018-11-07 01:31:41,812 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.18 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 1128.43 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 214.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -884.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.21 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 4737.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 272.5 MB). Peak memory consumption was 272.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 257528.87 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 1.9 GB in the beginning and 2.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 935.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1632]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1632). Cancelled while BasicCegarLoop was analyzing trace of length 297 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 10 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 257.4s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 25.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1428 SDtfs, 6171 SDslu, 1264 SDs, 0 SdLazy, 9748 SolverSat, 1708 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29560occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 223.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 742 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1852 NumberOfCodeBlocks, 1852 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1844 ConstructedInterpolants, 0 QuantifiedInterpolants, 2118645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 190/190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown