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-c6af20d [2019-09-03 20:51:52,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:51:52,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:51:52,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:51:52,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:51:52,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:51:52,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:51:52,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:51:52,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:51:52,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:51:52,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:51:52,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:51:52,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:51:52,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:51:52,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:51:52,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:51:52,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:51:52,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:51:52,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:51:52,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:51:52,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:51:52,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:51:52,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:51:52,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:51:52,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:51:52,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:51:52,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:51:52,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:51:52,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:51:52,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:51:52,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:51:52,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:51:52,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:51:52,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:51:52,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:51:52,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:51:52,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:51:52,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:51:52,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:51:52,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:51:52,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:51:52,841 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-03 20:51:52,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:51:52,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:51:52,862 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:51:52,862 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:51:52,863 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:51:52,863 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:51:52,864 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:51:52,864 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:51:52,864 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:51:52,864 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:51:52,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:51:52,867 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:51:52,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:51:52,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:51:52,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:51:52,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:51:52,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:51:52,868 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:51:52,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:51:52,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:51:52,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:51:52,869 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:51:52,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:51:52,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:52,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:51:52,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:51:52,870 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:51:52,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:51:52,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:51:52,871 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:51:52,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:51:52,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:51:52,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:51:52,915 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:51:52,915 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:51:52,916 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-03 20:51:52,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77a3255a/f16ecc30a1884615b7f10aabeaaa6df9/FLAGeab1a9b72 [2019-09-03 20:51:53,428 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:51:53,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-09-03 20:51:53,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77a3255a/f16ecc30a1884615b7f10aabeaaa6df9/FLAGeab1a9b72 [2019-09-03 20:51:53,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77a3255a/f16ecc30a1884615b7f10aabeaaa6df9 [2019-09-03 20:51:53,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:51:53,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:51:53,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:53,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:51:53,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:51:53,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:53" (1/1) ... [2019-09-03 20:51:53,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@840a4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:53, skipping insertion in model container [2019-09-03 20:51:53,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:53" (1/1) ... [2019-09-03 20:51:53,814 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:51:53,862 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:51:54,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:54,157 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:51:54,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:54,364 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:51:54,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54 WrapperNode [2019-09-03 20:51:54,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:54,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:51:54,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:51:54,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:51:54,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54" (1/1) ... [2019-09-03 20:51:54,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54" (1/1) ... [2019-09-03 20:51:54,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54" (1/1) ... [2019-09-03 20:51:54,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54" (1/1) ... [2019-09-03 20:51:54,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54" (1/1) ... [2019-09-03 20:51:54,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54" (1/1) ... [2019-09-03 20:51:54,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54" (1/1) ... [2019-09-03 20:51:54,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:51:54,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:51:54,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:51:54,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:51:54,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54" (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-03 20:51:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:51:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:51:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:51:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:51:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:51:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:51:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:51:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:51:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:51:54,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:51:55,111 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:51:55,112 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:51:55,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:55 BoogieIcfgContainer [2019-09-03 20:51:55,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:51:55,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:51:55,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:51:55,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:51:55,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:51:53" (1/3) ... [2019-09-03 20:51:55,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1aa3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:55, skipping insertion in model container [2019-09-03 20:51:55,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:54" (2/3) ... [2019-09-03 20:51:55,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1aa3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:55, skipping insertion in model container [2019-09-03 20:51:55,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:55" (3/3) ... [2019-09-03 20:51:55,123 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-09-03 20:51:55,133 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:51:55,145 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-03 20:51:55,162 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-03 20:51:55,210 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:51:55,210 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:51:55,211 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:51:55,211 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:51:55,211 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:51:55,212 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:51:55,212 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:51:55,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:51:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-09-03 20:51:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:51:55,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:55,240 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:55,241 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:55,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:55,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2019-09-03 20:51:55,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:55,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:55,402 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-03 20:51:55,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:55,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:55,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:55,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:55,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:55,427 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-09-03 20:51:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:55,790 INFO L93 Difference]: Finished difference Result 129 states and 190 transitions. [2019-09-03 20:51:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:51:55,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-03 20:51:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:55,803 INFO L225 Difference]: With dead ends: 129 [2019-09-03 20:51:55,804 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:51:55,805 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-03 20:51:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:51:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-03 20:51:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 20:51:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-09-03 20:51:55,849 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2019-09-03 20:51:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:55,850 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-09-03 20:51:55,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-09-03 20:51:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:51:55,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:55,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:55,852 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:55,852 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2019-09-03 20:51:55,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:55,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:55,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:55,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:55,914 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-03 20:51:55,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:55,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:55,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:55,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:55,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:55,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:55,917 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 4 states. [2019-09-03 20:51:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:56,099 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-09-03 20:51:56,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:51:56,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:51:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:56,104 INFO L225 Difference]: With dead ends: 116 [2019-09-03 20:51:56,105 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 20:51:56,106 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-03 20:51:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 20:51:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-03 20:51:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 20:51:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-09-03 20:51:56,125 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2019-09-03 20:51:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:56,125 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-09-03 20:51:56,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-09-03 20:51:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:51:56,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:56,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:56,129 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2019-09-03 20:51:56,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:56,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:56,235 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-03 20:51:56,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:56,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:56,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:56,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:56,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:56,238 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 5 states. [2019-09-03 20:51:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:56,453 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-09-03 20:51:56,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:56,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 20:51:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:56,455 INFO L225 Difference]: With dead ends: 111 [2019-09-03 20:51:56,456 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 20:51:56,456 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-03 20:51:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 20:51:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-09-03 20:51:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 20:51:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-09-03 20:51:56,465 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2019-09-03 20:51:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:56,465 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-09-03 20:51:56,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-09-03 20:51:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:51:56,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:56,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:56,468 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2019-09-03 20:51:56,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:56,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:56,518 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-03 20:51:56,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:56,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:56,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:56,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:56,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:56,520 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states. [2019-09-03 20:51:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:56,651 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2019-09-03 20:51:56,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:51:56,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 20:51:56,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:56,653 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:51:56,653 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 20:51:56,656 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-03 20:51:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 20:51:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-03 20:51:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 20:51:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-09-03 20:51:56,666 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2019-09-03 20:51:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:56,671 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-09-03 20:51:56,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-09-03 20:51:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:51:56,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:56,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:56,673 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2019-09-03 20:51:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:56,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:56,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:56,754 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-03 20:51:56,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:56,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:56,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:56,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:56,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:56,756 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 5 states. [2019-09-03 20:51:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:56,973 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2019-09-03 20:51:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:56,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:51:56,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:56,976 INFO L225 Difference]: With dead ends: 123 [2019-09-03 20:51:56,977 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 20:51:56,977 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-03 20:51:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 20:51:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2019-09-03 20:51:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 20:51:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-09-03 20:51:56,985 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2019-09-03 20:51:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:56,997 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-09-03 20:51:56,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-09-03 20:51:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:51:56,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:56,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:56,999 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2019-09-03 20:51:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,035 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-03 20:51:57,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,038 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 5 states. [2019-09-03 20:51:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,249 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2019-09-03 20:51:57,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:57,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:51:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,251 INFO L225 Difference]: With dead ends: 103 [2019-09-03 20:51:57,252 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 20:51:57,252 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-03 20:51:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 20:51:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-09-03 20:51:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 20:51:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-09-03 20:51:57,260 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2019-09-03 20:51:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,261 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-09-03 20:51:57,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-09-03 20:51:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:51:57,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,262 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-03 20:51:57,262 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,263 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2019-09-03 20:51:57,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,351 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-03 20:51:57,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,352 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2019-09-03 20:51:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,561 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-09-03 20:51:57,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:57,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:51:57,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,563 INFO L225 Difference]: With dead ends: 118 [2019-09-03 20:51:57,563 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:51:57,563 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-03 20:51:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:51:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2019-09-03 20:51:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 20:51:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-09-03 20:51:57,568 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2019-09-03 20:51:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,569 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-09-03 20:51:57,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-09-03 20:51:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:51:57,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,570 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-03 20:51:57,571 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,571 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2019-09-03 20:51:57,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,621 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-03 20:51:57,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,623 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 5 states. [2019-09-03 20:51:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:57,831 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-09-03 20:51:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:57,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:51:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:57,833 INFO L225 Difference]: With dead ends: 118 [2019-09-03 20:51:57,833 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:51:57,834 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-03 20:51:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:51:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2019-09-03 20:51:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 20:51:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-09-03 20:51:57,839 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2019-09-03 20:51:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:57,840 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-09-03 20:51:57,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-09-03 20:51:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:51:57,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:57,841 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-03 20:51:57,841 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2019-09-03 20:51:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:57,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:57,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:57,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:57,914 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-03 20:51:57,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:57,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:57,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:57,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:57,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:57,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:57,916 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2019-09-03 20:51:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:58,117 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-09-03 20:51:58,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:58,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:51:58,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:58,119 INFO L225 Difference]: With dead ends: 97 [2019-09-03 20:51:58,119 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 20:51:58,119 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-03 20:51:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 20:51:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-03 20:51:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 20:51:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-09-03 20:51:58,124 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2019-09-03 20:51:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:58,125 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-09-03 20:51:58,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-09-03 20:51:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:51:58,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:58,126 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-03 20:51:58,127 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2019-09-03 20:51:58,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:58,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:58,199 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-03 20:51:58,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:58,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:58,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:58,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:58,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:58,202 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-09-03 20:51:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:58,407 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2019-09-03 20:51:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:58,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 20:51:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:58,408 INFO L225 Difference]: With dead ends: 109 [2019-09-03 20:51:58,409 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 20:51:58,409 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-03 20:51:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 20:51:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2019-09-03 20:51:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 20:51:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-09-03 20:51:58,413 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2019-09-03 20:51:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:58,413 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-09-03 20:51:58,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-09-03 20:51:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:51:58,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:58,414 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-03 20:51:58,415 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2019-09-03 20:51:58,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:58,447 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-03 20:51:58,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:58,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:58,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:58,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:58,449 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 4 states. [2019-09-03 20:51:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:58,525 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-09-03 20:51:58,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:51:58,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-03 20:51:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:58,526 INFO L225 Difference]: With dead ends: 91 [2019-09-03 20:51:58,526 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 20:51:58,527 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-03 20:51:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 20:51:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-03 20:51:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 20:51:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-09-03 20:51:58,530 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2019-09-03 20:51:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:58,530 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-09-03 20:51:58,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-09-03 20:51:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:51:58,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:58,531 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-03 20:51:58,532 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2019-09-03 20:51:58,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:58,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:58,566 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-03 20:51:58,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:58,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:58,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:58,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:58,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:58,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:58,567 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 4 states. [2019-09-03 20:51:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:58,682 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-09-03 20:51:58,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:51:58,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-03 20:51:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:58,683 INFO L225 Difference]: With dead ends: 89 [2019-09-03 20:51:58,683 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 20:51:58,684 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-03 20:51:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 20:51:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-03 20:51:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 20:51:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-03 20:51:58,687 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2019-09-03 20:51:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:58,687 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-03 20:51:58,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-03 20:51:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:51:58,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:58,689 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-03 20:51:58,689 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2019-09-03 20:51:58,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:58,835 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-03 20:51:58,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:58,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-03 20:51:58,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:58,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:51:58,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:51:58,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:51:58,837 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2019-09-03 20:51:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:58,978 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-03 20:51:58,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:51:58,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-03 20:51:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:58,980 INFO L225 Difference]: With dead ends: 65 [2019-09-03 20:51:58,980 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 20:51:58,980 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-03 20:51:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 20:51:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-09-03 20:51:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 20:51:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-03 20:51:58,983 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2019-09-03 20:51:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:58,983 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-03 20:51:58,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:51:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-03 20:51:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 20:51:58,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:58,985 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-03 20:51:58,985 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:58,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2019-09-03 20:51:58,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:58,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:58,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:58,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:59,142 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-03 20:51:59,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:59,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-03 20:51:59,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:59,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 20:51:59,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 20:51:59,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:51:59,144 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states. [2019-09-03 20:51:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:59,309 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-09-03 20:51:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 20:51:59,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-03 20:51:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:59,310 INFO L225 Difference]: With dead ends: 54 [2019-09-03 20:51:59,310 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 20:51:59,311 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-03 20:51:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 20:51:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-03 20:51:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 20:51:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-03 20:51:59,313 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2019-09-03 20:51:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:59,313 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-03 20:51:59,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 20:51:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-03 20:51:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 20:51:59,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:59,315 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-03 20:51:59,315 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2019-09-03 20:51:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:59,525 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-03 20:51:59,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:59,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:59,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:59,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:59,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:59,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:59,526 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 5 states. [2019-09-03 20:51:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:59,623 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-03 20:51:59,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:51:59,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-03 20:51:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:59,625 INFO L225 Difference]: With dead ends: 60 [2019-09-03 20:51:59,625 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 20:51:59,625 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-03 20:51:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 20:51:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-09-03 20:51:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 20:51:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-03 20:51:59,628 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-09-03 20:51:59,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:59,628 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-03 20:51:59,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-03 20:51:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 20:51:59,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:59,629 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-03 20:51:59,630 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2019-09-03 20:51:59,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:59,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:59,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:59,823 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-03 20:51:59,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:59,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:51:59,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:59,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:51:59,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:51:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:59,825 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 5 states. [2019-09-03 20:51:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:59,915 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-09-03 20:51:59,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:59,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-03 20:51:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:59,916 INFO L225 Difference]: With dead ends: 50 [2019-09-03 20:51:59,916 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:51:59,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 24 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:51:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:51:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:51:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:51:59,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-09-03 20:51:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:59,918 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:51:59,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:51:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:51:59,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:51:59,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:51:59 BoogieIcfgContainer [2019-09-03 20:51:59,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:51:59,929 INFO L168 Benchmark]: Toolchain (without parser) took 6128.57 ms. Allocated memory was 137.9 MB in the beginning and 312.0 MB in the end (delta: 174.1 MB). Free memory was 87.2 MB in the beginning and 170.2 MB in the end (delta: -83.0 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,932 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 105.7 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.10 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 86.8 MB in the beginning and 173.3 MB in the end (delta: -86.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,939 INFO L168 Benchmark]: Boogie Preprocessor took 56.14 ms. Allocated memory is still 200.3 MB. Free memory was 173.3 MB in the beginning and 170.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,940 INFO L168 Benchmark]: RCFGBuilder took 691.85 ms. Allocated memory is still 200.3 MB. Free memory was 170.1 MB in the beginning and 122.1 MB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,941 INFO L168 Benchmark]: TraceAbstraction took 4811.36 ms. Allocated memory was 200.3 MB in the beginning and 312.0 MB in the end (delta: 111.7 MB). Free memory was 122.1 MB in the beginning and 170.2 MB in the end (delta: -48.1 MB). Peak memory consumption was 63.6 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:59,947 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 105.7 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 565.10 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 86.8 MB in the beginning and 173.3 MB in the end (delta: -86.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.14 ms. Allocated memory is still 200.3 MB. Free memory was 173.3 MB in the beginning and 170.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 691.85 ms. Allocated memory is still 200.3 MB. Free memory was 170.1 MB in the beginning and 122.1 MB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4811.36 ms. Allocated memory was 200.3 MB in the beginning and 312.0 MB in the end (delta: 111.7 MB). Free memory was 122.1 MB in the beginning and 170.2 MB in the end (delta: -48.1 MB). Peak memory consumption was 63.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: 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: 890]: 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: 252]: 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: 43]: 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: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: 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: 264]: 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.7s 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...