java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:32:45,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:32:45,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:32:45,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:32:45,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:32:45,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:32:45,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:32:45,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:32:45,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:32:45,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:32:45,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:32:45,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:32:45,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:32:45,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:32:45,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:32:45,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:32:45,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:32:45,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:32:45,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:32:45,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:32:45,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:32:45,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:32:45,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:32:45,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:32:45,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:32:45,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:32:45,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:32:45,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:32:45,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:32:45,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:32:45,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:32:45,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:32:45,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:32:45,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:32:45,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:32:45,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:32:45,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:32:45,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:32:45,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:32:45,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:32:45,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:32:45,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:32:45,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:32:45,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:32:45,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:32:45,259 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:32:45,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:32:45,260 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:32:45,261 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:32:45,261 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:32:45,261 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:32:45,261 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:32:45,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:32:45,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:32:45,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:32:45,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:32:45,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:32:45,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:32:45,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:32:45,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:32:45,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:32:45,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:32:45,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:32:45,266 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:32:45,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:32:45,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:45,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:32:45,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:32:45,267 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:32:45,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:32:45,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:32:45,267 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:32:45,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:32:45,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:32:45,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:32:45,353 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:32:45,354 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:32:45,355 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-10-03 02:32:45,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4e5cff1/d94822ab54554ecbb201c5dbddfebadd/FLAG8c1c3b11a [2019-10-03 02:32:46,032 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:32:46,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-10-03 02:32:46,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4e5cff1/d94822ab54554ecbb201c5dbddfebadd/FLAG8c1c3b11a [2019-10-03 02:32:46,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d4e5cff1/d94822ab54554ecbb201c5dbddfebadd [2019-10-03 02:32:46,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:32:46,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:32:46,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:46,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:32:46,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:32:46,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:46" (1/1) ... [2019-10-03 02:32:46,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34930f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:46, skipping insertion in model container [2019-10-03 02:32:46,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:46" (1/1) ... [2019-10-03 02:32:46,270 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:32:46,362 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:32:46,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:46,986 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:32:47,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:47,219 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:32:47,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47 WrapperNode [2019-10-03 02:32:47,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:47,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:32:47,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:32:47,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:32:47,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:32:47,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:32:47,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:32:47,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:32:47,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (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 [2019-10-03 02:32:47,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:32:47,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:32:47,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:32:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:32:47,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:32:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:32:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:32:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:32:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:32:47,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:32:49,139 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:32:49,140 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:32:49,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:49 BoogieIcfgContainer [2019-10-03 02:32:49,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:32:49,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:32:49,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:32:49,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:32:49,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:32:46" (1/3) ... [2019-10-03 02:32:49,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b85aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:49, skipping insertion in model container [2019-10-03 02:32:49,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (2/3) ... [2019-10-03 02:32:49,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b85aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:49, skipping insertion in model container [2019-10-03 02:32:49,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:49" (3/3) ... [2019-10-03 02:32:49,165 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2019-10-03 02:32:49,176 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:32:49,191 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-03 02:32:49,211 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-03 02:32:49,248 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:32:49,248 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:32:49,249 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:32:49,250 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:32:49,250 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:32:49,250 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:32:49,250 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:32:49,250 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:32:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2019-10-03 02:32:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-03 02:32:49,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:49,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:49,302 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:49,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1490721617, now seen corresponding path program 1 times [2019-10-03 02:32:49,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:49,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:49,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:49,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:49,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:49,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:49,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:49,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:49,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:49,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:49,581 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 4 states. [2019-10-03 02:32:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:50,429 INFO L93 Difference]: Finished difference Result 313 states and 558 transitions. [2019-10-03 02:32:50,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:50,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-03 02:32:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:50,455 INFO L225 Difference]: With dead ends: 313 [2019-10-03 02:32:50,455 INFO L226 Difference]: Without dead ends: 302 [2019-10-03 02:32:50,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-03 02:32:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-10-03 02:32:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-03 02:32:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2019-10-03 02:32:50,530 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2019-10-03 02:32:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:50,530 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2019-10-03 02:32:50,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2019-10-03 02:32:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:32:50,531 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:50,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:50,534 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:50,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267068, now seen corresponding path program 1 times [2019-10-03 02:32:50,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:50,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:50,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:50,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:50,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:50,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:50,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:50,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:50,624 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand 4 states. [2019-10-03 02:32:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:51,073 INFO L93 Difference]: Finished difference Result 307 states and 430 transitions. [2019-10-03 02:32:51,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:51,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-03 02:32:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:51,076 INFO L225 Difference]: With dead ends: 307 [2019-10-03 02:32:51,076 INFO L226 Difference]: Without dead ends: 304 [2019-10-03 02:32:51,077 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-03 02:32:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2019-10-03 02:32:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-03 02:32:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-10-03 02:32:51,095 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2019-10-03 02:32:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:51,096 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-10-03 02:32:51,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-10-03 02:32:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:32:51,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:51,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:51,098 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1016017071, now seen corresponding path program 1 times [2019-10-03 02:32:51,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:51,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:51,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:51,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:51,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:51,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:51,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:51,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:51,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:51,137 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 4 states. [2019-10-03 02:32:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:51,668 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2019-10-03 02:32:51,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:51,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-03 02:32:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:51,671 INFO L225 Difference]: With dead ends: 295 [2019-10-03 02:32:51,671 INFO L226 Difference]: Without dead ends: 295 [2019-10-03 02:32:51,672 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-03 02:32:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-03 02:32:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-03 02:32:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2019-10-03 02:32:51,684 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2019-10-03 02:32:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:51,684 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2019-10-03 02:32:51,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2019-10-03 02:32:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:32:51,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:51,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:51,686 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:51,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1431755048, now seen corresponding path program 1 times [2019-10-03 02:32:51,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:51,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:51,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:51,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:51,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:51,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:51,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:51,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:51,729 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand 4 states. [2019-10-03 02:32:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,092 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2019-10-03 02:32:52,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:52,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-03 02:32:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,096 INFO L225 Difference]: With dead ends: 298 [2019-10-03 02:32:52,096 INFO L226 Difference]: Without dead ends: 298 [2019-10-03 02:32:52,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-03 02:32:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-10-03 02:32:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-03 02:32:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2019-10-03 02:32:52,107 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2019-10-03 02:32:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,107 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2019-10-03 02:32:52,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2019-10-03 02:32:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-03 02:32:52,108 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,109 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1526969604, now seen corresponding path program 1 times [2019-10-03 02:32:52,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:52,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:52,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:52,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:52,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:52,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:52,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,159 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 5 states. [2019-10-03 02:32:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,755 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-10-03 02:32:52,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:52,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-03 02:32:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,758 INFO L225 Difference]: With dead ends: 296 [2019-10-03 02:32:52,759 INFO L226 Difference]: Without dead ends: 296 [2019-10-03 02:32:52,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-03 02:32:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-10-03 02:32:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-03 02:32:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2019-10-03 02:32:52,767 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2019-10-03 02:32:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,768 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2019-10-03 02:32:52,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2019-10-03 02:32:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:32:52,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,769 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash -91414371, now seen corresponding path program 1 times [2019-10-03 02:32:52,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:52,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:52,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:52,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:52,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:52,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:52,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:52,834 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 4 states. [2019-10-03 02:32:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:53,221 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2019-10-03 02:32:53,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:53,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-03 02:32:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:53,230 INFO L225 Difference]: With dead ends: 294 [2019-10-03 02:32:53,231 INFO L226 Difference]: Without dead ends: 292 [2019-10-03 02:32:53,231 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-03 02:32:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-10-03 02:32:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 02:32:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2019-10-03 02:32:53,238 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2019-10-03 02:32:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:53,239 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2019-10-03 02:32:53,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2019-10-03 02:32:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:53,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:53,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:53,242 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash -922816985, now seen corresponding path program 1 times [2019-10-03 02:32:53,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:53,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:53,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:53,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:53,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:53,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:53,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:53,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:53,370 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand 5 states. [2019-10-03 02:32:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:53,997 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2019-10-03 02:32:53,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:53,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:53,999 INFO L225 Difference]: With dead ends: 290 [2019-10-03 02:32:53,999 INFO L226 Difference]: Without dead ends: 290 [2019-10-03 02:32:54,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-03 02:32:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-10-03 02:32:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-03 02:32:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2019-10-03 02:32:54,009 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 17 [2019-10-03 02:32:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:54,009 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2019-10-03 02:32:54,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2019-10-03 02:32:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:54,010 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:54,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:54,011 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:54,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1474389837, now seen corresponding path program 1 times [2019-10-03 02:32:54,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:54,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:54,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:54,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:54,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:54,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:54,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:54,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:54,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:54,058 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand 5 states. [2019-10-03 02:32:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:54,737 INFO L93 Difference]: Finished difference Result 305 states and 370 transitions. [2019-10-03 02:32:54,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:54,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:54,741 INFO L225 Difference]: With dead ends: 305 [2019-10-03 02:32:54,741 INFO L226 Difference]: Without dead ends: 305 [2019-10-03 02:32:54,742 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-03 02:32:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2019-10-03 02:32:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-03 02:32:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2019-10-03 02:32:54,749 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 17 [2019-10-03 02:32:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:54,749 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2019-10-03 02:32:54,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2019-10-03 02:32:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:54,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:54,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:54,757 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:54,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1475929037, now seen corresponding path program 1 times [2019-10-03 02:32:54,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:54,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:54,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:54,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:54,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:54,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:54,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:54,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:54,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:54,848 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand 5 states. [2019-10-03 02:32:55,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:55,406 INFO L93 Difference]: Finished difference Result 286 states and 349 transitions. [2019-10-03 02:32:55,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:55,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:55,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:55,408 INFO L225 Difference]: With dead ends: 286 [2019-10-03 02:32:55,408 INFO L226 Difference]: Without dead ends: 286 [2019-10-03 02:32:55,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-03 02:32:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-10-03 02:32:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-03 02:32:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2019-10-03 02:32:55,416 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 17 [2019-10-03 02:32:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:55,417 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2019-10-03 02:32:55,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2019-10-03 02:32:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:55,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:55,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:55,423 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1537186772, now seen corresponding path program 1 times [2019-10-03 02:32:55,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:55,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:55,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:55,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:55,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:55,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:55,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:55,497 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand 5 states. [2019-10-03 02:32:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:56,101 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2019-10-03 02:32:56,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:56,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:56,105 INFO L225 Difference]: With dead ends: 304 [2019-10-03 02:32:56,105 INFO L226 Difference]: Without dead ends: 304 [2019-10-03 02:32:56,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-03 02:32:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2019-10-03 02:32:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-03 02:32:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-10-03 02:32:56,114 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 18 [2019-10-03 02:32:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:56,114 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-10-03 02:32:56,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-10-03 02:32:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:56,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:56,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:56,116 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:56,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1538552192, now seen corresponding path program 1 times [2019-10-03 02:32:56,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:56,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:56,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:56,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:56,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:56,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:56,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:56,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:56,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:56,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:56,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:56,183 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 5 states. [2019-10-03 02:32:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:56,791 INFO L93 Difference]: Finished difference Result 293 states and 358 transitions. [2019-10-03 02:32:56,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:56,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:56,793 INFO L225 Difference]: With dead ends: 293 [2019-10-03 02:32:56,793 INFO L226 Difference]: Without dead ends: 293 [2019-10-03 02:32:56,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-03 02:32:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2019-10-03 02:32:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-03 02:32:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 342 transitions. [2019-10-03 02:32:56,800 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 342 transitions. Word has length 18 [2019-10-03 02:32:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:56,800 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 342 transitions. [2019-10-03 02:32:56,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 342 transitions. [2019-10-03 02:32:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:56,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:56,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:56,802 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1490836942, now seen corresponding path program 1 times [2019-10-03 02:32:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:56,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:56,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:56,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:56,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:56,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:56,862 INFO L87 Difference]: Start difference. First operand 279 states and 342 transitions. Second operand 5 states. [2019-10-03 02:32:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:57,575 INFO L93 Difference]: Finished difference Result 277 states and 340 transitions. [2019-10-03 02:32:57,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:57,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:57,578 INFO L225 Difference]: With dead ends: 277 [2019-10-03 02:32:57,579 INFO L226 Difference]: Without dead ends: 275 [2019-10-03 02:32:57,579 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-03 02:32:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-10-03 02:32:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-03 02:32:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2019-10-03 02:32:57,588 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 18 [2019-10-03 02:32:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:57,589 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2019-10-03 02:32:57,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2019-10-03 02:32:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:32:57,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:57,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:57,592 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:57,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash -408146528, now seen corresponding path program 1 times [2019-10-03 02:32:57,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:57,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:57,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:57,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:57,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:57,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:57,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:57,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:57,678 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand 5 states. [2019-10-03 02:32:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:58,327 INFO L93 Difference]: Finished difference Result 288 states and 353 transitions. [2019-10-03 02:32:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:58,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-03 02:32:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:58,330 INFO L225 Difference]: With dead ends: 288 [2019-10-03 02:32:58,331 INFO L226 Difference]: Without dead ends: 288 [2019-10-03 02:32:58,331 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-03 02:32:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2019-10-03 02:32:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-10-03 02:32:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 336 transitions. [2019-10-03 02:32:58,342 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 336 transitions. Word has length 19 [2019-10-03 02:32:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:58,342 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 336 transitions. [2019-10-03 02:32:58,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 336 transitions. [2019-10-03 02:32:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:32:58,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:58,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:58,344 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1079809725, now seen corresponding path program 1 times [2019-10-03 02:32:58,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:58,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:58,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:58,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:58,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:32:58,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:58,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:58,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:58,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:58,397 INFO L87 Difference]: Start difference. First operand 273 states and 336 transitions. Second operand 6 states. [2019-10-03 02:32:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:59,063 INFO L93 Difference]: Finished difference Result 286 states and 351 transitions. [2019-10-03 02:32:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:59,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-03 02:32:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:59,066 INFO L225 Difference]: With dead ends: 286 [2019-10-03 02:32:59,067 INFO L226 Difference]: Without dead ends: 286 [2019-10-03 02:32:59,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-03 02:32:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 271. [2019-10-03 02:32:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-03 02:32:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2019-10-03 02:32:59,074 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 20 [2019-10-03 02:32:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:59,074 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2019-10-03 02:32:59,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2019-10-03 02:32:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:32:59,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:59,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:59,076 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash 885640025, now seen corresponding path program 1 times [2019-10-03 02:32:59,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:59,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:59,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:59,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:59,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:59,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:59,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:59,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:59,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:59,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:59,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:59,111 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 4 states. [2019-10-03 02:32:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:59,458 INFO L93 Difference]: Finished difference Result 272 states and 335 transitions. [2019-10-03 02:32:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:59,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-03 02:32:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:59,461 INFO L225 Difference]: With dead ends: 272 [2019-10-03 02:32:59,461 INFO L226 Difference]: Without dead ends: 254 [2019-10-03 02:32:59,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-03 02:32:59,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-10-03 02:32:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-03 02:32:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-10-03 02:32:59,467 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 21 [2019-10-03 02:32:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:59,468 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-10-03 02:32:59,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-10-03 02:32:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-03 02:32:59,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:59,474 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:59,475 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:59,475 INFO L82 PathProgramCache]: Analyzing trace with hash 317164964, now seen corresponding path program 1 times [2019-10-03 02:32:59,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:59,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:59,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:59,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:01,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:01,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-10-03 02:33:01,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:01,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-03 02:33:01,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-03 02:33:01,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-10-03 02:33:01,590 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 63 states. [2019-10-03 02:33:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:03,187 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-10-03 02:33:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-03 02:33:03,188 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-10-03 02:33:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:03,191 INFO L225 Difference]: With dead ends: 253 [2019-10-03 02:33:03,191 INFO L226 Difference]: Without dead ends: 253 [2019-10-03 02:33:03,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2019-10-03 02:33:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-03 02:33:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-10-03 02:33:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-03 02:33:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-10-03 02:33:03,198 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2019-10-03 02:33:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:03,198 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-10-03 02:33:03,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-03 02:33:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-10-03 02:33:03,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-03 02:33:03,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:03,202 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:03,202 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:03,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1242183539, now seen corresponding path program 1 times [2019-10-03 02:33:03,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:03,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:03,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:03,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:03,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:04,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:04,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:33:04,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:04,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:33:04,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:33:04,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:33:04,596 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 5 states. [2019-10-03 02:33:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:05,081 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-10-03 02:33:05,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:33:05,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-10-03 02:33:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:05,083 INFO L225 Difference]: With dead ends: 252 [2019-10-03 02:33:05,083 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:33:05,083 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 3 SyntacticMatches, 176 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:33:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:33:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:33:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:33:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:33:05,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2019-10-03 02:33:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:05,085 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:33:05,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:33:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:33:05,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:33:05,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:33:05 BoogieIcfgContainer [2019-10-03 02:33:05,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:33:05,092 INFO L168 Benchmark]: Toolchain (without parser) took 18841.35 ms. Allocated memory was 136.3 MB in the beginning and 537.4 MB in the end (delta: 401.1 MB). Free memory was 83.7 MB in the beginning and 282.6 MB in the end (delta: -198.9 MB). Peak memory consumption was 202.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:05,093 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory was 103.5 MB in the beginning and 103.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:33:05,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 967.68 ms. Allocated memory was 136.3 MB in the beginning and 196.6 MB in the end (delta: 60.3 MB). Free memory was 83.5 MB in the beginning and 151.0 MB in the end (delta: -67.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:05,095 INFO L168 Benchmark]: Boogie Preprocessor took 129.40 ms. Allocated memory is still 196.6 MB. Free memory was 151.0 MB in the beginning and 145.5 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:05,096 INFO L168 Benchmark]: RCFGBuilder took 1792.63 ms. Allocated memory was 196.6 MB in the beginning and 216.0 MB in the end (delta: 19.4 MB). Free memory was 145.5 MB in the beginning and 88.9 MB in the end (delta: 56.6 MB). Peak memory consumption was 85.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:05,097 INFO L168 Benchmark]: TraceAbstraction took 15945.43 ms. Allocated memory was 216.0 MB in the beginning and 537.4 MB in the end (delta: 321.4 MB). Free memory was 88.9 MB in the beginning and 282.6 MB in the end (delta: -193.7 MB). Peak memory consumption was 127.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:05,101 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory was 103.5 MB in the beginning and 103.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 967.68 ms. Allocated memory was 136.3 MB in the beginning and 196.6 MB in the end (delta: 60.3 MB). Free memory was 83.5 MB in the beginning and 151.0 MB in the end (delta: -67.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.40 ms. Allocated memory is still 196.6 MB. Free memory was 151.0 MB in the beginning and 145.5 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1792.63 ms. Allocated memory was 196.6 MB in the beginning and 216.0 MB in the end (delta: 19.4 MB). Free memory was 145.5 MB in the beginning and 88.9 MB in the end (delta: 56.6 MB). Peak memory consumption was 85.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15945.43 ms. Allocated memory was 216.0 MB in the beginning and 537.4 MB in the end (delta: 321.4 MB). Free memory was 88.9 MB in the beginning and 282.6 MB in the end (delta: -193.7 MB). Peak memory consumption was 127.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2611]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 309 locations, 16 error locations. SAFE Result, 15.8s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2623 SDtfs, 11666 SDslu, 2920 SDs, 0 SdLazy, 8447 SolverSat, 3227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 40 SyntacticMatches, 181 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 589544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...