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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:01:05,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:01:05,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:01:05,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:01:05,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:01:05,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:01:05,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:01:05,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:01:05,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:01:05,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:01:05,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:01:05,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:01:05,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:01:05,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:01:05,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:01:05,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:01:05,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:01:05,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:01:05,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:01:05,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:01:05,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:01:05,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:01:05,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:01:05,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:01:05,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:01:05,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:01:05,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:01:05,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:01:05,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:01:05,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:01:05,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:01:05,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:01:05,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:01:05,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:01:05,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:01:05,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:01:05,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:01:05,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:01:05,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:01:05,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:01:05,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:01:05,975 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:05,990 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:01:05,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:01:05,991 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:01:05,991 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:01:05,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:01:05,992 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:01:05,992 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:01:05,992 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:01:05,993 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:01:05,993 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:01:05,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:01:05,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:01:05,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:01:05,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:01:05,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:01:05,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:01:05,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:01:05,995 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:01:05,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:01:05,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:01:05,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:01:05,996 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:01:05,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:01:05,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:01:05,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:01:05,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:01:05,997 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:01:05,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:01:05,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:01:05,998 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:01:06,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:01:06,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:01:06,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:01:06,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:01:06,050 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:01:06,051 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+lhb-reducer.c [2019-09-05 13:01:06,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37337966/e96ffb374c734e3c8360aca5ed6b2c45/FLAG1efd454b9 [2019-09-05 13:01:06,623 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:01:06,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-09-05 13:01:06,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37337966/e96ffb374c734e3c8360aca5ed6b2c45/FLAG1efd454b9 [2019-09-05 13:01:06,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37337966/e96ffb374c734e3c8360aca5ed6b2c45 [2019-09-05 13:01:06,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:01:06,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:01:06,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:06,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:01:06,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:01:06,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:06" (1/1) ... [2019-09-05 13:01:06,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aeb50c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:06, skipping insertion in model container [2019-09-05 13:01:06,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:06" (1/1) ... [2019-09-05 13:01:06,973 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:01:07,020 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:01:07,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:07,335 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:01:07,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:07,519 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:01:07,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:07 WrapperNode [2019-09-05 13:01:07,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:07,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:01:07,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:01:07,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:01:07,536 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:07" (1/1) ... [2019-09-05 13:01:07,536 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:07" (1/1) ... [2019-09-05 13:01:07,568 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:07" (1/1) ... [2019-09-05 13:01:07,568 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:07" (1/1) ... [2019-09-05 13:01:07,601 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:07" (1/1) ... [2019-09-05 13:01:07,611 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:07" (1/1) ... [2019-09-05 13:01:07,614 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:07" (1/1) ... [2019-09-05 13:01:07,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:01:07,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:01:07,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:01:07,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:01:07,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:07" (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:07,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:01:07,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:01:07,692 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:01:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:01:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:01:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:01:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:01:07,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:01:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:01:07,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:01:08,389 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:01:08,389 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 13:01:08,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:08 BoogieIcfgContainer [2019-09-05 13:01:08,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:01:08,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:01:08,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:01:08,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:01:08,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:01:06" (1/3) ... [2019-09-05 13:01:08,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3beec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:08, skipping insertion in model container [2019-09-05 13:01:08,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:07" (2/3) ... [2019-09-05 13:01:08,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3beec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:08, skipping insertion in model container [2019-09-05 13:01:08,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:08" (3/3) ... [2019-09-05 13:01:08,401 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-09-05 13:01:08,420 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:01:08,436 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-05 13:01:08,475 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-05 13:01:08,510 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:01:08,511 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:01:08,511 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:01:08,511 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:01:08,512 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:01:08,512 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:01:08,512 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:01:08,512 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:01:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-09-05 13:01:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 13:01:08,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:08,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:08,551 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2019-09-05 13:01:08,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:08,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:08,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:08,729 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:08,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:08,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:08,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:08,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:08,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:08,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:08,756 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-09-05 13:01:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:09,132 INFO L93 Difference]: Finished difference Result 129 states and 190 transitions. [2019-09-05 13:01:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:09,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-05 13:01:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:09,148 INFO L225 Difference]: With dead ends: 129 [2019-09-05 13:01:09,148 INFO L226 Difference]: Without dead ends: 118 [2019-09-05 13:01:09,150 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:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-05 13:01:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-05 13:01:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-05 13:01:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-09-05 13:01:09,215 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2019-09-05 13:01:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:09,216 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-09-05 13:01:09,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-09-05 13:01:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:01:09,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:09,220 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:09,221 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2019-09-05 13:01:09,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:09,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:09,327 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:09,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:09,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:09,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:09,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:09,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:09,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:09,330 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 4 states. [2019-09-05 13:01:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:09,499 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-09-05 13:01:09,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:09,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 13:01:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:09,501 INFO L225 Difference]: With dead ends: 116 [2019-09-05 13:01:09,501 INFO L226 Difference]: Without dead ends: 113 [2019-09-05 13:01:09,502 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:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-05 13:01:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-05 13:01:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-05 13:01:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-09-05 13:01:09,512 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2019-09-05 13:01:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:09,513 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-09-05 13:01:09,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-09-05 13:01:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 13:01:09,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:09,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:09,516 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:09,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2019-09-05 13:01:09,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:09,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:09,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:09,573 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:09,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:09,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:09,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:09,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:09,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:09,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:09,578 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 5 states. [2019-09-05 13:01:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:09,801 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-09-05 13:01:09,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:09,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 13:01:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:09,804 INFO L225 Difference]: With dead ends: 111 [2019-09-05 13:01:09,804 INFO L226 Difference]: Without dead ends: 111 [2019-09-05 13:01:09,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-05 13:01:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-09-05 13:01:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-05 13:01:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-09-05 13:01:09,812 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2019-09-05 13:01:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:09,812 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-09-05 13:01:09,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-09-05 13:01:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:01:09,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:09,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:09,816 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:09,818 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2019-09-05 13:01:09,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:09,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:09,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:09,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:09,915 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:09,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:09,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:09,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:09,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:09,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:09,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:09,917 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states. [2019-09-05 13:01:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:10,042 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2019-09-05 13:01:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:10,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-05 13:01:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:10,044 INFO L225 Difference]: With dead ends: 109 [2019-09-05 13:01:10,044 INFO L226 Difference]: Without dead ends: 107 [2019-09-05 13:01:10,045 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:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-05 13:01:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-05 13:01:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-05 13:01:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-09-05 13:01:10,061 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2019-09-05 13:01:10,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:10,061 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-09-05 13:01:10,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:10,062 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-09-05 13:01:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:01:10,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:10,064 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2019-09-05 13:01:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,151 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:10,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:10,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:10,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:10,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:10,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:10,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:10,156 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 5 states. [2019-09-05 13:01:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:10,393 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2019-09-05 13:01:10,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:10,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 13:01:10,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:10,397 INFO L225 Difference]: With dead ends: 123 [2019-09-05 13:01:10,397 INFO L226 Difference]: Without dead ends: 123 [2019-09-05 13:01:10,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-05 13:01:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2019-09-05 13:01:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-05 13:01:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-09-05 13:01:10,418 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2019-09-05 13:01:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:10,419 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-09-05 13:01:10,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-09-05 13:01:10,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:01:10,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:10,429 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,430 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2019-09-05 13:01:10,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,498 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:10,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:10,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:10,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:10,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:10,500 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 5 states. [2019-09-05 13:01:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:10,697 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2019-09-05 13:01:10,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:10,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 13:01:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:10,699 INFO L225 Difference]: With dead ends: 103 [2019-09-05 13:01:10,700 INFO L226 Difference]: Without dead ends: 103 [2019-09-05 13:01:10,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-05 13:01:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-09-05 13:01:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-05 13:01:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-09-05 13:01:10,706 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2019-09-05 13:01:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:10,706 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-09-05 13:01:10,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-09-05 13:01:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:10,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:10,708 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2019-09-05 13:01:10,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,769 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:10,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:10,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:10,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:10,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:10,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:10,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:10,771 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2019-09-05 13:01:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,024 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-09-05 13:01:11,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:11,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,026 INFO L225 Difference]: With dead ends: 118 [2019-09-05 13:01:11,026 INFO L226 Difference]: Without dead ends: 118 [2019-09-05 13:01:11,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-05 13:01:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2019-09-05 13:01:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-05 13:01:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-09-05 13:01:11,033 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2019-09-05 13:01:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,033 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-09-05 13:01:11,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-09-05 13:01:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:11,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,035 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2019-09-05 13:01:11,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:11,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:11,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,078 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 5 states. [2019-09-05 13:01:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,308 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-09-05 13:01:11,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:11,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,310 INFO L225 Difference]: With dead ends: 118 [2019-09-05 13:01:11,310 INFO L226 Difference]: Without dead ends: 118 [2019-09-05 13:01:11,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-05 13:01:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2019-09-05 13:01:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-05 13:01:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-09-05 13:01:11,316 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2019-09-05 13:01:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,316 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-09-05 13:01:11,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-09-05 13:01:11,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:11,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,318 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2019-09-05 13:01:11,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:11,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,394 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2019-09-05 13:01:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,617 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-09-05 13:01:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:11,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,619 INFO L225 Difference]: With dead ends: 97 [2019-09-05 13:01:11,619 INFO L226 Difference]: Without dead ends: 95 [2019-09-05 13:01:11,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-05 13:01:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-05 13:01:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-05 13:01:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-09-05 13:01:11,624 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2019-09-05 13:01:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,624 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-09-05 13:01:11,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-09-05 13:01:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 13:01:11,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,627 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2019-09-05 13:01:11,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:11,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:11,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:11,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,706 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-09-05 13:01:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,927 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2019-09-05 13:01:11,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:11,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-05 13:01:11,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,929 INFO L225 Difference]: With dead ends: 109 [2019-09-05 13:01:11,929 INFO L226 Difference]: Without dead ends: 109 [2019-09-05 13:01:11,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-05 13:01:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2019-09-05 13:01:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-05 13:01:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-09-05 13:01:11,934 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2019-09-05 13:01:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,935 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-09-05 13:01:11,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-09-05 13:01:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 13:01:11,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,936 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2019-09-05 13:01:11,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:11,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:11,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:11,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:11,978 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 4 states. [2019-09-05 13:01:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,053 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-09-05 13:01:12,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:12,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-05 13:01:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,055 INFO L225 Difference]: With dead ends: 91 [2019-09-05 13:01:12,055 INFO L226 Difference]: Without dead ends: 91 [2019-09-05 13:01:12,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-05 13:01:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-05 13:01:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-05 13:01:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-09-05 13:01:12,059 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2019-09-05 13:01:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,059 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-09-05 13:01:12,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-09-05 13:01:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 13:01:12,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,061 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2019-09-05 13:01:12,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,125 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,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:12,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:12,127 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 4 states. [2019-09-05 13:01:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,242 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-09-05 13:01:12,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:12,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-05 13:01:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,243 INFO L225 Difference]: With dead ends: 89 [2019-09-05 13:01:12,243 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 13:01:12,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 13:01:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-05 13:01:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 13:01:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-05 13:01:12,247 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2019-09-05 13:01:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,248 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-05 13:01:12,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-05 13:01:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 13:01:12,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,249 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] [2019-09-05 13:01:12,250 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2019-09-05 13:01:12,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,396 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,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-05 13:01:12,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 13:01:12,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 13:01:12,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:01:12,397 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2019-09-05 13:01:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,527 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-05 13:01:12,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:01:12,527 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-05 13:01:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,528 INFO L225 Difference]: With dead ends: 65 [2019-09-05 13:01:12,528 INFO L226 Difference]: Without dead ends: 65 [2019-09-05 13:01:12,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:01:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-05 13:01:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-09-05 13:01:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 13:01:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-05 13:01:12,531 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2019-09-05 13:01:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,532 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-05 13:01:12,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 13:01:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-05 13:01:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 13:01:12,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,533 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] [2019-09-05 13:01:12,534 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2019-09-05 13:01:12,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,675 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,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-05 13:01:12,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 13:01:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 13:01:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:01:12,677 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states. [2019-09-05 13:01:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,823 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-05 13:01:12,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:01:12,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-05 13:01:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,825 INFO L225 Difference]: With dead ends: 54 [2019-09-05 13:01:12,825 INFO L226 Difference]: Without dead ends: 54 [2019-09-05 13:01:12,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-09-05 13:01:12,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-05 13:01:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-05 13:01:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 13:01:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-05 13:01:12,827 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2019-09-05 13:01:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,828 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-05 13:01:12,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 13:01:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-05 13:01:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 13:01:12,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,829 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] [2019-09-05 13:01:12,830 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2019-09-05 13:01:12,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:13,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:13,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:13,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:13,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:13,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:13,057 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 5 states. [2019-09-05 13:01:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:13,160 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-05 13:01:13,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:13,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-05 13:01:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:13,162 INFO L225 Difference]: With dead ends: 60 [2019-09-05 13:01:13,162 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 13:01:13,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 24 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 13:01:13,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-09-05 13:01:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 13:01:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-05 13:01:13,166 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-09-05 13:01:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:13,167 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-05 13:01:13,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-05 13:01:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 13:01:13,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:13,168 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] [2019-09-05 13:01:13,169 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:13,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2019-09-05 13:01:13,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:13,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:13,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:13,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:13,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:13,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:13,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:13,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:13,337 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 5 states. [2019-09-05 13:01:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:13,426 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-05 13:01:13,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:13,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-05 13:01:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:13,427 INFO L225 Difference]: With dead ends: 50 [2019-09-05 13:01:13,427 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:01:13,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 24 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:01:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:01:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:01:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:01:13,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-09-05 13:01:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:13,429 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:01:13,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:01:13,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:01:13,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:01:13 BoogieIcfgContainer [2019-09-05 13:01:13,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:01:13,438 INFO L168 Benchmark]: Toolchain (without parser) took 6481.82 ms. Allocated memory was 132.6 MB in the beginning and 314.6 MB in the end (delta: 181.9 MB). Free memory was 88.7 MB in the beginning and 174.4 MB in the end (delta: -85.7 MB). Peak memory consumption was 96.3 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,439 INFO L168 Benchmark]: CDTParser took 1.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 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:13,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.62 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 88.5 MB in the beginning and 172.5 MB in the end (delta: -84.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,441 INFO L168 Benchmark]: Boogie Preprocessor took 98.44 ms. Allocated memory is still 199.8 MB. Free memory was 172.5 MB in the beginning and 169.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,441 INFO L168 Benchmark]: RCFGBuilder took 772.62 ms. Allocated memory is still 199.8 MB. Free memory was 169.5 MB in the beginning and 121.7 MB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,442 INFO L168 Benchmark]: TraceAbstraction took 5042.61 ms. Allocated memory was 199.8 MB in the beginning and 314.6 MB in the end (delta: 114.8 MB). Free memory was 121.1 MB in the beginning and 174.4 MB in the end (delta: -53.3 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,446 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 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 563.62 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 88.5 MB in the beginning and 172.5 MB in the end (delta: -84.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.44 ms. Allocated memory is still 199.8 MB. Free memory was 172.5 MB in the beginning and 169.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 772.62 ms. Allocated memory is still 199.8 MB. Free memory was 169.5 MB in the beginning and 121.7 MB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5042.61 ms. Allocated memory was 199.8 MB in the beginning and 314.6 MB in the end (delta: 114.8 MB). Free memory was 121.1 MB in the beginning and 174.4 MB in the end (delta: -53.3 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. SAFE Result, 4.9s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 805 SDtfs, 1879 SDslu, 912 SDs, 0 SdLazy, 2278 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 43 SyntacticMatches, 53 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred 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, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 44554 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...