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+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:01:07,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:01:07,249 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,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:01:07,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:01:07,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:01:07,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:01:07,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:01:07,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:01:07,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:01:07,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:01:07,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:01:07,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:01:07,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:01:07,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:01:07,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:01:07,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:01:07,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:01:07,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:01:07,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:01:07,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:01:07,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:01:07,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:01:07,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:01:07,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:01:07,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:01:07,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:01:07,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:01:07,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:01:07,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:01:07,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:01:07,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:01:07,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:01:07,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:01:07,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:01:07,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:01:07,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:01:07,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:01:07,298 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,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:01:07,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:01:07,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:01:07,314 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:01:07,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:01:07,315 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:01:07,315 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:01:07,315 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:01:07,315 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:01:07,315 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:01:07,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:01:07,316 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:01:07,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:01:07,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:01:07,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:01:07,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:01:07,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:01:07,317 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:01:07,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:01:07,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:01:07,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:01:07,318 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:01:07,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:01:07,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:01:07,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:01:07,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:01:07,319 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:01:07,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:01:07,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:01:07,320 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:01:07,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:01:07,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:01:07,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:01:07,372 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:01:07,374 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:01:07,375 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+sep-reducer.c [2019-09-05 13:01:07,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bd0890d4/55d3704d515a48859c0577fb358b6ecf/FLAG1ba856eb2 [2019-09-05 13:01:08,101 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:01:08,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-09-05 13:01:08,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bd0890d4/55d3704d515a48859c0577fb358b6ecf/FLAG1ba856eb2 [2019-09-05 13:01:08,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bd0890d4/55d3704d515a48859c0577fb358b6ecf [2019-09-05 13:01:08,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:01:08,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:01:08,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:08,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:01:08,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:01:08,329 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,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e44029f 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,332 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,340 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:01:08,446 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:01:09,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:09,320 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:01:09,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:09,614 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:01:09,615 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,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:09,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:01:09,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:01:09,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:01:09,632 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,633 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,664 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,665 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,731 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,756 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,766 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,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:01:09,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:01:09,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:01:09,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:01:09,785 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,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:01:09,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:01:09,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:01:09,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:01:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:01:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:01:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:01:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:01:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:01:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:01:12,384 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:01:12,384 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 13:01:12,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:12 BoogieIcfgContainer [2019-09-05 13:01:12,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:01:12,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:01:12,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:01:12,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:01:12,391 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:12,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37af6ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:12, skipping insertion in model container [2019-09-05 13:01:12,392 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:12,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37af6ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:12, skipping insertion in model container [2019-09-05 13:01:12,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:12" (3/3) ... [2019-09-05 13:01:12,395 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-09-05 13:01:12,403 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:01:12,411 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-05 13:01:12,428 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-05 13:01:12,457 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:01:12,457 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:01:12,457 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:01:12,457 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:01:12,457 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:01:12,458 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:01:12,458 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:01:12,458 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:01:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2019-09-05 13:01:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 13:01:12,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,502 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1514750688, now seen corresponding path program 1 times [2019-09-05 13:01:12,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,725 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,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:12,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:12,754 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 4 states. [2019-09-05 13:01:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:14,143 INFO L93 Difference]: Finished difference Result 484 states and 894 transitions. [2019-09-05 13:01:14,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:14,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-05 13:01:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:14,161 INFO L225 Difference]: With dead ends: 484 [2019-09-05 13:01:14,161 INFO L226 Difference]: Without dead ends: 301 [2019-09-05 13:01:14,163 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,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-05 13:01:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-09-05 13:01:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-05 13:01:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2019-09-05 13:01:14,225 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 11 [2019-09-05 13:01:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:14,225 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2019-09-05 13:01:14,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2019-09-05 13:01:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:01:14,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:14,226 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:14,227 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:14,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash 287371989, now seen corresponding path program 1 times [2019-09-05 13:01:14,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:14,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:14,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:14,285 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,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:14,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:14,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:14,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:14,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:14,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:14,289 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand 4 states. [2019-09-05 13:01:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:14,739 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2019-09-05 13:01:14,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:14,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 13:01:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:14,743 INFO L225 Difference]: With dead ends: 299 [2019-09-05 13:01:14,744 INFO L226 Difference]: Without dead ends: 296 [2019-09-05 13:01:14,744 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,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-05 13:01:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-05 13:01:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-05 13:01:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2019-09-05 13:01:14,762 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 12 [2019-09-05 13:01:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:14,762 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2019-09-05 13:01:14,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2019-09-05 13:01:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-05 13:01:14,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:14,772 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:14,772 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:14,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1097283636, now seen corresponding path program 1 times [2019-09-05 13:01:14,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:14,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:14,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:14,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:14,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:17,436 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,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:17,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-05 13:01:17,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:17,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 13:01:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 13:01:17,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 13:01:17,442 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 63 states. [2019-09-05 13:01:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:18,730 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-09-05 13:01:18,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-05 13:01:18,731 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-05 13:01:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:18,737 INFO L225 Difference]: With dead ends: 295 [2019-09-05 13:01:18,738 INFO L226 Difference]: Without dead ends: 295 [2019-09-05 13:01:18,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-09-05 13:01:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-05 13:01:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-09-05 13:01:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-05 13:01:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2019-09-05 13:01:18,772 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 248 [2019-09-05 13:01:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:18,773 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2019-09-05 13:01:18,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 13:01:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2019-09-05 13:01:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-05 13:01:18,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:18,784 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:18,785 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash -343940819, now seen corresponding path program 1 times [2019-09-05 13:01:18,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:18,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:18,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:18,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:18,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:19,978 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,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:19,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:19,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:19,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:19,982 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand 6 states. [2019-09-05 13:01:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:20,601 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2019-09-05 13:01:20,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:20,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-05 13:01:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:20,606 INFO L225 Difference]: With dead ends: 294 [2019-09-05 13:01:20,606 INFO L226 Difference]: Without dead ends: 294 [2019-09-05 13:01:20,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 119 SyntacticMatches, 59 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-05 13:01:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-09-05 13:01:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-05 13:01:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-09-05 13:01:20,625 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 249 [2019-09-05 13:01:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:20,626 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-09-05 13:01:20,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-09-05 13:01:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-05 13:01:20,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:20,637 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, 1, 1, 1] [2019-09-05 13:01:20,638 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1455800989, now seen corresponding path program 1 times [2019-09-05 13:01:20,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:20,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:20,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:20,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:20,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:23,016 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:23,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:23,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-05 13:01:23,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:23,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-05 13:01:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-05 13:01:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 13:01:23,022 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 65 states. [2019-09-05 13:01:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:24,855 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2019-09-05 13:01:24,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 13:01:24,856 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-05 13:01:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:24,860 INFO L225 Difference]: With dead ends: 293 [2019-09-05 13:01:24,860 INFO L226 Difference]: Without dead ends: 293 [2019-09-05 13:01:24,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 13:01:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-05 13:01:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-09-05 13:01:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-05 13:01:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-09-05 13:01:24,868 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 252 [2019-09-05 13:01:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:24,869 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-09-05 13:01:24,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-05 13:01:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-09-05 13:01:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-05 13:01:24,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:24,873 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, 1, 1, 1, 1] [2019-09-05 13:01:24,874 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:24,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:24,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2114804744, now seen corresponding path program 1 times [2019-09-05 13:01:24,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:24,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:24,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:24,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:24,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:25,751 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:25,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:25,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:25,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:25,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:25,753 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 6 states. [2019-09-05 13:01:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:26,412 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2019-09-05 13:01:26,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:26,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-05 13:01:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:26,420 INFO L225 Difference]: With dead ends: 288 [2019-09-05 13:01:26,421 INFO L226 Difference]: Without dead ends: 288 [2019-09-05 13:01:26,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 121 SyntacticMatches, 60 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-05 13:01:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-05 13:01:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-05 13:01:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-09-05 13:01:26,428 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 253 [2019-09-05 13:01:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:26,429 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-09-05 13:01:26,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-09-05 13:01:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-05 13:01:26,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:26,431 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, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:26,431 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -807674468, now seen corresponding path program 1 times [2019-09-05 13:01:26,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:26,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:26,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:26,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:26,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:26,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:26,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:26,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:26,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:26,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:26,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:26,833 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 5 states. [2019-09-05 13:01:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:27,169 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-09-05 13:01:27,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:27,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2019-09-05 13:01:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:27,171 INFO L225 Difference]: With dead ends: 286 [2019-09-05 13:01:27,172 INFO L226 Difference]: Without dead ends: 286 [2019-09-05 13:01:27,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-05 13:01:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-09-05 13:01:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-05 13:01:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-09-05 13:01:27,180 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 255 [2019-09-05 13:01:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:27,180 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-09-05 13:01:27,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-09-05 13:01:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-05 13:01:27,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:27,182 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:27,183 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash 731900137, now seen corresponding path program 1 times [2019-09-05 13:01:27,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:27,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:27,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:27,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:27,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:27,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:27,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:27,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:27,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:27,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:27,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:27,359 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 4 states. [2019-09-05 13:01:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:27,659 INFO L93 Difference]: Finished difference Result 284 states and 287 transitions. [2019-09-05 13:01:27,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:27,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-05 13:01:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:27,662 INFO L225 Difference]: With dead ends: 284 [2019-09-05 13:01:27,662 INFO L226 Difference]: Without dead ends: 282 [2019-09-05 13:01:27,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-05 13:01:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-05 13:01:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-05 13:01:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-09-05 13:01:27,668 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 256 [2019-09-05 13:01:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:27,668 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-09-05 13:01:27,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-09-05 13:01:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-05 13:01:27,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:27,670 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:27,671 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1228876781, now seen corresponding path program 1 times [2019-09-05 13:01:27,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:27,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:27,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:27,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:30,124 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:30,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:30,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-09-05 13:01:30,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:30,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-05 13:01:30,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-05 13:01:30,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 13:01:30,128 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 66 states. [2019-09-05 13:01:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:31,837 INFO L93 Difference]: Finished difference Result 290 states and 294 transitions. [2019-09-05 13:01:31,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-05 13:01:31,837 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 257 [2019-09-05 13:01:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:31,841 INFO L225 Difference]: With dead ends: 290 [2019-09-05 13:01:31,841 INFO L226 Difference]: Without dead ends: 290 [2019-09-05 13:01:31,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 13:01:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-05 13:01:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2019-09-05 13:01:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-05 13:01:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 283 transitions. [2019-09-05 13:01:31,849 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 283 transitions. Word has length 257 [2019-09-05 13:01:31,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:31,850 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 283 transitions. [2019-09-05 13:01:31,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-05 13:01:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 283 transitions. [2019-09-05 13:01:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-05 13:01:31,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:31,852 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:31,853 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1227337581, now seen corresponding path program 1 times [2019-09-05 13:01:31,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:31,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:31,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:33,906 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:33,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:33,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-05 13:01:33,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:33,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-05 13:01:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-05 13:01:33,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 13:01:33,910 INFO L87 Difference]: Start difference. First operand 280 states and 283 transitions. Second operand 65 states. [2019-09-05 13:01:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:35,628 INFO L93 Difference]: Finished difference Result 296 states and 301 transitions. [2019-09-05 13:01:35,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 13:01:35,629 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-09-05 13:01:35,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:35,631 INFO L225 Difference]: With dead ends: 296 [2019-09-05 13:01:35,632 INFO L226 Difference]: Without dead ends: 296 [2019-09-05 13:01:35,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 13:01:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-05 13:01:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2019-09-05 13:01:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-05 13:01:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-09-05 13:01:35,646 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 257 [2019-09-05 13:01:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:35,646 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-09-05 13:01:35,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-05 13:01:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-09-05 13:01:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-05 13:01:35,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:35,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:35,651 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:35,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash -559126279, now seen corresponding path program 1 times [2019-09-05 13:01:35,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:35,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:35,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:35,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:35,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:37,478 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:37,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:37,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-05 13:01:37,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:37,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-05 13:01:37,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-05 13:01:37,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 13:01:37,482 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 65 states. [2019-09-05 13:01:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:39,197 INFO L93 Difference]: Finished difference Result 299 states and 304 transitions. [2019-09-05 13:01:39,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 13:01:39,197 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 258 [2019-09-05 13:01:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:39,199 INFO L225 Difference]: With dead ends: 299 [2019-09-05 13:01:39,199 INFO L226 Difference]: Without dead ends: 299 [2019-09-05 13:01:39,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 13:01:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-05 13:01:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 276. [2019-09-05 13:01:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-05 13:01:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2019-09-05 13:01:39,211 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 258 [2019-09-05 13:01:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:39,212 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2019-09-05 13:01:39,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-05 13:01:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2019-09-05 13:01:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-05 13:01:39,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:39,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:39,214 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:39,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash -559520514, now seen corresponding path program 1 times [2019-09-05 13:01:39,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:39,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:39,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:39,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:39,965 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:39,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:39,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:39,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:39,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:39,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:39,967 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand 6 states. [2019-09-05 13:01:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:40,618 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-09-05 13:01:40,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:40,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-05 13:01:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:40,621 INFO L225 Difference]: With dead ends: 274 [2019-09-05 13:01:40,621 INFO L226 Difference]: Without dead ends: 272 [2019-09-05 13:01:40,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-05 13:01:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-05 13:01:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-05 13:01:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2019-09-05 13:01:40,628 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 258 [2019-09-05 13:01:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:40,628 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2019-09-05 13:01:40,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2019-09-05 13:01:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-05 13:01:40,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,631 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:40,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:40,631 INFO L82 PathProgramCache]: Analyzing trace with hash -607235764, now seen corresponding path program 1 times [2019-09-05 13:01:40,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:40,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:40,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:41,267 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:41,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:41,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:41,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:41,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:41,269 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand 6 states. [2019-09-05 13:01:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:41,920 INFO L93 Difference]: Finished difference Result 280 states and 285 transitions. [2019-09-05 13:01:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:41,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-05 13:01:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:41,924 INFO L225 Difference]: With dead ends: 280 [2019-09-05 13:01:41,924 INFO L226 Difference]: Without dead ends: 280 [2019-09-05 13:01:41,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-05 13:01:41,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2019-09-05 13:01:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-05 13:01:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2019-09-05 13:01:41,930 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 258 [2019-09-05 13:01:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:41,931 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2019-09-05 13:01:41,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2019-09-05 13:01:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-05 13:01:41,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:41,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:41,933 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash -153040543, now seen corresponding path program 1 times [2019-09-05 13:01:41,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:41,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:41,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:41,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:41,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:42,808 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:42,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:42,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:42,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:42,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:42,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:42,811 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand 6 states. [2019-09-05 13:01:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:43,479 INFO L93 Difference]: Finished difference Result 283 states and 288 transitions. [2019-09-05 13:01:43,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:43,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-05 13:01:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:43,483 INFO L225 Difference]: With dead ends: 283 [2019-09-05 13:01:43,483 INFO L226 Difference]: Without dead ends: 283 [2019-09-05 13:01:43,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:01:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-05 13:01:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2019-09-05 13:01:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-05 13:01:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2019-09-05 13:01:43,490 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 259 [2019-09-05 13:01:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:43,490 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2019-09-05 13:01:43,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2019-09-05 13:01:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-05 13:01:43,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:43,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:43,493 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:43,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash 562136719, now seen corresponding path program 1 times [2019-09-05 13:01:43,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:43,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:43,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:43,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:43,789 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:43,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:43,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 13:01:43,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:43,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:01:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:01:43,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:43,791 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 6 states. [2019-09-05 13:01:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:44,030 INFO L93 Difference]: Finished difference Result 266 states and 269 transitions. [2019-09-05 13:01:44,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:44,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2019-09-05 13:01:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:44,032 INFO L225 Difference]: With dead ends: 266 [2019-09-05 13:01:44,032 INFO L226 Difference]: Without dead ends: 266 [2019-09-05 13:01:44,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:44,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-05 13:01:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-09-05 13:01:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-05 13:01:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2019-09-05 13:01:44,043 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 260 [2019-09-05 13:01:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:44,043 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2019-09-05 13:01:44,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:01:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2019-09-05 13:01:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-05 13:01:44,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:44,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:44,050 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash 246374009, now seen corresponding path program 1 times [2019-09-05 13:01:44,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:44,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:44,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:44,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:44,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:44,203 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:44,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:44,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:44,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:44,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:44,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:44,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:44,206 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand 4 states. [2019-09-05 13:01:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:44,523 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2019-09-05 13:01:44,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:44,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-05 13:01:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:44,524 INFO L225 Difference]: With dead ends: 264 [2019-09-05 13:01:44,524 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:01:44,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:01:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:01:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:01:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:01:44,526 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-09-05 13:01:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:44,527 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:01:44,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:01:44,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:01:44,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:01:44 BoogieIcfgContainer [2019-09-05 13:01:44,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:01:44,538 INFO L168 Benchmark]: Toolchain (without parser) took 36215.23 ms. Allocated memory was 132.6 MB in the beginning and 913.3 MB in the end (delta: 780.7 MB). Free memory was 85.7 MB in the beginning and 270.7 MB in the end (delta: -185.0 MB). Peak memory consumption was 595.7 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:44,541 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 106.7 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:44,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1292.41 ms. Allocated memory was 132.6 MB in the beginning and 209.2 MB in the end (delta: 76.5 MB). Free memory was 85.3 MB in the beginning and 147.9 MB in the end (delta: -62.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:44,550 INFO L168 Benchmark]: Boogie Preprocessor took 167.06 ms. Allocated memory is still 209.2 MB. Free memory was 147.9 MB in the beginning and 140.1 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:44,551 INFO L168 Benchmark]: RCFGBuilder took 2602.53 ms. Allocated memory was 209.2 MB in the beginning and 276.8 MB in the end (delta: 67.6 MB). Free memory was 139.2 MB in the beginning and 214.5 MB in the end (delta: -75.3 MB). Peak memory consumption was 137.7 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:44,553 INFO L168 Benchmark]: TraceAbstraction took 32148.39 ms. Allocated memory was 276.8 MB in the beginning and 913.3 MB in the end (delta: 636.5 MB). Free memory was 214.5 MB in the beginning and 270.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 580.3 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:44,567 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1292.41 ms. Allocated memory was 132.6 MB in the beginning and 209.2 MB in the end (delta: 76.5 MB). Free memory was 85.3 MB in the beginning and 147.9 MB in the end (delta: -62.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 167.06 ms. Allocated memory is still 209.2 MB. Free memory was 147.9 MB in the beginning and 140.1 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2602.53 ms. Allocated memory was 209.2 MB in the beginning and 276.8 MB in the end (delta: 67.6 MB). Free memory was 139.2 MB in the beginning and 214.5 MB in the end (delta: -75.3 MB). Peak memory consumption was 137.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32148.39 ms. Allocated memory was 276.8 MB in the beginning and 913.3 MB in the end (delta: 636.5 MB). Free memory was 214.5 MB in the beginning and 270.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 580.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4861]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4790]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4709]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4818]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4806]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4888]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4673]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4738]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4849]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: 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, 480 locations, 16 error locations. SAFE Result, 32.0s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 14.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1858 SDtfs, 37107 SDslu, 1966 SDs, 0 SdLazy, 9582 SolverSat, 9730 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 643 SyntacticMatches, 307 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=480occurred 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, 16 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 3604 NumberOfCodeBlocks, 3604 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3588 ConstructedInterpolants, 0 QuantifiedInterpolants, 3599162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...