java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:04:21,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:04:21,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:04:21,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:04:21,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:04:21,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:04:21,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:04:21,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:04:21,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:04:21,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:04:21,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:04:21,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:04:21,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:04:21,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:04:21,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:04:21,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:04:21,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:04:21,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:04:21,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:04:21,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:04:21,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:04:21,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:04:21,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:04:21,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:04:21,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:04:21,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:04:21,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:04:21,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:04:21,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:04:21,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:04:21,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:04:21,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:04:21,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:04:21,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:04:21,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:04:21,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:04:21,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:04:21,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:04:21,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:04:21,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:04:21,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:04:21,798 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-10 02:04:21,825 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:04:21,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:04:21,826 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:04:21,826 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:04:21,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:04:21,829 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:04:21,829 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:04:21,830 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:04:21,830 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:04:21,830 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:04:21,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:04:21,832 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:04:21,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:04:21,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:04:21,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:04:21,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:04:21,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:04:21,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:04:21,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:04:21,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:04:21,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:04:21,834 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:04:21,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:04:21,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:04:21,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:04:21,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:04:21,836 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:04:21,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:04:21,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:04:21,836 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:04:21,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:04:21,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:04:21,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:04:21,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:04:21,902 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:04:21,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-09-10 02:04:21,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9271b89/3e3ce9b2984141889e8577ba1427f125/FLAG0540a6032 [2019-09-10 02:04:22,549 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:04:22,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-09-10 02:04:22,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9271b89/3e3ce9b2984141889e8577ba1427f125/FLAG0540a6032 [2019-09-10 02:04:22,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d9271b89/3e3ce9b2984141889e8577ba1427f125 [2019-09-10 02:04:22,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:04:22,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:04:22,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:22,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:04:22,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:04:22,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:22" (1/1) ... [2019-09-10 02:04:22,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bece2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:22, skipping insertion in model container [2019-09-10 02:04:22,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:22" (1/1) ... [2019-09-10 02:04:22,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:04:22,925 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:04:23,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:23,845 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:04:24,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:24,119 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:04:24,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24 WrapperNode [2019-09-10 02:04:24,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:24,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:04:24,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:04:24,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:04:24,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24" (1/1) ... [2019-09-10 02:04:24,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24" (1/1) ... [2019-09-10 02:04:24,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24" (1/1) ... [2019-09-10 02:04:24,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24" (1/1) ... [2019-09-10 02:04:24,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24" (1/1) ... [2019-09-10 02:04:24,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24" (1/1) ... [2019-09-10 02:04:24,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24" (1/1) ... [2019-09-10 02:04:24,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:04:24,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:04:24,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:04:24,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:04:24,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24" (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-10 02:04:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:04:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:04:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:04:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:04:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:04:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:04:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:04:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:04:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:04:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:04:26,417 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:04:26,417 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:04:26,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:26 BoogieIcfgContainer [2019-09-10 02:04:26,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:04:26,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:04:26,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:04:26,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:04:26,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:04:22" (1/3) ... [2019-09-10 02:04:26,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1898c384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:26, skipping insertion in model container [2019-09-10 02:04:26,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:24" (2/3) ... [2019-09-10 02:04:26,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1898c384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:26, skipping insertion in model container [2019-09-10 02:04:26,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:26" (3/3) ... [2019-09-10 02:04:26,430 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-09-10 02:04:26,440 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:04:26,453 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 02:04:26,470 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 02:04:26,516 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:04:26,516 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:04:26,517 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:04:26,517 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:04:26,517 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:04:26,517 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:04:26,517 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:04:26,518 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:04:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2019-09-10 02:04:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-10 02:04:26,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:26,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:26,570 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:26,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1514750688, now seen corresponding path program 1 times [2019-09-10 02:04:26,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:26,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:26,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:26,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:26,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:26,768 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-10 02:04:26,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:26,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:26,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:26,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:26,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:26,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:26,790 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 4 states. [2019-09-10 02:04:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:28,028 INFO L93 Difference]: Finished difference Result 484 states and 894 transitions. [2019-09-10 02:04:28,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:28,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-10 02:04:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:28,045 INFO L225 Difference]: With dead ends: 484 [2019-09-10 02:04:28,045 INFO L226 Difference]: Without dead ends: 301 [2019-09-10 02:04:28,047 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-10 02:04:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-10 02:04:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-09-10 02:04:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-10 02:04:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2019-09-10 02:04:28,106 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 11 [2019-09-10 02:04:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:28,106 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2019-09-10 02:04:28,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:28,106 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2019-09-10 02:04:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:04:28,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:28,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:28,108 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:28,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:28,109 INFO L82 PathProgramCache]: Analyzing trace with hash 287371989, now seen corresponding path program 1 times [2019-09-10 02:04:28,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:28,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:28,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:28,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:28,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:28,211 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-10 02:04:28,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:28,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:28,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:28,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:28,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:28,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:28,217 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand 4 states. [2019-09-10 02:04:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:28,652 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2019-09-10 02:04:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:28,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-10 02:04:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:28,656 INFO L225 Difference]: With dead ends: 299 [2019-09-10 02:04:28,657 INFO L226 Difference]: Without dead ends: 296 [2019-09-10 02:04:28,657 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-10 02:04:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-10 02:04:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-10 02:04:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-10 02:04:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2019-09-10 02:04:28,673 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 12 [2019-09-10 02:04:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:28,673 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2019-09-10 02:04:28,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2019-09-10 02:04:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 02:04:28,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:28,684 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:28,684 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1097283636, now seen corresponding path program 1 times [2019-09-10 02:04:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:28,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:28,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,158 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-10 02:04:31,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-10 02:04:31,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-10 02:04:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-10 02:04:31,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-09-10 02:04:31,163 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 63 states. [2019-09-10 02:04:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:32,319 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-09-10 02:04:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-10 02:04:32,320 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-10 02:04:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:32,323 INFO L225 Difference]: With dead ends: 295 [2019-09-10 02:04:32,323 INFO L226 Difference]: Without dead ends: 295 [2019-09-10 02:04:32,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 02:04:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-10 02:04:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-09-10 02:04:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-10 02:04:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2019-09-10 02:04:32,336 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 248 [2019-09-10 02:04:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:32,337 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2019-09-10 02:04:32,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-10 02:04:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2019-09-10 02:04:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 02:04:32,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:32,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:32,343 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash -343940819, now seen corresponding path program 1 times [2019-09-10 02:04:32,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:32,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:33,321 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-10 02:04:33,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:33,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:33,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:33,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:33,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:33,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:33,323 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand 6 states. [2019-09-10 02:04:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:34,022 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2019-09-10 02:04:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:34,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 02:04:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:34,029 INFO L225 Difference]: With dead ends: 294 [2019-09-10 02:04:34,029 INFO L226 Difference]: Without dead ends: 294 [2019-09-10 02:04:34,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 119 SyntacticMatches, 59 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:04:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-10 02:04:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-09-10 02:04:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-10 02:04:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-09-10 02:04:34,037 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 249 [2019-09-10 02:04:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:34,038 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-09-10 02:04:34,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-09-10 02:04:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 02:04:34,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:34,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:34,043 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:34,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1455800989, now seen corresponding path program 1 times [2019-09-10 02:04:34,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:34,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:34,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:36,184 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-10 02:04:36,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:36,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-10 02:04:36,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:36,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 02:04:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 02:04:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:04:36,188 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 65 states. [2019-09-10 02:04:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:37,843 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2019-09-10 02:04:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 02:04:37,843 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-10 02:04:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:37,846 INFO L225 Difference]: With dead ends: 293 [2019-09-10 02:04:37,846 INFO L226 Difference]: Without dead ends: 293 [2019-09-10 02:04:37,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:04:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-10 02:04:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-09-10 02:04:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-10 02:04:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-09-10 02:04:37,856 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 252 [2019-09-10 02:04:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:37,858 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-09-10 02:04:37,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 02:04:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-09-10 02:04:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 02:04:37,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:37,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:37,866 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:37,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:37,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2114804744, now seen corresponding path program 1 times [2019-09-10 02:04:37,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:37,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:38,733 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-10 02:04:38,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:38,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:38,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:38,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:38,735 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 6 states. [2019-09-10 02:04:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:39,488 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2019-09-10 02:04:39,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:39,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-10 02:04:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:39,492 INFO L225 Difference]: With dead ends: 288 [2019-09-10 02:04:39,492 INFO L226 Difference]: Without dead ends: 288 [2019-09-10 02:04:39,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 121 SyntacticMatches, 60 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:04:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-10 02:04:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-10 02:04:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-10 02:04:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-09-10 02:04:39,499 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 253 [2019-09-10 02:04:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:39,500 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-09-10 02:04:39,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:39,501 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-09-10 02:04:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 02:04:39,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:39,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:39,505 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:39,505 INFO L82 PathProgramCache]: Analyzing trace with hash -807674468, now seen corresponding path program 1 times [2019-09-10 02:04:39,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:39,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:39,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:39,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:39,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:39,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:39,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:39,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:39,859 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 5 states. [2019-09-10 02:04:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:40,099 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-09-10 02:04:40,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:40,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2019-09-10 02:04:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:40,102 INFO L225 Difference]: With dead ends: 286 [2019-09-10 02:04:40,103 INFO L226 Difference]: Without dead ends: 286 [2019-09-10 02:04:40,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-10 02:04:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-09-10 02:04:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-10 02:04:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-09-10 02:04:40,110 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 255 [2019-09-10 02:04:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:40,110 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-09-10 02:04:40,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-09-10 02:04:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 02:04:40,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:40,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:40,114 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash 731900137, now seen corresponding path program 1 times [2019-09-10 02:04:40,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:40,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:40,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:40,281 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-10 02:04:40,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:40,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:40,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:40,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:40,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:40,285 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 4 states. [2019-09-10 02:04:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:40,648 INFO L93 Difference]: Finished difference Result 284 states and 287 transitions. [2019-09-10 02:04:40,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:40,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-10 02:04:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:40,652 INFO L225 Difference]: With dead ends: 284 [2019-09-10 02:04:40,652 INFO L226 Difference]: Without dead ends: 282 [2019-09-10 02:04:40,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-10 02:04:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-10 02:04:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-10 02:04:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-09-10 02:04:40,662 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 256 [2019-09-10 02:04:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:40,663 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-09-10 02:04:40,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-09-10 02:04:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 02:04:40,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:40,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:40,667 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:40,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1228876781, now seen corresponding path program 1 times [2019-09-10 02:04:40,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:40,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:42,783 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-10 02:04:42,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:42,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-09-10 02:04:42,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:42,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 02:04:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 02:04:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:04:42,786 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 66 states. [2019-09-10 02:04:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:44,478 INFO L93 Difference]: Finished difference Result 290 states and 294 transitions. [2019-09-10 02:04:44,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 02:04:44,479 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 257 [2019-09-10 02:04:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:44,482 INFO L225 Difference]: With dead ends: 290 [2019-09-10 02:04:44,482 INFO L226 Difference]: Without dead ends: 290 [2019-09-10 02:04:44,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-09-10 02:04:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-10 02:04:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2019-09-10 02:04:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-10 02:04:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 283 transitions. [2019-09-10 02:04:44,489 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 283 transitions. Word has length 257 [2019-09-10 02:04:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:44,490 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 283 transitions. [2019-09-10 02:04:44,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 02:04:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 283 transitions. [2019-09-10 02:04:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 02:04:44,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:44,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:44,494 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:44,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1227337581, now seen corresponding path program 1 times [2019-09-10 02:04:44,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:44,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:44,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:44,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:44,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:46,288 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-10 02:04:46,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:46,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-10 02:04:46,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:46,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 02:04:46,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 02:04:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:04:46,292 INFO L87 Difference]: Start difference. First operand 280 states and 283 transitions. Second operand 65 states. [2019-09-10 02:04:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:47,971 INFO L93 Difference]: Finished difference Result 296 states and 301 transitions. [2019-09-10 02:04:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 02:04:47,972 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-09-10 02:04:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:47,974 INFO L225 Difference]: With dead ends: 296 [2019-09-10 02:04:47,974 INFO L226 Difference]: Without dead ends: 296 [2019-09-10 02:04:47,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:04:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-10 02:04:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2019-09-10 02:04:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-10 02:04:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-09-10 02:04:47,987 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 257 [2019-09-10 02:04:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:47,988 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-09-10 02:04:47,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 02:04:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-09-10 02:04:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 02:04:47,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:47,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:47,992 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash -559126279, now seen corresponding path program 1 times [2019-09-10 02:04:47,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:47,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:47,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:47,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:47,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:50,094 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-10 02:04:50,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:50,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-10 02:04:50,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:50,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-10 02:04:50,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-10 02:04:50,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-10 02:04:50,097 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 65 states. [2019-09-10 02:04:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:51,792 INFO L93 Difference]: Finished difference Result 299 states and 304 transitions. [2019-09-10 02:04:51,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 02:04:51,795 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 258 [2019-09-10 02:04:51,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:51,797 INFO L225 Difference]: With dead ends: 299 [2019-09-10 02:04:51,797 INFO L226 Difference]: Without dead ends: 299 [2019-09-10 02:04:51,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:04:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-10 02:04:51,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 276. [2019-09-10 02:04:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-10 02:04:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2019-09-10 02:04:51,804 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 258 [2019-09-10 02:04:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:51,805 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2019-09-10 02:04:51,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-10 02:04:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2019-09-10 02:04:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 02:04:51,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:51,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:51,807 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:51,807 INFO L82 PathProgramCache]: Analyzing trace with hash -559520514, now seen corresponding path program 1 times [2019-09-10 02:04:51,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:51,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:51,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:51,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:51,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:52,413 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-10 02:04:52,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:52,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:52,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:52,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:52,415 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand 6 states. [2019-09-10 02:04:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:53,038 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-09-10 02:04:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:53,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-10 02:04:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:53,041 INFO L225 Difference]: With dead ends: 274 [2019-09-10 02:04:53,042 INFO L226 Difference]: Without dead ends: 272 [2019-09-10 02:04:53,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-10 02:04:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-10 02:04:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-10 02:04:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2019-09-10 02:04:53,047 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 258 [2019-09-10 02:04:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:53,048 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2019-09-10 02:04:53,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2019-09-10 02:04:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 02:04:53,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:53,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:53,050 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:53,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash -607235764, now seen corresponding path program 1 times [2019-09-10 02:04:53,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:53,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:53,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:53,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:53,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:53,846 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-10 02:04:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:53,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:53,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:53,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:53,849 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand 6 states. [2019-09-10 02:04:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:54,526 INFO L93 Difference]: Finished difference Result 280 states and 285 transitions. [2019-09-10 02:04:54,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:54,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-09-10 02:04:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:54,529 INFO L225 Difference]: With dead ends: 280 [2019-09-10 02:04:54,529 INFO L226 Difference]: Without dead ends: 280 [2019-09-10 02:04:54,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:04:54,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-10 02:04:54,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2019-09-10 02:04:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-10 02:04:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2019-09-10 02:04:54,535 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 258 [2019-09-10 02:04:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:54,536 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2019-09-10 02:04:54,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2019-09-10 02:04:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-10 02:04:54,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:54,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:54,538 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash -153040543, now seen corresponding path program 1 times [2019-09-10 02:04:54,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:54,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:54,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:54,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:54,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:55,231 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-10 02:04:55,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:55,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:55,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:55,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:55,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:55,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:55,233 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand 6 states. [2019-09-10 02:04:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:55,816 INFO L93 Difference]: Finished difference Result 283 states and 288 transitions. [2019-09-10 02:04:55,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:55,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-10 02:04:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:55,819 INFO L225 Difference]: With dead ends: 283 [2019-09-10 02:04:55,819 INFO L226 Difference]: Without dead ends: 283 [2019-09-10 02:04:55,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:04:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-10 02:04:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2019-09-10 02:04:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-10 02:04:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2019-09-10 02:04:55,825 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 259 [2019-09-10 02:04:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:55,826 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2019-09-10 02:04:55,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2019-09-10 02:04:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 02:04:55,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:55,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:55,828 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:55,828 INFO L82 PathProgramCache]: Analyzing trace with hash 562136719, now seen corresponding path program 1 times [2019-09-10 02:04:55,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:55,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:55,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:55,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:55,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:56,209 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-10 02:04:56,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:56,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:56,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:56,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:56,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:56,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:56,210 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 6 states. [2019-09-10 02:04:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:56,502 INFO L93 Difference]: Finished difference Result 266 states and 269 transitions. [2019-09-10 02:04:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:56,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2019-09-10 02:04:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:56,506 INFO L225 Difference]: With dead ends: 266 [2019-09-10 02:04:56,506 INFO L226 Difference]: Without dead ends: 266 [2019-09-10 02:04:56,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-10 02:04:56,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-09-10 02:04:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-10 02:04:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2019-09-10 02:04:56,516 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 260 [2019-09-10 02:04:56,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:56,517 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2019-09-10 02:04:56,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2019-09-10 02:04:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 02:04:56,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:56,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:56,528 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash 246374009, now seen corresponding path program 1 times [2019-09-10 02:04:56,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:56,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:56,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:56,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:56,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:56,679 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-10 02:04:56,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:56,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:56,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:56,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:56,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:56,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:56,682 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand 4 states. [2019-09-10 02:04:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:56,957 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2019-09-10 02:04:56,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:56,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-10 02:04:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:56,958 INFO L225 Difference]: With dead ends: 264 [2019-09-10 02:04:56,959 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:04:56,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:04:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:04:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:04:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:04:56,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-09-10 02:04:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:56,960 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:04:56,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:04:56,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:04:56,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:04:56 BoogieIcfgContainer [2019-09-10 02:04:56,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:04:56,971 INFO L168 Benchmark]: Toolchain (without parser) took 34169.52 ms. Allocated memory was 135.3 MB in the beginning and 795.3 MB in the end (delta: 660.1 MB). Free memory was 88.5 MB in the beginning and 421.3 MB in the end (delta: -332.8 MB). Peak memory consumption was 327.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:56,973 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 135.3 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:04:56,975 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1319.03 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 88.0 MB in the beginning and 133.7 MB in the end (delta: -45.7 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:56,981 INFO L168 Benchmark]: Boogie Preprocessor took 208.82 ms. Allocated memory is still 201.3 MB. Free memory was 133.7 MB in the beginning and 125.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:56,982 INFO L168 Benchmark]: RCFGBuilder took 2090.13 ms. Allocated memory was 201.3 MB in the beginning and 261.6 MB in the end (delta: 60.3 MB). Free memory was 125.9 MB in the beginning and 115.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:56,983 INFO L168 Benchmark]: TraceAbstraction took 30547.04 ms. Allocated memory was 261.6 MB in the beginning and 795.3 MB in the end (delta: 533.7 MB). Free memory was 115.1 MB in the beginning and 421.3 MB in the end (delta: -306.2 MB). Peak memory consumption was 227.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:56,991 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.19 ms. Allocated memory is still 135.3 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1319.03 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 88.0 MB in the beginning and 133.7 MB in the end (delta: -45.7 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 208.82 ms. Allocated memory is still 201.3 MB. Free memory was 133.7 MB in the beginning and 125.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2090.13 ms. Allocated memory was 201.3 MB in the beginning and 261.6 MB in the end (delta: 60.3 MB). Free memory was 125.9 MB in the beginning and 115.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30547.04 ms. Allocated memory was 261.6 MB in the beginning and 795.3 MB in the end (delta: 533.7 MB). Free memory was 115.1 MB in the beginning and 421.3 MB in the end (delta: -306.2 MB). Peak memory consumption was 227.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4818]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4888]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4709]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4673]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4738]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4790]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4849]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4806]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4861]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 480 locations, 16 error locations. SAFE Result, 30.4s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1858 SDtfs, 37107 SDslu, 1966 SDs, 0 SdLazy, 9582 SolverSat, 9730 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 643 SyntacticMatches, 307 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=480occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 3604 NumberOfCodeBlocks, 3604 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3588 ConstructedInterpolants, 0 QuantifiedInterpolants, 3599162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...