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-0883e75 [2019-09-05 13:01:07,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:01:07,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:01:07,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:01:07,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:01:07,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:01:07,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:01:07,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:01:07,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:01:07,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:01:07,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:01:07,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:01:07,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:01:07,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:01:07,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:01:07,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:01:07,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:01:07,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:01:07,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:01:07,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:01:07,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:01:07,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:01:07,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:01:07,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:01:07,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:01:07,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:01:07,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:01:07,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:01:07,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:01:07,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:01:07,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:01:07,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:01:07,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:01:07,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:01:07,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:01:07,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:01:07,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:01:07,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:01:07,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:01:07,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:01:07,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:01:07,323 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-09-05 13:01:07,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:01:07,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:01:07,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:01:07,362 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:01:07,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:01:07,362 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:01:07,363 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:01:07,363 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:01:07,363 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:01:07,363 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:01:07,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:01:07,364 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:01:07,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:01:07,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:01:07,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:01:07,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:01:07,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:01:07,369 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:01:07,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:01:07,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:01:07,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:01:07,370 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:01:07,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:01:07,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:01:07,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:01:07,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:01:07,371 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:01:07,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:01:07,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:01:07,372 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:01:07,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:01:07,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:01:07,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:01:07,440 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:01:07,441 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:01:07,442 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-09-05 13:01:07,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbe6d91c/c3b4fea0ff934146a71e1458ca19ce8e/FLAGf4af6fd90 [2019-09-05 13:01:07,980 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:01:07,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-09-05 13:01:08,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbe6d91c/c3b4fea0ff934146a71e1458ca19ce8e/FLAGf4af6fd90 [2019-09-05 13:01:08,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fbe6d91c/c3b4fea0ff934146a71e1458ca19ce8e [2019-09-05 13:01:08,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:01:08,286 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:01:08,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:08,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:01:08,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:01:08,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:08" (1/1) ... [2019-09-05 13:01:08,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c68dd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:08, skipping insertion in model container [2019-09-05 13:01:08,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:08" (1/1) ... [2019-09-05 13:01:08,305 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:01:08,398 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:01:09,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:09,035 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:01:09,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:09,376 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:01:09,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09 WrapperNode [2019-09-05 13:01:09,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:09,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:01:09,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:01:09,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:01:09,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:01:09,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:01:09,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:01:09,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:01:09,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (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-09-05 13:01:09,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:01:09,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:01:09,583 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:01:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:01:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:01:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:01:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:01:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:01:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:01:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:01:11,096 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:01:11,096 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 13:01:11,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:11 BoogieIcfgContainer [2019-09-05 13:01:11,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:01:11,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:01:11,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:01:11,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:01:11,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:01:08" (1/3) ... [2019-09-05 13:01:11,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ffa6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:11, skipping insertion in model container [2019-09-05 13:01:11,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (2/3) ... [2019-09-05 13:01:11,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ffa6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:11, skipping insertion in model container [2019-09-05 13:01:11,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:11" (3/3) ... [2019-09-05 13:01:11,104 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2019-09-05 13:01:11,112 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:01:11,119 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-05 13:01:11,133 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-05 13:01:11,159 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:01:11,159 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:01:11,160 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:01:11,160 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:01:11,160 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:01:11,160 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:01:11,160 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:01:11,160 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:01:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2019-09-05 13:01:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 13:01:11,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,195 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1490721617, now seen corresponding path program 1 times [2019-09-05 13:01:11,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:11,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:11,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:11,383 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 4 states. [2019-09-05 13:01:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,206 INFO L93 Difference]: Finished difference Result 313 states and 558 transitions. [2019-09-05 13:01:12,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:12,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-05 13:01:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,223 INFO L225 Difference]: With dead ends: 313 [2019-09-05 13:01:12,223 INFO L226 Difference]: Without dead ends: 302 [2019-09-05 13:01:12,225 INFO L628 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-09-05 13:01:12,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-05 13:01:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-09-05 13:01:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-05 13:01:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2019-09-05 13:01:12,288 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2019-09-05 13:01:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,289 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2019-09-05 13:01:12,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2019-09-05 13:01:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:01:12,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,290 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,291 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267068, now seen corresponding path program 1 times [2019-09-05 13:01:12,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:12,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:12,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:12,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:12,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:12,367 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand 4 states. [2019-09-05 13:01:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,777 INFO L93 Difference]: Finished difference Result 307 states and 430 transitions. [2019-09-05 13:01:12,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:12,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 13:01:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,781 INFO L225 Difference]: With dead ends: 307 [2019-09-05 13:01:12,781 INFO L226 Difference]: Without dead ends: 304 [2019-09-05 13:01:12,782 INFO L628 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-09-05 13:01:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-05 13:01:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2019-09-05 13:01:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-05 13:01:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-09-05 13:01:12,801 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2019-09-05 13:01:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,801 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-09-05 13:01:12,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-09-05 13:01:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:01:12,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,803 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1016017071, now seen corresponding path program 1 times [2019-09-05 13:01:12,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:12,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:12,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:12,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:12,871 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 4 states. [2019-09-05 13:01:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:13,363 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2019-09-05 13:01:13,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:13,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 13:01:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:13,366 INFO L225 Difference]: With dead ends: 295 [2019-09-05 13:01:13,366 INFO L226 Difference]: Without dead ends: 295 [2019-09-05 13:01:13,367 INFO L628 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-09-05 13:01:13,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-05 13:01:13,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-09-05 13:01:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-05 13:01:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2019-09-05 13:01:13,379 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2019-09-05 13:01:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:13,380 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2019-09-05 13:01:13,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2019-09-05 13:01:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 13:01:13,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:13,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:13,381 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:13,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:13,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1431755048, now seen corresponding path program 1 times [2019-09-05 13:01:13,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:13,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:13,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:13,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:13,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:13,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:13,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:13,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:13,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:13,423 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand 4 states. [2019-09-05 13:01:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:13,770 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2019-09-05 13:01:13,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:13,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-05 13:01:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:13,774 INFO L225 Difference]: With dead ends: 298 [2019-09-05 13:01:13,774 INFO L226 Difference]: Without dead ends: 298 [2019-09-05 13:01:13,774 INFO L628 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-09-05 13:01:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-05 13:01:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-05 13:01:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-05 13:01:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2019-09-05 13:01:13,784 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2019-09-05 13:01:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:13,785 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2019-09-05 13:01:13,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2019-09-05 13:01:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 13:01:13,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:13,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:13,787 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:13,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1526969604, now seen corresponding path program 1 times [2019-09-05 13:01:13,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:13,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:13,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:13,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:13,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:13,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:13,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:13,833 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 5 states. [2019-09-05 13:01:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:14,354 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-09-05 13:01:14,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:14,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 13:01:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:14,356 INFO L225 Difference]: With dead ends: 296 [2019-09-05 13:01:14,357 INFO L226 Difference]: Without dead ends: 296 [2019-09-05 13:01:14,357 INFO L628 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-09-05 13:01:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-05 13:01:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-05 13:01:14,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-05 13:01:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2019-09-05 13:01:14,365 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2019-09-05 13:01:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:14,365 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2019-09-05 13:01:14,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2019-09-05 13:01:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:01:14,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:14,366 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:14,367 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:14,367 INFO L82 PathProgramCache]: Analyzing trace with hash -91414371, now seen corresponding path program 1 times [2019-09-05 13:01:14,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:14,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:14,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:14,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:14,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:14,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:14,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:14,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:14,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:14,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:14,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:14,427 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 4 states. [2019-09-05 13:01:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:14,729 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2019-09-05 13:01:14,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:14,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-05 13:01:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:14,731 INFO L225 Difference]: With dead ends: 294 [2019-09-05 13:01:14,731 INFO L226 Difference]: Without dead ends: 292 [2019-09-05 13:01:14,732 INFO L628 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-09-05 13:01:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-05 13:01:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-09-05 13:01:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-05 13:01:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2019-09-05 13:01:14,739 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2019-09-05 13:01:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:14,739 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2019-09-05 13:01:14,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2019-09-05 13:01:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:01:14,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:14,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:14,741 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash -922816985, now seen corresponding path program 1 times [2019-09-05 13:01:14,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:14,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:14,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:14,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:14,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:14,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:14,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:14,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:14,856 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand 5 states. [2019-09-05 13:01:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:15,448 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2019-09-05 13:01:15,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:15,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 13:01:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:15,452 INFO L225 Difference]: With dead ends: 290 [2019-09-05 13:01:15,452 INFO L226 Difference]: Without dead ends: 290 [2019-09-05 13:01:15,453 INFO L628 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-09-05 13:01:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-05 13:01:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-09-05 13:01:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-05 13:01:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2019-09-05 13:01:15,460 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 17 [2019-09-05 13:01:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:15,461 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2019-09-05 13:01:15,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:15,461 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2019-09-05 13:01:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:01:15,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:15,462 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:15,463 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:15,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:15,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1474389837, now seen corresponding path program 1 times [2019-09-05 13:01:15,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:15,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:15,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:15,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:15,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:15,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:15,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:15,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:15,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:15,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:15,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:15,504 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand 5 states. [2019-09-05 13:01:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:16,063 INFO L93 Difference]: Finished difference Result 305 states and 370 transitions. [2019-09-05 13:01:16,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:16,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 13:01:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:16,066 INFO L225 Difference]: With dead ends: 305 [2019-09-05 13:01:16,066 INFO L226 Difference]: Without dead ends: 305 [2019-09-05 13:01:16,067 INFO L628 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-09-05 13:01:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-05 13:01:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2019-09-05 13:01:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-05 13:01:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2019-09-05 13:01:16,073 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 17 [2019-09-05 13:01:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:16,074 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2019-09-05 13:01:16,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2019-09-05 13:01:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:01:16,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:16,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:16,076 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1475929037, now seen corresponding path program 1 times [2019-09-05 13:01:16,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:16,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:16,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:16,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:16,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:16,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:16,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:16,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:16,111 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand 5 states. [2019-09-05 13:01:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:16,649 INFO L93 Difference]: Finished difference Result 286 states and 349 transitions. [2019-09-05 13:01:16,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:16,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 13:01:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:16,652 INFO L225 Difference]: With dead ends: 286 [2019-09-05 13:01:16,652 INFO L226 Difference]: Without dead ends: 286 [2019-09-05 13:01:16,653 INFO L628 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-09-05 13:01:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-05 13:01:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-09-05 13:01:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-05 13:01:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2019-09-05 13:01:16,660 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 17 [2019-09-05 13:01:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:16,660 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2019-09-05 13:01:16,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2019-09-05 13:01:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:16,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:16,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:16,662 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:16,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:16,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1537186772, now seen corresponding path program 1 times [2019-09-05 13:01:16,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:16,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:16,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:16,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:16,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:16,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:16,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:16,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:16,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:16,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:16,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:16,712 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand 5 states. [2019-09-05 13:01:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:17,248 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2019-09-05 13:01:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:17,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:17,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:17,250 INFO L225 Difference]: With dead ends: 304 [2019-09-05 13:01:17,250 INFO L226 Difference]: Without dead ends: 304 [2019-09-05 13:01:17,251 INFO L628 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-09-05 13:01:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-05 13:01:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2019-09-05 13:01:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-05 13:01:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-09-05 13:01:17,257 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 18 [2019-09-05 13:01:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:17,258 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-09-05 13:01:17,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-09-05 13:01:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:17,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:17,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:17,259 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:17,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1538552192, now seen corresponding path program 1 times [2019-09-05 13:01:17,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:17,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:17,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:17,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:17,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:17,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:17,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:17,309 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 5 states. [2019-09-05 13:01:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:18,019 INFO L93 Difference]: Finished difference Result 293 states and 358 transitions. [2019-09-05 13:01:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:18,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:18,022 INFO L225 Difference]: With dead ends: 293 [2019-09-05 13:01:18,023 INFO L226 Difference]: Without dead ends: 293 [2019-09-05 13:01:18,023 INFO L628 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-09-05 13:01:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-05 13:01:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2019-09-05 13:01:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-05 13:01:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 342 transitions. [2019-09-05 13:01:18,033 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 342 transitions. Word has length 18 [2019-09-05 13:01:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:18,034 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 342 transitions. [2019-09-05 13:01:18,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 342 transitions. [2019-09-05 13:01:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:18,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:18,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:18,037 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1490836942, now seen corresponding path program 1 times [2019-09-05 13:01:18,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:18,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:18,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:18,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:18,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:18,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:18,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:18,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:18,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:18,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:18,181 INFO L87 Difference]: Start difference. First operand 279 states and 342 transitions. Second operand 5 states. [2019-09-05 13:01:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:18,903 INFO L93 Difference]: Finished difference Result 277 states and 340 transitions. [2019-09-05 13:01:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:18,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:18,905 INFO L225 Difference]: With dead ends: 277 [2019-09-05 13:01:18,906 INFO L226 Difference]: Without dead ends: 275 [2019-09-05 13:01:18,906 INFO L628 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-09-05 13:01:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-05 13:01:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-09-05 13:01:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-05 13:01:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2019-09-05 13:01:18,913 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 18 [2019-09-05 13:01:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:18,913 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2019-09-05 13:01:18,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2019-09-05 13:01:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 13:01:18,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:18,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:18,915 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash -408146528, now seen corresponding path program 1 times [2019-09-05 13:01:18,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:18,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:18,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:18,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:18,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:18,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:18,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:18,972 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand 5 states. [2019-09-05 13:01:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:19,612 INFO L93 Difference]: Finished difference Result 288 states and 353 transitions. [2019-09-05 13:01:19,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:19,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-05 13:01:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:19,615 INFO L225 Difference]: With dead ends: 288 [2019-09-05 13:01:19,615 INFO L226 Difference]: Without dead ends: 288 [2019-09-05 13:01:19,616 INFO L628 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-09-05 13:01:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-05 13:01:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2019-09-05 13:01:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-05 13:01:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 336 transitions. [2019-09-05 13:01:19,626 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 336 transitions. Word has length 19 [2019-09-05 13:01:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:19,626 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 336 transitions. [2019-09-05 13:01:19,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 336 transitions. [2019-09-05 13:01:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 13:01:19,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:19,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:19,631 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:19,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1079809725, now seen corresponding path program 1 times [2019-09-05 13:01:19,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:19,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:19,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:19,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:19,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:19,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:19,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:19,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:19,712 INFO L87 Difference]: Start difference. First operand 273 states and 336 transitions. Second operand 4 states. [2019-09-05 13:01:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:19,987 INFO L93 Difference]: Finished difference Result 271 states and 334 transitions. [2019-09-05 13:01:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:19,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-05 13:01:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:19,989 INFO L225 Difference]: With dead ends: 271 [2019-09-05 13:01:19,989 INFO L226 Difference]: Without dead ends: 271 [2019-09-05 13:01:19,989 INFO L628 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-09-05 13:01:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-05 13:01:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-09-05 13:01:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-05 13:01:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2019-09-05 13:01:19,997 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 20 [2019-09-05 13:01:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:19,997 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2019-09-05 13:01:19,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2019-09-05 13:01:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 13:01:19,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:19,999 INFO L399 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-09-05 13:01:19,999 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:20,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash 885640025, now seen corresponding path program 1 times [2019-09-05 13:01:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:20,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:20,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:20,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:20,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:20,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:20,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:20,039 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 4 states. [2019-09-05 13:01:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:20,361 INFO L93 Difference]: Finished difference Result 272 states and 335 transitions. [2019-09-05 13:01:20,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:20,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-05 13:01:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:20,363 INFO L225 Difference]: With dead ends: 272 [2019-09-05 13:01:20,363 INFO L226 Difference]: Without dead ends: 254 [2019-09-05 13:01:20,363 INFO L628 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-09-05 13:01:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-05 13:01:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-09-05 13:01:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-05 13:01:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-09-05 13:01:20,371 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 21 [2019-09-05 13:01:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:20,372 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-09-05 13:01:20,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-09-05 13:01:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-05 13:01:20,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:20,379 INFO L399 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-09-05 13:01:20,385 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:20,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:20,386 INFO L82 PathProgramCache]: Analyzing trace with hash 317164964, now seen corresponding path program 1 times [2019-09-05 13:01:20,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:20,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:20,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:22,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:22,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-05 13:01:22,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:22,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 13:01:22,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 13:01:22,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 13:01:22,624 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 63 states. [2019-09-05 13:01:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:23,798 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-09-05 13:01:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 13:01:23,799 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-05 13:01:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:23,802 INFO L225 Difference]: With dead ends: 253 [2019-09-05 13:01:23,802 INFO L226 Difference]: Without dead ends: 253 [2019-09-05 13:01:23,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 13:01:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-05 13:01:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-09-05 13:01:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-05 13:01:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-09-05 13:01:23,809 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2019-09-05 13:01:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:23,809 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-09-05 13:01:23,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 13:01:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-09-05 13:01:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-05 13:01:23,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:23,813 INFO L399 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-09-05 13:01:23,813 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1242183539, now seen corresponding path program 1 times [2019-09-05 13:01:23,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:23,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:23,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:23,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:23,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:24,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:24,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:24,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:24,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:24,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:24,965 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 5 states. [2019-09-05 13:01:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:25,476 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-09-05 13:01:25,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:25,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-09-05 13:01:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:25,478 INFO L225 Difference]: With dead ends: 252 [2019-09-05 13:01:25,478 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:01:25,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 5 SyntacticMatches, 174 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:01:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:01:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:01:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:01:25,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2019-09-05 13:01:25,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:25,480 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:01:25,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:01:25,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:01:25,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:01:25 BoogieIcfgContainer [2019-09-05 13:01:25,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:01:25,487 INFO L168 Benchmark]: Toolchain (without parser) took 17200.83 ms. Allocated memory was 138.9 MB in the beginning and 480.2 MB in the end (delta: 341.3 MB). Free memory was 85.0 MB in the beginning and 90.7 MB in the end (delta: -5.7 MB). Peak memory consumption was 335.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:25,488 INFO L168 Benchmark]: CDTParser took 1.08 ms. Allocated memory is still 138.9 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 13:01:25,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1087.27 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 84.8 MB in the beginning and 152.9 MB in the end (delta: -68.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:25,490 INFO L168 Benchmark]: Boogie Preprocessor took 137.08 ms. Allocated memory is still 198.7 MB. Free memory was 152.9 MB in the beginning and 147.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:25,491 INFO L168 Benchmark]: RCFGBuilder took 1582.73 ms. Allocated memory was 198.7 MB in the beginning and 221.8 MB in the end (delta: 23.1 MB). Free memory was 147.5 MB in the beginning and 97.0 MB in the end (delta: 50.5 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:25,491 INFO L168 Benchmark]: TraceAbstraction took 14386.32 ms. Allocated memory was 221.8 MB in the beginning and 480.2 MB in the end (delta: 258.5 MB). Free memory was 97.0 MB in the beginning and 90.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 264.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:25,495 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08 ms. Allocated memory is still 138.9 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1087.27 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 84.8 MB in the beginning and 152.9 MB in the end (delta: -68.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.08 ms. Allocated memory is still 198.7 MB. Free memory was 152.9 MB in the beginning and 147.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1582.73 ms. Allocated memory was 198.7 MB in the beginning and 221.8 MB in the end (delta: 23.1 MB). Free memory was 147.5 MB in the beginning and 97.0 MB in the end (delta: 50.5 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14386.32 ms. Allocated memory was 221.8 MB in the beginning and 480.2 MB in the end (delta: 258.5 MB). Free memory was 97.0 MB in the beginning and 90.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 264.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 71]: 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: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: 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: 250]: 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: 214]: 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: 2611]: 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: 100]: 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: 2599]: 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, 14.3s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 9.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2745 SDtfs, 9352 SDslu, 3041 SDs, 0 SdLazy, 8200 SolverSat, 2430 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 42 SyntacticMatches, 179 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.4s 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, 86 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 589126 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...